Moritz Lichter

Research interests

• graph isomorphism
• logics
• descriptive complexity theory
• computer algebra

Publications

• M. Lichter: Separating Rank Logic from Polynomial Time. To appear at LICS 2021; Kleene Award for Best Student Paper. (PDF arXiv (Full Version))
• M. Lichter, P. Schweitzer: Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. In Proceedings of the 29th EACSL Annual Conference on Computer Science Logic (CSL 2021) Ljubljana, 2021 (PDF CSL, PDF arXiv (Full Version))
• M. Lichter, I. Ponomarenko, P. Schweitzer: Walk refinement, walk logik, and the iteration number of the Weisfeiler-Leman algorithm. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, June 24-27 (LICS 2019) Vancouver, 2019. (DOI, arXiv)
• S. Erdweg, M. Lichter, M. Weiel: A sound and optimal incremental build system with dynamic dependencies. In Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, October 25-30 (OOPSLA 2015, part of SPLASH 2015) Pittsburgh, 2015. (PDF)

Preprints

• M. Lichter, G. Smolka: Constructive analysis of S1S and Büchi automata. 2018. (arXiv)

Teaching

• Assistent for "Entwurf und Analyse von Algorithmen" WS 18/19
• BA/MA Seminar WS 18/19 (together with Pascal Schweitzer)

Other Activities

• Project "Bau einer Programmiersprache" (building a programming language) in the Modulphase 2020 of the Hector Seminar at Bunsen-Gymnasium Heidelberg with pupils of grade 8 to 10 (together with G. Döbbeling and O. Rudolph)
• Project "Formale Sprachen" (formal languages), like above