Moritz Lichter

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 24

Top Topics

Graph Isomorphism

Execution Times

Temporal Dependencies

Top Venues

Publications

Moritz Lichter, Benedikt Pago, Tim Seppelt
Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. CSL (2024)
Moritz Lichter, Pascal Schweitzer
Choiceless Polynomial Time with Witnessed Symmetric Choice. J. ACM 71 (2) (2024)
Moritz Lichter, Benedikt Pago
Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. CoRR (2024)
Moritz Lichter, Simon Raßmann, Pascal Schweitzer
Computational complexity of the Weisfeiler-Leman dimension. CoRR (2024)
Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth
Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism. CoRR (2024)
Moritz Lichter
Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting. ICALP (2023)
Martin Grohe, Moritz Lichter, Daniel Neuen
The Iteration Number of the Weisfeiler-Leman Algorithm. CoRR (2023)
Moritz Lichter, Benedikt Pago, Tim Seppelt
Limitations of Game Comonads via Homomorphism Indistinguishability. CoRR (2023)
Moritz Lichter
Separating Rank Logic from Polynomial Time. J. ACM 70 (2) (2023)
Martin Grohe, Moritz Lichter, Daniel Neuen
The Iteration Number of the Weisfeiler-Leman Algorithm. LICS (2023)
Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS (2023)
Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR (2023)
Anuj Dawar, Erich Grädel, Moritz Lichter
Limitations of the invertible-map equivalences. J. Log. Comput. 33 (5) (2023)
Moritz Lichter, Pascal Schweitzer
Choiceless Polynomial Time with Witnessed Symmetric Choice. LICS (2022)
Moritz Lichter, Pascal Schweitzer
Choiceless Polynomial Time with Witnessed Symmetric Choice. CoRR (2022)
Moritz Lichter
Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting. CoRR (2022)
Moritz Lichter
Separating Rank Logic from Polynomial Time. CoRR (2021)
Anuj Dawar, Erich Grädel, Moritz Lichter
Limitations of the Invertible-Map Equivalences. CoRR (2021)
Moritz Lichter, Pascal Schweitzer
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. CSL (2021)
Moritz Lichter
Separating Rank Logic from Polynomial Time. LICS (2021)
Moritz Lichter, Pascal Schweitzer
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. CoRR (2020)
Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. CoRR (2019)
Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. LICS (2019)
Moritz Lichter, Gert Smolka
Constructive Analysis of S1S and Büchi Automata. CoRR (2018)
Sebastian Erdweg, Moritz Lichter, Manuel Weiel
A sound and optimal incremental build system with dynamic dependencies. OOPSLA (2015)