Author of the publication

Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All.

, , and . ITCS, volume 67 of LIPIcs, page 18:1-18:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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 Space Complexity of Mirror Games., and . ITCS, volume 124 of LIPIcs, page 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Role of Randomness and Noise in Strategic Classification., and . FORC, volume 156 of LIPIcs, page 9:1-9:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Tracking and Improving Information in the Service of Fairness., , and . EC, page 809-824. ACM, (2019)Extractor-Based Time-Space Lower Bounds for Learning., , and . CoRR, (2017)Time-Space Lower Bounds for Two-Pass Learning., , and . CCC, volume 137 of LIPIcs, page 22:1-22:39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Implications of Space-Bounded Computation. Princeton University, USA, (2020)Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG., , and . APPROX-RANDOM, volume 176 of LIPIcs, page 21:1-21:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Memory-Sample Lower Bounds for Learning Parity with Noise., , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 60:1-60:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Hitting sets with near-optimal error for read-once branching programs., , and . STOC, page 353-362. ACM, (2018)New Security Notions and Feasibility Results for Authentication of Quantum Data., , and . CRYPTO (2), volume 10402 of Lecture Notes in Computer Science, page 342-371. Springer, (2017)