Author of the publication

Relative Discrepancy does not separate Information and Communication Complexity.

, , , , , and . Electron. Colloquium Comput. Complex., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Hardness of Being Private., , , , , and . ACM Trans. Comput. Theory, 6 (1): 1:1-1:24 (2014)Formal Theories for Logspace Counting. CoRR, (2010)The Communication Complexity of Functions with Large Outputs., , , and . SIROCCO, volume 13892 of Lecture Notes in Computer Science, page 427-458. Springer, (2023)Efficient Parallelization of Dynamic Programming for Large Applications., , and . PEARC, page 1-9. ACM, (2023)Formal Theories for Linear Algebra., and . CSL, volume 6247 of Lecture Notes in Computer Science, page 245-259. Springer, (2010)Formal Theories for Linear Algebra, and . Logical Methods in Computer Science, (2012)Relative Discrepancy does not separate Information and Communication Complexity., , , , , and . Electron. Colloquium Comput. Complex., (2015)The Hardness of Being Private., , , , , and . CCC, page 192-202. IEEE Computer Society, (2012)Relative Discrepancy Does Not Separate Information and Communication Complexity., , , , , and . TOCT, 9 (1): 4:1-4:15 (2016)Trading Privacy for Communication.. University of Toronto, Canada, (2019)