Lower Runtime Bounds for Integer Programs. - Florian Frohn; Matthias Naaf; Jera Hensel; Marc Brockschmidt; Jürgen Giesl (IJCAR, 2016)

Complexity Analysis for Term Rewriting by Integer Transition Systems. - Matthias Naaf; Florian Frohn; Marc Brockschmidt; Carsten Fuhs; Jürgen Giesl (FroCoS, 2017)

Generalized Absorptive Polynomials and Provenance Semantics for Fixed-Point Logic. - Katrin M. Dannert; Erich Grädel; Matthias Naaf; Val Tannen (CoRR, 2019)

Inferring Lower Runtime Bounds for Integer Programs. - Florian Frohn; Matthias Naaf; Marc Brockschmidt; Jürgen Giesl (ACM Trans. Program. Lang. Syst., 2020)

Computing Least and Greatest Fixed Points in Absorptive Semirings. - Matthias Naaf (RAMiCS, 2021)

Semiring Provenance for Fixed-Point Logic. - Katrin M. Dannert; Erich Grädel; Matthias Naaf; Val Tannen (CSL, 2021)

Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials. - Erich Grädel; Niels Lücking; Matthias Naaf (GandALF, 2021)

Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics. - Erich Grädel; Hayyan Helal; Matthias Naaf; Richard Wilke (LICS, 2022)

Locality Theorems in Semiring Semantics. - Clotilde Bizière; Erich Grädel; Matthias Naaf (MFCS, 2023)

Semiring Provenance in the Infinite. - Sophie Brinke; Erich Grädel; Lovro Mrkonjic; Matthias Naaf (Tannen's Festschrift, 2024)

Semiring Provenance for B "uchi Games: Strategy Analysis with Absorptive Polynomials. - Erich Grädel; Niels Lücking; Matthias Naaf (Log. Methods Comput. Sci., 2024)