Stefan Eckhardt

According to our database, Stefan Eckhardt authored at least 5 papers between 2005 and 2020.

Collaborative distances:

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

2020

Smoothed Analysis of Trie Height by Star-like PFAs.

Stefan Eckhardt, Sven Kosub, Johannes Nowak

CoRR, 2020

2009

Complexity analysis of tries and spanning tree problems.

Bernd Stefan Eckhardt

PhD thesis, 2009

2007

All-Pairs Ancestor Problems in Weighted Dags.

Matthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak

Proceedings of the Combinatorics, 2007

Fast Lowest Common Ancestor Computations in Dags.

Stefan Eckhardt, Andreas Michael Mühling, Johannes Nowak

Proceedings of the Algorithms, 2007

2005

Combinatorial Network Abstraction by Trees and Distances.

Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005