Author of the publication

Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity.

, , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 553-565. Springer, (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

Offline Dynamic Higher Connectivity., , and . CoRR, (2017)Selectable Heaps and Optimal Lazy Search Trees., and . CoRR, (2020)Selectable Heaps and Optimal Lazy Search Trees., and . SODA, page 1962-1975. SIAM, (2022)A Simple Algorithm for Minimum Cuts in Near-Linear Time., , and . SWAT, volume 162 of LIPIcs, page 12:1-12:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Numerical Tic-Tac-Toe on the 4×4 Board., , , and . COCOON, volume 8591 of Lecture Notes in Computer Science, page 537-546. Springer, (2014)Baby-Step Giant-Step Algorithms for the Symmetric Group., and . ISSAC, page 55-62. ACM, (2016)On Approximate Range Mode and Range Selection., , , , and . ISAAC, volume 149 of LIPIcs, page 57:1-57:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Efficient Data Structures for Partial Orders, Range Modes, and Graph Cuts.. University of Waterloo, Ontario, Canada, (2021)base-search.net (ftunivwaterloo:oai:uwspace.uwaterloo.ca:10012/16936).Lazy Search Trees., and . FOCS, page 704-715. IEEE, (2020)Faster Dynamic Range Mode., and . ICALP, volume 168 of LIPIcs, page 94:1-94:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)