A sound and optimal incremental build system with dynamic dependencies. - Sebastian Erdweg; Moritz Lichter; Manuel Weiel (OOPSLA, 2015)

Constructive Analysis of S1S and Büchi Automata. - Moritz Lichter; Gert Smolka (CoRR, 2018)

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. - Moritz Lichter; Ilia Ponomarenko; Pascal Schweitzer (LICS, 2019)

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. - Moritz Lichter; Pascal Schweitzer (CSL, 2021)

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting. - Moritz Lichter (ICALP, 2023)

Limitations of Game Comonads via Homomorphism Indistinguishability. - Moritz Lichter; Benedikt Pago; Tim Seppelt (CoRR, 2023)

Separating Rank Logic from Polynomial Time. - Moritz Lichter (J. ACM, 2023)

Limitations of the invertible-map equivalences. - Anuj Dawar; Erich Grädel; Moritz Lichter (J. Log. Comput., 2023)

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. - Moritz Lichter; Benedikt Pago; Tim Seppelt (CSL, 2024)

Choiceless Polynomial Time with Witnessed Symmetric Choice. - Moritz Lichter; Pascal Schweitzer (J. ACM, 2024)

Computational Complexity of the Weisfeiler-Leman Dimension. - Moritz Lichter; Simon Raßmann; Pascal Schweitzer (CSL, 2025)

Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. - Moritz Lichter; Benedikt Pago (ICALP, 2025)

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism. - Christoph Berkholz; Moritz Lichter; Harry Vinall-Smeeth (MFCS, 2025)

The Iteration Number of the Weisfeiler-Leman Algorithm. - Martin Grohe; Moritz Lichter; Daniel Neuen (ACM Trans. Comput. Log., 2025)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. - Martin Grohe; Moritz Lichter; Daniel Neuen; Pascal Schweitzer (J. ACM, 2025)