Author of the publication

On the Computational Power of Radio Channels.

, , , and . DISC, volume 146 of LIPIcs, page 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

Games for exchanging information., and . STOC, page 423-432. ACM, (2008)Binary Interactive Error Resilience Beyond $^1\!/\!_8$ (or why $(^1\!/\!_2)^3 > ^1\!/\!_8)$., , and . FOCS, page 470-481. IEEE, (2020)Statistically Near-Optimal Hypothesis Selection., , , , and . FOCS, page 909-919. IEEE, (2021)Interactive Coding Over the Noisy Broadcast Channel., , and . Electron. Colloquium Comput. Complex., (2017)Circuits resilient to short-circuit errors., , , , , , and . STOC, page 582-594. ACM, (2022)Exponential Separation of Information and Communication for Boolean Functions., , and . STOC, page 557-566. ACM, (2015)Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound., , , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 701-712. Springer, (2014)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)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)