Moritz G. Maaß

According to our database1, Moritz G. Maaß authored at least 11 papers between 2003 and 2008.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
Combinatorial network abstraction by trees and distances.
Theor. Comput. Sci., 2008

2007
Text indexing with errors.
J. Discrete Algorithms, 2007

Computing suffix links for suffix trees and arrays.
Inf. Process. Lett., 2007

2006
Analysis of algorithms and data structures for text indexing.
PhD thesis, 2006

Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem.
Softw. Pract. Exp., 2006

The complexity of detecting fixed-density clusters.
Discret. Appl. Math., 2006

Average-Case Analysis of Approximate Trie Search.
Algorithmica, 2006

Acyclic Type-of-Relationship Problems on the Internet.
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.
Inf. Process. Lett., 2005

2004
Average-Case Analysis of Approximate Trie Search (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
Linear Bidirectional On-Line Construction of Affix Trees.
Algorithmica, 2003


  Loading...