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

Communication Complexity of Set-Disjointness for All Probabilities., and . Theory of Computing, 12 (1): 1-23 (2016)The Landscape of Communication Complexity Classes., , and . ICALP, volume 55 of LIPIcs, page 86:1-86:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Linear-in-Δ lower bounds in the LOCAL model., , and . Distributed Comput., 30 (5): 325-338 (2017)No sublogarithmic-time approximation scheme for bipartite vertex cover., and . Distributed Comput., 27 (6): 435-443 (2014)Extension Complexity of Independent Set Polytopes., , and . SIAM J. Comput., 47 (1): 241-269 (2018)Locally checkable proofs., and . PODC, page 159-168. ACM, (2011)Adventures in Monotone Complexity and TFNP., , , and . Electron. Colloquium Comput. Complex., (2018)A Composition Theorem for Conical Juntas., and . CCC, volume 50 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Extension Complexity of Independent Set Polytopes., , and . FOCS, page 565-572. IEEE Computer Society, (2016)Correction to: Query-to-Communication Lifting for P NP., , , and . Comput. Complex., 28 (3): 543-544 (2019)