Manfred Kufleitner 
University of Stuttgart 
Computer Science in Stuttgart  
PD Dr. rer. nat. habil., Dipl.Inf.  Theoretical Computer Science 
Position:  Research assistant  
Address:  University of Stuttgart Formal Methods in Computer Science (FMI) Universitätsstr. 38 D70569 Stuttgart Germany 

Office:  Room 1.160  
Phone:  +49 711 685 88231  
Telefax:  +49 711 685 88310  
Email:  kufleitner@fmi.unistuttgart.de  
Office hour:  By appointment 
Short CV  
since Apr 2015  Research assistant at the University of Stuttgart, FMI 
Oct 2014 – Mar 2015  Acting professor at Universität Hamburg 
Apr 2014 – Sep 2014  Research assistant at the University of Stuttgart 
Nov 2013 – Mar 2014  Guest professor at Technische Universität München 
Oct 2007 – Oct 2013  Research assistant at the University of Stuttgart 
Oct 2006 – Sep 2007  Postdoc at LaBRI, Université Bordeaux 1 
Aug 2001 – Sep 2006  PhD candidate and research assistant at the University of Stuttgart 
Oct 1997 – Jul 2001  Student of Computer Science at the University of Stuttgart 
Nov 2013  Habilitation for computer science, University of Stuttgart 
Jul 2006  PhD (Dr. rer. nat.) in computer science, University of Stuttgart 
Jul 2001  Diploma (Dipl.Inf.) in computer science (roughly equivalent to MSc.), University of Stuttgart 
Research interests 
Logic fragments for sequential and concurrent systems 
Automata, logic, and formal languages 
Formal verification 
Theory of finite semigroups 
Algorithms and combinatorics on words 
Data compression 
Scientific meetings 
Member of the Program Committee of FoSSaCS 2016, Eindhoven, the Netherlands 
Member of the Program Committee of WORDS 2015, Kiel, Germany 
Member of the Program Committee of DCFS 2015, Waterloo, Ontario, Cananda 
Member of the Program Committee of LICS 2015, Kyoto, Japan 
Member of the Scientific Committee of ALFA'15, Bordeaux, France 
Member of the Program Committee of STACS 2015, Munich, Germany 
Member of the Program Committee of ICALP 2014, Track B, Copenhagen, Denmark 
Workshop Chair of ALFA'13s (with V. Diekert), Stellenbosch, South Africa 
Workshop Chair of ALFA'13 (with V. Diekert), Riga, Latvia 
Publications 
A list of publications can be found on our institute homepage or at dblp. 
Technical reports of some of my papers are available on arXiv.org. 
Teaching  
Access is often restricted to the campus.  
Lectures  
Summer term 2016  Lecture and Tutorial
Cryptographic methods
in German, University of Stuttgart 
Winter term 2015/2016  Lecture
Automata over Infinite Objects
in German, University of Stuttgart 
Lecture
Graph Theory
in German (together with V. Diekert), University of Stuttgart 

Summer term 2015  Lecture
Concrete Mathematics
in German, University of Stuttgart 
Winter term 2014/2015  Lecture
Semantics of Computer Programs
in German, Universität Hamburg 
Lecture
Algorithms for Cryptography
in German, Universität Hamburg 

Summer term 2014  Lecture and Tutorial
Automata over Infinite Objects
in German, University of Stuttgart 
Lecture
Concrete Mathematics
in German (together with V. Diekert), University of Stuttgart 

Winter term 2013/2014  Lecture and Tutorial
Automata and Formal Languages
in English, Technische Universität München 
Summer term 2013  Lecture and Tutorial
Cryptographic methods
in German, University of Stuttgart 
Lecture
Concrete Mathematics
in German (together with V. Diekert), University of Stuttgart 

