Moritz G. Maaß Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2008
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Moritz G. Maaß: Computing suffix links for suffix trees and arrays. Inf. Process. Lett. 101(6): 250-254 (2007)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Moritz G. Maaß, Johannes Nowak: Text indexing with errors. J. Discrete Algorithms 5(4): 662-681 (2007)
2006
b1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Moritz G. Maaß: Analysis of algorithms and data structures for text indexing. Technical University Munich 2006, pp. 1-132
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Moritz G. Maaß: Average-Case Analysis of Approximate Trie Search. Algorithmica 46(3-4): 469-491 (2006)
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sven Kosub, Moritz G. Maaß, Hanjo Täubig: Acyclic Type-of-Relationship Problems on the Internet. CAAN 2006: 98-111
2005
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Moritz G. Maaß, Johannes Nowak: Text Indexing with Errors. CPM 2005: 21-32
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke: Combinatorial Network Abstraction by Trees and Distances. ISAAC 2005: 1100-1109
2004
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Moritz G. Maaß: Average-Case Analysis of Approximate Trie Search (Extended Abstract). CPM 2004: 472-484
2003
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Moritz G. Maaß: Linear Bidirectional On-Line Construction of Affix Trees. Algorithmica 37(1): 43-74 (2003)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig: The Complexity of Detecting Fixed-Density Clusters. CIAC 2003: 201-212
2000
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Moritz G. Maaß: Linear Bidirectional On-Line Construction of Affix Trees. CPM 2000: 320-334

Coauthor Index

1Stefan Eckhardt
[j8] [c4]
2Klaus Holzapfel
[j4] [c2]
3Sven Kosub
[j8] [j4] [c6] [c4] [c2]
4Johannes Nowak
[j6] [j2] [c5]
5Hanjo Täubig
[j8] [j4] [c6] [c4] [c2]
6Sebastian Wernicke
[j8] [c4]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sun May 26 04:56:01 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page