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

Streaming complexity of CSPs with randomly ordered constraints., , , and . SODA, page 4083-4103. SIAM, (2023)Computation over the Noisy Broadcast Channel with Malicious Parties., , , and . ITCS, volume 185 of LIPIcs, page 82:1-82:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Circuits resilient to short-circuit errors., , , , , , and . STOC, page 582-594. ACM, (2022)Binary Interactive Error Resilience Beyond $^1\!/\!_8$ (or why $(^1\!/\!_2)^3 > ^1\!/\!_8)$., , and . FOCS, page 470-481. IEEE, (2020)Exponential communication separations between notions of selfishness., , , , and . STOC, page 947-960. ACM, (2021)Optimal error resilience of adaptive message exchange., , and . STOC, page 1235-1247. ACM, (2021)Interactive error resilience beyond 2/7., , and . STOC, page 565-578. ACM, (2020)Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems., , , and . FOCS, page 354-364. IEEE, (2020)Binary Codes with Resilience Beyond 1/4 via Interaction., , , and . FOCS, page 1-12. IEEE, (2022)An Improved Lower Bound for Matroid Intersection Prophet Inequalities., , and . ITCS, volume 251 of LIPIcs, page 95:1-95:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)