| 2008 |
|---|
| 14 | EE | 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): 1-20 (2008) |
| 2007 |
|---|
| 13 | EE | Moritz G. Maaß:
Computing suffix links for suffix trees and arrays.
Inf. Process. Lett. 101(6): 250-254 (2007) |
| 12 | EE | Moritz G. Maaß,
Johannes Nowak:
Text indexing with errors.
J. Discrete Algorithms 5(4): 662-681 (2007) |
| 2006 |
|---|
| 11 | EE | Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig:
Acyclic Type-of-Relationship Problems on the Internet.
CAAN 2006: 98-111 |
| 10 | EE | Moritz G. Maaß:
Average-Case Analysis of Approximate Trie Search.
Algorithmica 46(3-4): 469-491 (2006) |
| 9 | EE | Klaus Holzapfel,
Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig:
The complexity of detecting fixed-density clusters.
Discrete Applied Mathematics 154(11): 1547-1562 (2006) |
| 8 | EE | Moritz G. Maaß:
Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem.
Softw., Pract. Exper. 36(3): 305-331 (2006) |
| 2005 |
|---|
| 7 | EE | Moritz G. Maaß,
Johannes Nowak:
Text Indexing with Errors.
CPM 2005: 21-32 |
| 6 | EE | Stefan Eckhardt,
Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig,
Sebastian Wernicke:
Combinatorial Network Abstraction by Trees and Distances.
ISAAC 2005: 1100-1109 |
| 5 | EE | Moritz G. Maaß,
Johannes Nowak:
A new method for approximate indexing and dictionary lookup with one error.
Inf. Process. Lett. 96(5): 185-191 (2005) |
| 2004 |
|---|
| 4 | EE | Moritz G. Maaß:
Average-Case Analysis of Approximate Trie Search (Extended Abstract).
CPM 2004: 472-484 |
| 2003 |
|---|
| 3 | EE | Klaus Holzapfel,
Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig:
The Complexity of Detecting Fixed-Density Clusters.
CIAC 2003: 201-212 |
| 2 | EE | Moritz G. Maaß:
Linear Bidirectional On-Line Construction of Affix Trees.
Algorithmica 37(1): 43-74 (2003) |
| 2000 |
|---|
| 1 | EE | Moritz G. Maaß:
Linear Bidirectional On-Line Construction of Affix Trees.
CPM 2000: 320-334 |
