| Fast lowest common ancestor computations in dags S Eckhardt, AM Mühling, J Nowak Algorithms–ESA 2007: 15th Annual European Symposium, Eilat, Israel, October …, 2007 | 27 | 2007 |
| All-pairs ancestor problems in weighted dags M Baumgart, S Eckhardt, J Griebsch, S Kosub, J Nowak International Symposium on Combinatorics, Algorithms, Probabilistic and …, 2007 | 18* | 2007 |
| Combinatorial network abstraction by trees and distances S Eckhardt, S Kosub, MG Maaß, H Täubig, S Wernicke International Symposium on Algorithms and Computation, 1100-1109, 2005 | 7 | 2005 |
| Combinatorial network abstraction by trees and distances S Eckhardt, S Kosub, MG Maaß, H Täubig, S Wernicke Theoretical computer science 407 (1-3), 1-20, 2008 | 3 | 2008 |
| Smoothed analysis of trie height S Eckhardt, S Kosub, J Nowak | 3 | 2007 |
| Complexity Analysis of Tries and Spanning Tree Problems S Eckhardt TU Munich, 2010 | 1 | 2010 |
| Smoothed Analysis of Trie Height by Star-like PFAs S Eckhardt, S Kosub, J Nowak arXiv preprint arXiv:2003.04101, 2007 | | 2007 |
