Author of the publication

Smoothed Analysis of the Komlós Conjecture.

, , , , and . ICALP, volume 229 of LIPIcs, page 14:1-14:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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 Power of Adaptivity in Quantum Query Algorithms., , , and . CoRR, (2023)On Parallelizing Streaming Algorithms., and . Electron. Colloquium Comput. Complex., (2015)Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms., , and . CCC, volume 234 of LIPIcs, page 28:1-28:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Majorizing Measures for the Optimizer., , , and . ITCS, volume 185 of LIPIcs, page 73:1-73:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Exponential Separation between Quantum Communication and Logarithm of Approximate Rank., and . FOCS, page 966-981. IEEE Computer Society, (2019)Fourier Growth of Communication Protocols for XOR Functions., , , and . FOCS, page 721-732. IEEE, (2023)Lower Bounds for Approximating the Matching Polytope.. SODA, page 1585-1604. SIAM, (2018)Quantum Cryptography in Algorithmica., , , and . STOC, page 1589-1602. ACM, (2023)k-forrelation optimally separates Quantum and classical query complexity., and . STOC, page 1303-1316. ACM, (2021)Fooling Pairs in Randomized Communication Complexity., , and . SIROCCO, volume 9988 of Lecture Notes in Computer Science, page 49-59. (2016)