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

No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover., and . DISC, volume 7611 of Lecture Notes in Computer Science, page 181-194. Springer, (2012)String Matching: Communication, Circuits, and Learning., , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 56:1-56:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Correction to: Query-to-Communication Lifting for P NP., , , and . Comput. Complex., 28 (3): 543-544 (2019)A Lower Bound for Sampling Disjoint Sets., and . ACM Trans. Comput. Theory, 12 (3): 20:1-20:13 (2020)Deterministic Communication vs. Partition Number., , and . Electron. Colloquium Comput. Complex., (2015)Lower Bounds for Clique vs. Independent Set.. Electron. Colloquium Comput. Complex., (2015)Rectangles Are Nonnegative Juntas., , , , and . Electron. Colloquium Comput. Complex., (2014)Automating Cutting Planes is NP-Hard., , , and . Electron. Colloquium Comput. Complex., (2020)Query-to-Communication Lifting for P^NP., , , and . Electron. Colloquium Comput. Complex., (2017)Extension Complexity of Independent Set Polytopes., , and . SIAM J. Comput., 47 (1): 241-269 (2018)