Moritz G. Maaß

According to our database, Moritz G. Maaß authored at least 11 papers between 2000 and 2007.

Collaborative distances:

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

2007

Computing suffix links for suffix trees and arrays.

Moritz G. Maaß

Inf. Process. Lett., 2007

2006

Analysis of algorithms and data structures for text indexing.

Moritz G. Maaß

PhD thesis, 2006

Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem.

Moritz G. Maaß

Softw. Pract. Exp., 2006

Average-Case Analysis of Approximate Trie Search.

Moritz G. Maaß

Algorithmica, 2006

Acyclic Type-of-Relationship Problems on the Internet.

Sven Kosub, Moritz G. Maaß, Hanjo Täubig

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

A new method for approximate indexing and dictionary lookup with one error.

Moritz G. Maaß, Johannes Nowak

Inf. Process. Lett., 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

Text Indexing with Errors.

Moritz G. Maaß, Johannes Nowak

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004

Average-Case Analysis of Approximate Trie Search (Extended Abstract).

Moritz G. Maaß

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

The Complexity of Detecting Fixed-Density Clusters.

Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2000

Linear Bidirectional On-Line Construction of Affix Trees.

Moritz G. Maaß

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000