Moritz G. Maaß

Publication Activity (10 Years)

Years Active: 2000-2008
Publications (10 Years): 0

Technical University Munich, Germany (PHD)

Education History

Technical University Munich, Germany

PHD

Publications

Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke
Combinatorial network abstraction by trees and distances. Theor. Comput. Sci. 407 (1-3) (2008)
Moritz G. Maaß
Computing suffix links for suffix trees and arrays. Inf. Process. Lett. 101 (6) (2007)
Moritz G. Maaß, Johannes Nowak
Text indexing with errors. J. Discrete Algorithms 5 (4) (2007)
Sven Kosub, Moritz G. Maaß, Hanjo Täubig
Acyclic Type-of-Relationship Problems on the Internet. CAAN (2006)
Moritz G. Maaß
Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem. Softw. Pract. Exp. 36 (3) (2006)
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
The complexity of detecting fixed-density clusters. Discret. Appl. Math. 154 (11) (2006)
Moritz G. Maaß
Average-Case Analysis of Approximate Trie Search. Algorithmica 46 (3-4) (2006)
Moritz G. Maaß, Johannes Nowak
A new method for approximate indexing and dictionary lookup with one error. Inf. Process. Lett. 96 (5) (2005)
Moritz G. Maaß, Johannes Nowak
Text Indexing with Errors. CPM (2005)
Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke
Combinatorial Network Abstraction by Trees and Distances. ISAAC (2005)
Moritz G. Maaß
Average-Case Analysis of Approximate Trie Search (Extended Abstract). CPM (2004)
Moritz G. Maaß
Linear Bidirectional On-Line Construction of Affix Trees. Algorithmica 37 (1) (2003)
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
The Complexity of Detecting Fixed-Density Clusters. CIAC (2003)
Moritz G. Maaß
Linear Bidirectional On-Line Construction of Affix Trees. CPM (2000)

Moritz G. Maaß.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Moritz G. Maaß