Logic in Computer Science

Welcome to the web presentation of the research groups "Theoretical Computer Science" and "Logic and Complexity"!

News:

• The paper "Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation" by Benjamin Scheidt and Nicole Schweikardt was accepted by MFCS 2023.
• The paper "A dichotomy for succinct representations of homomorphisms" by Christoph Berkholz and Harry Vinall-Smeeth was accepted by ICALP 2023.
• The paper "Puzzling over Subsequence-Query Extensions: Disjunction and Generalised Gaps" by André Frochaux and Sarah Kleest-Meißner was accepted by AMW 2023.
• The paper "Simulating Logspace-Recursion with Logarithmic Quantifier Depth" by Steffen van Bergerem, Martin Grohe, Sandra Kiefer, and Luca Oeljeklaus was accepted by LICS 2023.
• The paper "Discovering Multi-Dimensional Event Queries from Traces - From Theory to Practice" by Sarah Kleest-Meißner, Rebecca Sattler, Markus Schmid, Nicole Schweikardt and Matthias Weidlich was accepted by BTW'23.
• The paper "Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems" by Joel D. Day, Maria Kosche, Florin Manea and Markus Schmid was accepted by ISAAC 2022.
• On 01.08.2022 Prof. Dr. Christoph Berkholz began leading the Algorithms group at the Institute for Theoretical Computer Science, TU Ilmenau.
• The paper "Enumeration for FO Queries over Nowhere Dense Graphs" by Nicole Schweikardt, Luc Segoufin and Alexandre Vigny was accepted by the Journal of the ACM.