
Moritz Lichter M.Sc.
Graphen und Gruppen
Arbeitsgebiet(e)
Kontakt
lichter@mathematik.tu-...
Work
S2|15 232
Schlossgartenstraße 7
64289
Darmstadt
Forschungsinteressen
- Logik, endliche Modelltheorie, Logik für Polynomialzeit
- Graphisomorphie
- Deskriptive Komplexitätstheorie
- Computer Algebra
Publikationen
- , A. Dawar, M. Lichter: Limitations of the Invertible-Map Equivalences. 2022. Journal of Logic and Computation ( E. Grädel, DOI) arXiv
- M. Lichter, : Choiceless Polynomial Time with Witnessed Symetric Choice. P. Schweitzer; distinguished paper. ( LICS 2022, DOI) arXiv (Full Version)
- M. Lichter: Separating Rank Logic from Polynomial Time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science(); Kleene Award for Best Student Paper. LICS 2021, (DOI) arXiv (Full Version)
- M. Lichter, : Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. In Proceedings of the 29th EACSLAnnual Conference on Computer Science Logic ( P. Schweitzer) Ljubljana, 2021 ( CSL 2021, PDF CSL) arXiv (Full Version)
- M. Lichter, , I. Ponomarenko : 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 ( P. Schweitzer) Vancouver, 2019. ( LICS 2019, DOI) arXiv
- , 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 ( S. Erdweg, part of SPLASH 2015) Pittsburgh, 2015. ( OOPSLA 2015 (wird in neuem Tab geöffnet)) PDF
Preprints
Lehre
- Assistent zur Vorlesung „Mathematik als gemeinsame Sprache der Naturwissenschaften“ WS 21/22 mit B. Kümmerer
- Assistent zur Vorlesung „Entwurf und Analyse von Algorithmen“ WS 18/19 (TU Kaiserslautern)
- BA/MA Seminar WS 18/19 (mit P. Schweitzer, TU Kaiserslautern)