Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Moritz G. Maaß

Email: maass@in.tum.de WWW: http://wwwmayr.in.tum.de/personen/maass/ Tel: +49-89-289-17742 Fax: +49-89-289-17707 Address: Institut für Informatik Technische Universität München Boltzmannstr. 3 D-85748 Garching Room: MI 03.09.037

Teaching

Supervised Thesis and Student Projects

	System Development Project: DNS Signaturen zum Herkunftsnachweis bei Rindfleisch, Sebastian Höhn.
	Diplomarbeit (Master Thesis): A New Indexing Method for Approximate Pattern Matching with One Mismatch, Johannes Nowak.
	Diplomarbeit (Master Thesis): Development and Evaluation of Different Algorithms for Inexact Matching, Florian Schwarz. Cooperation with Arexera.

Research

	Algorithm design and analysis
	Pattern matching
	Graph clustering
	Algorithms for the Internet

Other

Co-Organiser of the course Complexity Analysis of String Algorithms at the Joint Advanced Student School (JASS) in St. Petersburg.

Talks

	Average-case Analysis of Approximate Trie Search (.pdf) [930k] held on July 7 at the CPM 2004 in Istanbul, Turkey.
	Text Indexing with Errors (.pdf) [2.3M] held on am June 20 at the CPM 2005 in Jeju Island, Korea.
	Some pictures from the CPM 2005

Publications

	Moritz G. Maaß. Scheduling Independent and Identically Distributed Tasks with In-Tree Constraints on three Machines in Parallel. Diplomarbeit, Lehrstuhl für Effiziente Algorithmen, Institut für Informatik, TU München, sep 2001. (.ps.gz [351k],bibtex)
	Moritz G. Maaß. Linear Bidirectional On-line Construction of Affix Trees. In Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 1848 of LNCS, pages 320-334. Springer, jun 2000. (electronic edition, .ps.gz [180k],bibtex) Algorithmica, 37(1), pages 320-334. Springer, jun 2003. (electronic edition, bibtex)
	K. Holzapfel, S. Kosub, M. G. Maaß, and H. Täubig. The Complexity of Detecting Fixed-Density Clusters. Technical Report TUM-I0212, Technische Universität München, Institut für Informatik, dec 2002. (.ps.gz [117k],.pdf [303k],bibtex) In Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC), volume 2653 of LNCS, pages 201-212. Springer, 2003. (electronic edition, bibtex)
	Moritz G. Maaß. A Fast Algorithm for the Inexact Characteristic String Problem. Technical Report TUM-I0312, Technische Universität München, Institut für Informatik, aug 2003. (.ps.gz [66k],.pdf [251k],bibtex)
	Moritz G. Maaß. Average-case Analysis of Approximate Trie Search. Technical Report TUM-I0405, Technische Universität München, Institut für Informatik, mar 2004. (.ps.gz [199k], .pdf [350k], bibtex) In Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 3109 of LNCS, pages 472-484. Springer, jul 2004. (electronic edition, bibtex)
	Moritz G. Maaß. Matching Statistics: Efficient Computation and a New Practical Algorithm for the Multiple Common Substring Problem. To appear in Software - Experience & Practice, John Wiley & Sons, Inc.
	Moritz G. Maaß and Johannes Nowak. A new method for approximate indexing and dictionary lookup with one error. Information Processing Letters, volume 96, issue 5, dec 2005, pages 185-191 (electronic edition,bibtex)
	Moritz G. Maaß and Johannes Nowak. Text Indexing with Errors. Technical Report TUM-I0503, Technische Universität München, Institut für Informatik, mar 2005. (.ps.gz [125k], .pdf [278k], bibtex) Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM), Jeju Island, Korea, volume 3537 of LNCS, pages 21-32, Springer, jun 2005. (electronic edition,bibtex)
	Moritz G. Maaß. Computing Suffix Links for Suffix Trees and Arrays. Technical Report TUM-I0514, Technische Universität München, Institut für Informatik, jul 2005. (.ps.gz [117k], .pdf [159k], bibtex)
	S. Eckhardt, S. Kosub, M.G. Maaß, H. Täubig, S. Wernicke. Combinatorial Network Abstractions by Trees and Distances. Technical Report TUM-I0502, Technische Universität München, Institut für Informatik, mar 2005. (.ps.gz [228k],.pdf [294k], bibtex) In Proceedings of the 16th Annual Symposium on Algorithms and Computation (ISSAC'05), volume 3827 of LNCS, pages 1100-1109. Springer, 2005. (bibtex)