Author of the publication

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

, , , and . Journal of the ACM (JACM), 48 (4): 723--760 (2001)

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

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, , , and . Journal of the ACM (JACM), 48 (4): 723--760 (2001)Non-empty Bins with Simple Tabulation Hashing., and . SODA, page 2498-2512. SIAM, (2019)Discounted deterministic Markov decision processes and discounted all-pairs shortest paths., , and . SODA, page 958-967. SIAM, (2009)Confident estimation for multistage measurement sampling and aggregation., , , and . SIGMETRICS, page 109-120. ACM, (2008)Efficient Tree Layout in a Multilevel Memory Hierarchy, , , , , , and . CoRR, (2002)Coloring 3-colorable graphs with o(n^1/5) colors., and . STACS, volume 25 of LIPIcs, page 458-469. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Bottleneck Paths and Trees and Deterministic Graphical Games., , , , and . STACS, volume 47 of LIPIcs, page 27:1-27:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Shortcutting Planar Digraphs.. Comb. Probab. Comput., (1995)Increasing Internet Capacity Using Local Search., and . Comput. Optim. Appl., 29 (1): 13-48 (2004)Algorithms and estimators for accurate summarization of internet traffic., , , , and . Internet Measurement Conference, page 265-278. ACM, (2007)