News from the Algorithms group

Page 1 of 2.

[Translate to English:] TU Ilmenau

Presentation on "Towards understanding the complexity of Decision DNNF representation of CNFs parameterized by the incidence treewidth"

Dear friends of theory, on Tuesday, 04/21/2026 at 3:00 p.m. in room Z 2073…

[Translate to English:] TU Ilmenau

Paper by Chris Köcher and Dietrich Kuske accepted for Journal of Theoretical Computer Science

The paper “Reachability in Trace-Pushdown Systems” by Chris Köcher and…

[Translate to English:] TU Ilmenau

Paper by M. Sc. Sebastian Pfau published at CSL 2026

The paper "Boolean Basis and Succinctness of Modal Logic via Hella-Vilander…

Paper from the Institute for Theoretical Computer Science accepted for publication in the Journal of the ACM

The paper “Ribbon: Fast Succinct Static Retrieval and Approximate Membership”…

Paper by Christoph Berkholz and Harry Vinall-Smeeth accepted for publication at ICDT 2026

The paper “Factorised Representations of Join Queries: Tight Bounds and a New…

[Translate to English:] TU Ilmenau

Paper by M. Sc. Sebastian Pfau accepted for publication at CSL 2026

The paper "Boolean Basis and Succinctness of Modal Logic via Hella-Vilander…

[Translate to English:] TU Ilmenau

Paper by Prof. Dietrich Kuske published at FCT 2025

The paper "Disjointness, inclusion, and regularity of ω-rational trace…

[Translate to English:] TU Ilmenau

The paper by Christoph Berkholz, Dietrich Kuske and Christian Schwarz was published in the journal Logical Methods in Computer Science.

The paper "Boolean basis, formula size, and number of modal operators." by…

[Translate to English:] TU Ilmenau

Paper by Prof. Dietrich Kuske accepted for publication at FCT 2025

The paper "Disjointness, inclusion, and regularity of ω-rational trace…

Paper by Christoph Berkholz, Moritz Lichter and Harry Vinall-Smeeth accepted for publication at MFCS 2025

The paper “Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph…

Page 1 of 2.