Moritz G. Maaß
From MaRDI portal
Person:845940
Available identifiers
zbMath Open maass.moritz-gMaRDI QIDQ845940
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 | 2010-01-29 | Paper |
| A new method for approximate indexing and dictionary lookup with one error | 2009-12-18 | Paper |
| Combinatorial network abstraction by trees and distances | 2008-11-18 | Paper |
| Text indexing with errors | 2008-05-29 | Paper |
| Acyclic Type-of-Relationship Problems on the Internet | 2008-04-17 | Paper |
| Average-case analysis of approximate trie search | 2007-02-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| The complexity of detecting fixed-density clusters | 2006-08-14 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Linear bidirectional on-line construction of affix trees | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437509 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723962 | 2001-07-08 | Paper |
Research outcomes over time
This page was built for person: Moritz G. Maaß
