Moritz Lichter

Orcid: 0000-0001-5437-8074

According to our database1, Moritz Lichter authored at least 13 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computational complexity of the Weisfeiler-Leman dimension.
CoRR, 2024

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Limitations of the invertible-map equivalences.
J. Log. Comput., July, 2023

Separating Rank Logic from Polynomial Time.
J. ACM, April, 2023

Limitations of Game Comonads via Homomorphism Indistinguishability.
CoRR, 2023

The Iteration Number of the Weisfeiler-Leman Algorithm.
LICS, 2023

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Choiceless Polynomial Time with Witnessed Symmetric Choice.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time.
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.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
Constructive Analysis of S1S and Büchi Automata.
CoRR, 2018

2015
A sound and optimal incremental build system with dynamic dependencies.
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, 2015


  Loading...