Moritz Lichter

According to our database, Moritz Lichter authored at least 15 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism.

Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems.

Moritz Lichter, Benedikt Pago

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Computational Complexity of the Weisfeiler-Leman Dimension.

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic, 2025

2024

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability.

Moritz Lichter, Benedikt Pago, Tim Seppelt

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Limitations of the invertible-map equivalences.

Anuj Dawar, Erich Grädel, Moritz Lichter

J. Log. Comput., July, 2023

Limitations of Game Comonads via Homomorphism Indistinguishability.

Moritz Lichter, Benedikt Pago, Tim Seppelt

CoRR, 2023

The Iteration Number of the Weisfeiler-Leman Algorithm.

Martin Grohe, Moritz Lichter, Daniel Neuen

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting.

Moritz Lichter

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements.

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Choiceless Polynomial Time with Witnessed Symmetric Choice.

Moritz Lichter, Pascal Schweitzer

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

Separating Rank Logic from Polynomial Time.

Moritz Lichter

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time.

Moritz Lichter, Pascal Schweitzer

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2019

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm.

Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

Constructive Analysis of S1S and Büchi Automata.

Moritz Lichter, Gert Smolka

CoRR, 2018

2015

A sound and optimal incremental build system with dynamic dependencies.

Sebastian Erdweg, Moritz Lichter, Manuel Weiel

Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, 2015