Author of the publication

Almost optimal super-constant-pass streaming lower bounds for reachability.

, , , , , and . STOC, page 570-583. ACM, (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

Finding Four-Node Subgraphs in Triangle Time., , , and . SODA, page 1671-1680. SIAM, (2015)Succinct Filters for Sets of Unknown Sizes., , and . ICALP, volume 168 of LIPIcs, page 79:1-79:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On Constructing Spanners from Random Gaussian Projections., , and . APPROX/RANDOM, volume 275 of LIPIcs, page 57:1-57:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Cell-probe Lower Bounds for Dynamic Problems via a New Communication Model.. CoRR, (2015)Cell-probe lower bounds from online communication complexity., , and . STOC, page 1003-1012. ACM, (2018)Cell-probe lower bounds for dynamic problems via a new communication model.. STOC, page 362-374. ACM, (2016)Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly., , , and . Electron. Colloquium Comput. Complex., (2022)Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions., and . ITCS, volume 287 of LIPIcs, page 99:1-99:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems., , , and . FOCS, page 354-364. IEEE, (2020)Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries., , , and . FOCS, page 1842-1862. IEEE, (2023)