default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoritz G. Maaß
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j8]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
- [j7]Moritz G. Maaß:
Computing suffix links for suffix trees and arrays. Inf. Process. Lett. 101(6): 250-254 (2007) - [j6]Moritz G. Maaß, Johannes Nowak:
Text indexing with errors. J. Discrete Algorithms 5(4): 662-681 (2007) - 2006
- [b1]Moritz G. Maaß:
Analysis of algorithms and data structures for text indexing. Technical University Munich, Germany, 2006, pp. 1-132 - [j5]Moritz G. Maaß:
Average-Case Analysis of Approximate Trie Search. Algorithmica 46(3-4): 469-491 (2006) - [j4]Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig:
The complexity of detecting fixed-density clusters. Discret. Appl. Math. 154(11): 1547-1562 (2006) - [j3]Moritz G. Maaß:
Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem. Softw. Pract. Exp. 36(3): 305-331 (2006) - [c6]Sven Kosub, Moritz G. Maaß, Hanjo Täubig:
Acyclic Type-of-Relationship Problems on the Internet. CAAN 2006: 98-111 - 2005
- [j2]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) - [c5]Moritz G. Maaß, Johannes Nowak:
Text Indexing with Errors. CPM 2005: 21-32 - [c4]Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke:
Combinatorial Network Abstraction by Trees and Distances. ISAAC 2005: 1100-1109 - 2004
- [c3]Moritz G. Maaß:
Average-Case Analysis of Approximate Trie Search (Extended Abstract). CPM 2004: 472-484 - 2003
- [j1]Moritz G. Maaß:
Linear Bidirectional On-Line Construction of Affix Trees. Algorithmica 37(1): 43-74 (2003) - [c2]Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig:
The Complexity of Detecting Fixed-Density Clusters. CIAC 2003: 201-212 - 2000
- [c1]Moritz G. Maaß:
Linear Bidirectional On-Line Construction of Affix Trees. CPM 2000: 320-334
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
