Teaching

• Summer term 2010: Data Structures and Algorithms

• Winter term 2009/2010: Foundations of Theoretical Computer Science: Logic & Concrete Mathematics

• Winter term 2009/2010: Theoretical Computer Science 2

• Summer term 2009: Concrete Mathematics

• Summer term 2009: Theoretical Computer Science 3

• Winter term 2008/2009: Logic

• Winter term 2008/2009: Theoretical Computer Science 2

• Winter term 2008/2009: Games in Computer Science

• Summer term 2008: Exam Preparation Course

• Summer term 2008: Concrete Mathematics

• Summer term 2008: Theoretical Computer Science 3

• Winter term 2007/2008: Logic

• Winter term 2007/2008: Theoretical Computer Science 2

• Summer term 2007: Concrete Mathematics

• Winter term 2006/2007: Formal Semantics

• Winter term 2006/2007: Theoretical Computer Science 2

Publications

• Similarity Search with Set Intersection as a Distance Measure
  [PDF] PhD thesis, Institute for Formale Methods in Computer Science, University Stuttgart, 2010 (OPUS).


• Maximal Intersection Queries in Randomized Graph Models (with Yury Lifshits and Dirk Nowotka)
  [Abstract] [PDF][PS][Presentation] Proceedings of CSR 2007, LNCS, Vol. 4649, pp. 227--236, Springer (© Springer).


• Maximal Intersection Queries in Randomized Input Models (with Mikhail Lifshits, Yury Lifshits, and Dirk Nowotka)
  [Abstract] [PDF][PS] Theory of Computing Systems, Vol. 46, No. 1, Springer (© Springer).


• Comparison of Standard and Zipf-Based Document Retrieval Heuristics
  [PDF] Technical report no. 2010/06, Institute for Formale Methods in Computer Science, University Stuttgart, September 2010 (OPUS).

Links

• DLT 2009