Johannes Nowak

Email:	*nowakjatin.tum.de*
WWW:	http://wwwmayr.in.tum.de/personen/nowakj/
Phone:	+49-89-289-17736
Fax:	+49-89-289-17707
Address:	Lehrstuhl für Effiziente Algorithmen Institut für Informatik Technische Universität München Boltzmannstr. 3 D-85748 Garching
Room:	MI 03.09.043 (I14)

Research Interests	Teaching
Graph Algorithms Algorithm Engineering Combinatorial Pattern Matching	WS 2004/2005: Tutorials in Fundamental Algorithms SS 2005: Tutorials in Selected Topics in Computational Biology WS 2005/2006: Tutorials in Fundamental Algorithms SS 2006: Tutorials in Informatik 4 (Introduction to Theoretical Computer Science) Seminar Text Algorithms WS 2006/2007: Tutorials in Randomized Algorithms Advanced seminar Algorithm Engineering

Research Interests

Teaching

Graph Algorithms
Algorithm Engineering
Combinatorial Pattern Matching

WS 2004/2005: Tutorials in Fundamental Algorithms

SS 2005: Tutorials in Selected Topics in Computational Biology

WS 2005/2006: Tutorials in Fundamental Algorithms

SS 2006: Tutorials in Informatik 4 (Introduction to Theoretical Computer Science)
Seminar Text Algorithms

WS 2006/2007: Tutorials in Randomized Algorithms
Advanced seminar Algorithm Engineering

Projects
Co-Organisation of the courseAlgorithms in IT Security within Joint Advanced Student School (JASS) in St. Petersburg Searching in Protein Structure Databases PAST - Polypeptide Angles Suffix Tree

Publications
Miroslaw Kowaluk, Andrzej Lingas, and Johannes Nowak. A Path Cover Technique for LCAs in Dags. In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008). volume NNNN of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2008. Technical Report TUM-I0809, Technische Universität München, Institut für Informatik, Januar 2008. (.ps) Stefan Eckhardt, Sven Kosub and Johannes Nowak. Smoothed Analysis of Trie Height. Technical Report TUM-I0715, Technische Universität München, Institut für Informatik, July 2007. Abdullah N. Arslan and Johannes Nowak. Efficient Approximate Dictionary Look-up for Long Words Over Small Alphabets. Technical Report TUM-I0708, Technische Universität München, Institut für Informatik, Januar 2007. (.ps) Stefan Eckhardt, Andreas Mühling, and Johannes Nowak. Fast Lowest Common Ancestor Computations in Dags. In Proceedings of the 15th European Symposium on Algorithms (ESA 2007). volume 4698 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2007. Technical Report TUM-I0707, Technische Universität München, Institut für Informatik, Januar 2007. (.ps) Matthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, and Johannes Nowak. All-Pairs Common-Ancestor Problems in Weighted Dags. In Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE'2007). volume 4614 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2007. Technical Report TUM-I0606, Technische Universität München, Institut für Informatik, April 2006. (.ps) 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. In Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005) , Jeju Island, Korea, volume 3537 of LNCS, pages 21-32, Springer, jun 2005. (electronic edition,bibtex) 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 Johannes Nowak. A New Indexing Method for Approximate Pattern Matching With One Mismatch. Diplomarbeit, Lehrstuhl für Effiziente Algorithmen, Institut für Informatik, TU München, feb 2004.

Publications

Miroslaw Kowaluk, Andrzej Lingas, and Johannes Nowak.
A Path Cover Technique for LCAs in Dags.
In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008). volume NNNN of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2008.
Technical Report TUM-I0809, Technische Universität München, Institut für Informatik, Januar 2008. (.ps)
Stefan Eckhardt, Sven Kosub and Johannes Nowak.
Smoothed Analysis of Trie Height.
Technical Report TUM-I0715, Technische Universität München, Institut für Informatik, July 2007.
Abdullah N. Arslan and Johannes Nowak.
Efficient Approximate Dictionary Look-up for Long Words Over Small Alphabets.
Technical Report TUM-I0708, Technische Universität München, Institut für Informatik, Januar 2007. (.ps)
Stefan Eckhardt, Andreas Mühling, and Johannes Nowak.
Fast Lowest Common Ancestor Computations in Dags.
In Proceedings of the 15th European Symposium on Algorithms (ESA 2007). volume 4698 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2007.
Technical Report TUM-I0707, Technische Universität München, Institut für Informatik, Januar 2007. (.ps)
Matthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, and Johannes Nowak.
All-Pairs Common-Ancestor Problems in Weighted Dags.
In Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE'2007). volume 4614 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2007.
Technical Report TUM-I0606, Technische Universität München, Institut für Informatik, April 2006. (.ps)
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.
In Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005) , Jeju Island, Korea, volume 3537 of LNCS, pages 21-32, Springer, jun 2005. (electronic edition,bibtex)

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

Johannes Nowak.
A New Indexing Method for Approximate Pattern Matching With One Mismatch.
Diplomarbeit, Lehrstuhl für Effiziente Algorithmen, Institut für Informatik, TU München, feb 2004.