Author of the publication

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy.

, , , , and . CCC, volume 300 of LIPIcs, page 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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

Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models., , and . CoRR, (2019)A New Dynamic Algorithm for Densest Subhypergraphs., , , and . WWW, page 1093-1103. ACM, (2022)Adversarially Robust Coloring for Graph Streams., , and . ITCS, volume 215 of LIPIcs, page 37:1-37:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification., and . ITCS, volume 287 of LIPIcs, page 53:1-53:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Streaming Verification of Graph Computations via Graph Structure., and . APPROX-RANDOM, volume 145 of LIPIcs, page 70:1-70:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Vertex Ordering Problems in Directed Graph Streams., , , and . CoRR, (2021)Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms., , , and . PODS, page 141-153. ACM, (2023)Low-Memory Algorithms for Online Edge Coloring., and . ICALP, volume 297 of LIPIcs, page 71:1-71:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Relative Clique Number of Planar Signed Graphs., , , and . CALDAM, volume 9602 of Lecture Notes in Computer Science, page 326-336. Springer, (2016)Vertex Ordering Problems in Directed Graph Streams., , , and . SODA, page 1786-1802. SIAM, (2020)