| 2005 | ||
|---|---|---|
| j2 | Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms 1(2): 243-264 (2005) | |
| 2003 | ||
| i1 | Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Maintaining Information in Fully-Dynamic Trees with Top Trees. CoRR cs.DS/0310065 (2003) | |
| 2001 | ||
| j1 | Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4): 723-760 (2001) | |
| 2000 | ||
| c5 | Stephen Alstrup, Jacob Holm: Improved Algorithms for Finding Level Ancestors in Dynamic Trees. ICALP 2000: 73-84 | |
| c4 | Stephen Alstrup, Jacob Holm, Mikkel Thorup: Maintaining Center and Median in Dynamic Trees. SWAT 2000: 46-56 | |
| 1998 | ||
| c3 | Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Direct Routing on Trees (Extended Abstract). SODA 1998: 342-349 | |
| c2 | Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. STOC 1998: 79-89 | |
| 1997 | ||
| c1 | Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Minimizing Diameters of Dynamic Trees. ICALP 1997: 270-280 | |
| 1 | Stephen Alstrup | |
| 2 | Kristian de Lichtenberg | |
| 3 | Mikkel Thorup |
Data released under the ODC-BY 1.0 license — See also our legal information page