Moritz G. Maaß

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Computing suffix links for suffix trees and arrays Information Processing Letters	2010-01-29	Paper
A new method for approximate indexing and dictionary lookup with one error Information Processing Letters	2009-12-18	Paper
Combinatorial network abstraction by trees and distances Theoretical Computer Science	2008-11-18	Paper
Text indexing with errors Journal of Discrete Algorithms	2008-05-29	Paper
Acyclic Type-of-Relationship Problems on the Internet Combinatorial and Algorithmic Aspects of Networking	2008-04-17	Paper
Average-case analysis of approximate trie search Algorithmica	2007-02-14	Paper
Algorithms and Computation Lecture Notes in Computer Science	2006-11-14	Paper
The complexity of detecting fixed-density clusters Discrete Applied Mathematics	2006-08-14	Paper
Combinatorial Pattern Matching Lecture Notes in Computer Science	2005-12-14	Paper
Combinatorial Pattern Matching Lecture Notes in Computer Science	2005-09-07	Paper
Linear bidirectional on-line construction of affix trees Algorithmica	2004-03-11	Paper
scientific article; zbMATH DE number 2011857 (Why is no real title available?)	2003-12-02	Paper
scientific article; zbMATH DE number 1615290 (Why is no real title available?)	2001-07-08	Paper

Research outcomes over time

This page was built for person: Moritz G. Maaß