Author of the publication

Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality.

, , , , and . ITCS, volume 185 of LIPIcs, page 26:1-26:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Improved Monotonicity Testers via Hypercube Embeddings., , , and . ITCS, volume 251 of LIPIcs, page 25:1-25:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)NP-hardness of approximately solving linear equations over reals., and . STOC, page 413-420. ACM, (2011)Improved Lower Bounds on the Randomized Complexity of Graph Properties., and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 285-296. Springer, (2001)Approximation Algorithms for the Max-Min Allocation Problem., and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 204-217. Springer, (2007)Improved 3LIN Hardness via Linear Label Cover., , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Unique Games Conjecture (Invited Survey).. CCC, page 99-121. IEEE Computer Society, (2010)Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness., , and . CCC, page 107-117. IEEE Computer Society, (2003)Towards an optimal query efficient PCP?, , and . ITCS, page 173-186. ACM, (2013)Hardness of Finding Independent Sets in Almost q-Colorable Graphs., and . FOCS, page 380-389. IEEE Computer Society, (2012)Hardness of Finding Independent Sets in Almost 3-Colorable Graphs., , , and . FOCS, page 212-221. IEEE Computer Society, (2010)