Linear Bidirectional On-Line Construction of Affix Trees. - Moritz G. Maaß (Algorithmica, 2003)

Average-Case Analysis of Approximate Trie Search (Extended Abstract). - Moritz G. Maaß (CPM, 2004)

A new method for approximate indexing and dictionary lookup with one error. - Moritz G. Maaß; Johannes Nowak (Inf. Process. Lett., 2005)

Acyclic Type-of-Relationship Problems on the Internet. - Sven Kosub; Moritz G. Maaß; Hanjo Täubig (CAAN, 2006)

Average-Case Analysis of Approximate Trie Search. - Moritz G. Maaß (Algorithmica, 2006)

The complexity of detecting fixed-density clusters. - Klaus Holzapfel; Sven Kosub; Moritz G. Maaß; Hanjo Täubig (Discret. Appl. Math., 2006)

Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem. - Moritz G. Maaß (Softw. Pract. Exp., 2006)

Analysis of algorithms and data structures for text indexing. - Moritz G. Maaß (2006)

Computing suffix links for suffix trees and arrays. - Moritz G. Maaß (Inf. Process. Lett., 2007)

Text indexing with errors. - Moritz G. Maaß; Johannes Nowak (J. Discrete Algorithms, 2007)

Combinatorial network abstraction by trees and distances. - Stefan Eckhardt; Sven Kosub; Moritz G. Maaß; Hanjo Täubig; Sebastian Wernicke 001 (Theor. Comput. Sci., 2008)