Moritz G. Maaß

15 papers B 4C 1Journal 8Unranked 1

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