Summer term 2012  Lecture and Tutorial
Graph Theory
in German, University of Stuttgart 
Winter term 2011/2012  Lecture
Automata over Infinite Words
in German, University of Stuttgart 
Winter term 2010/2011  Lecture and Tutorial
Cryptographic methods
in German, University of Stuttgart 
Winter term 2009/2010  Lecture and Tutorial
Graph Theory
in German, University of Stuttgart 
Summer term 2009  Lecture and Tutorial
Cryptographic methods
in German, University of Stuttgart 
Seminars  
Winter term 2015/2016  Seminar and Advanced Seminar
Selected Topics in Theoretical Computer Science
in German (together with V. Diekert), University of Stuttgart 
Winter term 2014/2015  Seminar
Logic and Semantics of Computer Programs
in German (together with M. KöhlerBußmeier and R. Valk), Universität Hamburg 
Summer term 2014  Advanced Seminar
Data Compression and Algorithms
in German (together with V. Diekert), University of Stuttgart 
Winter term 2012/2013  Seminar
Selected Topics in Theoretical Computer Science
in German (together with V. Diekert), University of Stuttgart 
Summer term 2012  Seminar
Proofs from the Book
in German (together with V. Diekert), University of Stuttgart 
Winter term 2011/2012  Seminar
Selected Topics in Theoretical Computer Science
in German (together with V. Diekert), University of Stuttgart 
Summer term 2011  Advanced Seminar
Automata over Infinite Objects
in German (together with V. Diekert), University of Stuttgart 
Winter term 2009/2010  Advanced Seminar
Current Topics in Theoretical Computer Science
in German (together with C. Glaßer), University of Stuttgart 
Winter term 2008/2009  Seminar
Algorithms of the Week
in German (together with V. Diekert), University of Stuttgart 
Summer term 2006  Advanced Seminar
Algorithmic Number Theory
in German (together with J. Brüdern and V. Diekert), University of Stuttgart 
Winter term 2004/2005  Advanced Seminar
Algorithmic Number Theory
in German (together with J. Brüdern and V. Diekert), University of Stuttgart 
Summer term 2004  Advanced Seminar
Selected Topics in Theoretical Computer Science
in German (together with V. Diekert), University of Stuttgart 
Winter term 2003/2004  Advanced Seminar
Algorithmic Number Theory
in German (together with J. Brüdern and V. Diekert), University of Stuttgart 
Summer term 2003  Advanced Seminar
Selected Topics in Theoretical Computer Science
in German (together with V. Diekert), University of Stuttgart 
Winter term 2002/2003  Advanced Seminar
Selected Topics in Theoretical Computer Science
in German (together with V. Diekert), University of Stuttgart 
Programming Courses  
Summer term 2008  Laboratory
Efficient Programming
in German (together with B. Appel), University of Stuttgart 
Summer term 2006  Laboratory
Efficient Programming
in German (together with J. Esparza and S. Kiefer), University of Stuttgart 
Summer term 2005  Laboratory
Efficient Programming
in German (together with J. Esparza, S. Kiefer, and S. Schwoon), University of Stuttgart 
Exercises  
Summer term 2010  Tutorial
Discrete Mathematics
in German, University of Stuttgart 
Summer term 2009  Tutorial
Discrete Mathematics
in German, University of Stuttgart 
Winter term 2008/2009  Tutorial
Complexity Theory
in German, University of Stuttgart 
Summer term 2008  Tutorial
Discrete Mathematics
in German, University of Stuttgart 
Winter term 2007/2008  Tutorial
Theoretical Computer Science 2
in German, University of Stuttgart 
Summer term 2006  Tutorial
Discrete Mathematics
in German, University of Stuttgart 
Winter term 2005/2006  Tutorial
Theoretical Computer Science 2
in German, University of Stuttgart 
Summer term 2005  Tutorial
Discrete Mathematics
in German, University of Stuttgart 
Winter term 2004/2005  Tutorial
Complexity Theory
in German, University of Stuttgart 
Summer term 2002  Tutorial
Discrete Mathematics
in German, University of Stuttgart 
Winter term 2001/2002  Tutorial
Formal Semantics
in German, University of Stuttgart 
Supervised Student Work  
[S35] 
Efficient algorithms for the separation problem
over alternationfree logic for infinite words
(in German). Bachelor Thesis No. 224, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2015. 
[S34] 
Separation over finite words for one quantifier alternation
(in German). Diploma Thesis No. 3722, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2015. 
[S33] 
Minimization and efficient algorithms for recognizing homomorphisms over omegaregular languages (in German). Master's Thesis No. 18, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2015. 
[S32] 
The word problem for omegaterms over twovariable logic
(in German). Diploma Thesis No. 3610, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2014. 
[S31] 
Certain properties of deterministic automata and their complexity
(in German). Student Research Project No. 2457, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2014. 
[S30] 
An algebraic construction for the Kleene star of regular languages
(in German). Bachelor Thesis No. 64, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2013. 
[S29] 
Forbidden patterns for deterministic finite automata in the TrotterWeil hierarchy
(in German). Bachelor Thesis No. 61, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2013. 
[S28] 
Algebraic characterizations of positive quantifier alternation in twovariable logic
(in German). Bachelor Thesis No. 60, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2013. 
[S27] 
Cascade decompositions of special classes of automata
(in German). Student Research Project No. 2417, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2013. 
[S26] 
Minimizing automata with a bounded number of errors
(in German). Diploma Thesis No. 3337, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2012. 
[S25] 
Variants of the NTRU cryptosystem
(in German). Diploma Thesis No. 3286, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2012. 
[S24] 
The holonomy decomposition of automata
(in German). Diploma Thesis No. 3332, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2012. 
[S23] 
Analysis of unambiguous Büchi automata
(in German). Diploma Thesis No. 3182, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2011. 
[S22] 
A variant of the BurrowsWheeler transformation with permutations
(in German). Diploma Thesis No. 3117, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2011. 
[S21] 
Firstorder logic without quantifier alternation over finite words
(in German). Student Research Project No. 2298, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2011. 
[S20] 
Simple firstorder fragments with successor over infinite words
(in German). Student Research Project No. 2297, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2011. 
[S19] 
Deterministic interval logic with factor modalities
(in German). Student Research Project No. 2295, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2011. 
[S18] 
Efficient algorithms for computing the BurrowsWheeler transform
(in German). Final thesis for teacher education, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2010. 
[S17] 
The behavior of treewalking automata with pebbles
(in German). Diploma Thesis No. 3017, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2010. 
[S16] 
Algebraic tools for the composition of concurrent systems
(in German). Student Research Project No. 2257, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2010. 
[S15] 
Methods for combining data compression algorithms
(in German). Student Research Project No. 2231, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2010. 
[S14] 
Combinatorial proofs for probabilistic primality tests
(in German). Student Research Project No. 2225, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2009. 
[S13] 
Efficient computation of context mixing in data compression
(in German). Diploma Thesis No. 2922, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2009. 
[S12] 
Semantic methods in text compression
(in German). Diploma Thesis No. 2824, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2009. 
[S11] 
Modules for data compression using context mixing
(in German). Student Research Project No. 2192, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2009. 
[S10] 
Fragments of an interval logic
(in German). Diploma Thesis No. 2823, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2009. 
[S9] 
Quantifier alternation and regular languages
(in German). Diploma Thesis No. 2775, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2008. 
[S8] 
Data compression with context mixing
(in German). Diploma Thesis No. 2670, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2008. 
[S7] 
Implementation and comparison of FFTbased multiplication algorithms
(in German). Diploma Thesis No. 2416, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2006. 
[S6] 
Games and fragments of temporal logic over traces
(in German). Diploma Thesis No. 2391, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2006. 
[S5] 
Ring isomorphism problems and the factorization of large numbers
(in German). Diploma Thesis No. 2330, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2005. 
[S4] 
The polynomial closure of trace language classes
(in German). Diploma Thesis No. 2328, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2005. 
[S3] 
Primality test on elliptic curves
(in German). Student Research Project No. 2009, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2005. 
[S2] 
Factorization using elliptic curves
(in German). Student Research Project No. 2008, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2005. 
[S1] 
Factorization of large numbers using the quadratic sieve
(in German). Student Research Project No. 2007, Faculty of Computer Science, Electrical Engineering, and Information Technology; University of Stuttgart, Germany, 2005. 
Last modified April 5, 2016  ✉ webmaster  Impressum 