Search the dblp DataBase
Kristian de Lichtenberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. [Citation Graph (1, 0)][DBLP]
STOC, 1998, pp:79-89 [Conf] - Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Minimizing Diameters of Dynamic Trees. [Citation Graph (0, 0)][DBLP]
ICALP, 1997, pp:270-280 [Conf] - Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Direct Routing on Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SODA, 1998, pp:342-349 [Conf] - Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Maintaining Information in Fully-Dynamic Trees with Top Trees [Citation Graph (0, 0)][DBLP]
CoRR, 2003, v:0, n:, pp:- [Journal] - Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. [Citation Graph (0, 0)][DBLP]
J. ACM, 2001, v:48, n:4, pp:723-760 [Journal] - Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Maintaining information in fully dynamic trees with top trees. [Citation Graph (0, 0)][DBLP]
ACM Transactions on Algorithms, 2005, v:1, n:2, pp:243-264 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002