Author of the publication

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

Property Testing Lower Bounds via Communication Complexity., , and . Comput. Complex., 21 (2): 311-358 (2012)Streaming Estimation of Information-Theoretic Metrics for Anomaly Detection (Extended Abstract)., , , and . RAID, volume 5230 of Lecture Notes in Computer Science, page 412-414. Springer, (2008)Towards a Reverse Newman's Theorem in Interactive Information Complexity., , , , , and . Algorithmica, 76 (3): 749-781 (2016)Optimal Separation and Strong Direct Sum for Randomized Query Complexity., and . CCC, volume 137 of LIPIcs, page 29:1-29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Tight Lower Bound for Monotonicity Testing over Large Ranges. CoRR, (2013)Lower Bounds for Testing Computability by Small Width OBDDs., , and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 320-331. Springer, (2011)The Maximum Communication Complexity of Multi-Party Pointer Jumping.. CCC, page 379-386. IEEE Computer Society, (2009)Towards a Reverse Newman's Theorem in Interactive Information Complexity., , , , , and . CCC, page 24-33. IEEE Computer Society, (2013)The Information Complexity of Hamming Distance., , and . APPROX-RANDOM, volume 28 of LIPIcs, page 465-489. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Certifying Equality With Limited Interaction., , , , and . APPROX-RANDOM, volume 28 of LIPIcs, page 545-581. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)