Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints T. Friedrich, T. Kötzing, G. Lagodzinski, F. Neumann, M. Schirneck 14th Workshop on Foundations of Genetic Algorithms (FOGA), 2017
The Parameterized Complexity of Dependency Detection in Relational Databases. T. Bläsius, T. Friedrich, M. Schirneck. 11th International Symposium on Parameterized and Exact Computation (IPEC), 2016.
Fast Building Block Assembly by Majority Vote Crossover. [pdf|bib] T. Friedrich, T. Kötzing, M.S. Krejca, S. Nallaperuma, F. Neumann, M. Schirneck. Genetic and Evolutionary Computation Conference (GECCO), 2016.
Towards an Atlas of Computational Learning Theory. [pdf|bib] T. Kötzing, M. Schirneck. 33rd Symposium on Theoretical Aspects of Computer Science (STACS), 2016.
On Restrictions in Computational Language Learning. [pdf] Master's thesis, Friedrich-Schiller-Universität Jena, 2015. Examenspreis des Dekans 2016 (Dean's prize for best thesis).
Betrachtungen über ein distanzbasiertes Klassifikationsverfahren. [pdf] Bachelor's thesis (in German), Friedrich-Schiller-Universität Jena, 2012.
Our research focus is on theoretical computer science and algorithm engineering. We are equally interested in the mathematical foundations of algorithms and developing efficient algorithms in practice. A special focus is on random structures and methods.