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

Weights at the Bottom Matter When the Top is Heavy., and . CoRR, (2017)Lower Bounds on Interactive Compressibility by Constant-Depth Circuits., and . FOCS, page 619-628. IEEE Computer Society, (2012)Lower bounds for circuits with MOD_m gates., , , and . FOCS, page 709-718. IEEE Computer Society, (2006)Tribes Is Hard in the Message Passing Model., and . STACS, volume 30 of LIPIcs, page 224-237. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Graph Isomorphism is not AC^0 reducible to Group Isomorphism., , and . FSTTCS, volume 8 of LIPIcs, page 317-326. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)The NOF Multiparty Communication Complexity of Composed Functions., , , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 13-24. Springer, (2012)The story of set disjointness., and . SIGACT News, 41 (3): 59-85 (2010)Negations Provide Strongly Exponential Savings., , and . Electron. Colloquium Comput. Complex., (2020)Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead., , , and . Electron. Colloquium Comput. Complex., (2019)Lower Bounds for Elimination via Weak Regularity., , , , and . STACS, volume 66 of LIPIcs, page 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)