Author of the publication

Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds.

, , , and . ITCS, volume 251 of LIPIcs, page 46:1-46:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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

Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly., , , and . Electron. Colloquium Comput. Complex., (2022)Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs., , , , , and . ICALP, volume 198 of LIPIcs, page 52:1-52:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Preconditioning for the Geometric Transportation Problem., , and . SoCG, volume 129 of LIPIcs, page 15:1-15:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)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)Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly., , , and . ITCS, volume 251 of LIPIcs, page 80:1-80:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Protecting Single-Hop Radio Networks from Message Drops., , , and . ICALP, volume 261 of LIPIcs, page 53:1-53:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Tight Bounds for General Computation in Noisy Broadcast Networks., , , and . FOCS, page 634-645. IEEE, (2021)Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut., , , , , and . SODA, page 878-924. SIAM, (2023)Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds., , , and . ITCS, volume 251 of LIPIcs, page 46:1-46:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Rate of Interactive Codes Is Bounded Away from 1., , , and . STOC, page 1424-1437. ACM, (2023)