Kristian de Lichtenberg

According to our database, Kristian de Lichtenberg authored at least 4 papers between 1997 and 2005.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2005

Maintaining information in fully dynamic trees with top trees.

Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

ACM Trans. Algorithms, 2005

1998

Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity.

Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Direct Routing on Trees (Extended Abstract).

Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Minimizing Diameters of Dynamic Trees.

Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997