dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Kristian de Lichtenberg (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStephen 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)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Maintaining Information in Fully-Dynamic Trees with Top Trees CoRR cs.DS/0310065: (2003)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJacob 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)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Direct Routing on Trees (Extended Abstract). SODA 1998: 342-349
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJacob 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Minimizing Diameters of Dynamic Trees. ICALP 1997: 270-280

Selection of 6 from 6 records - Kristian de Lichtenberg has 3 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page