Descriptive Complexity of #AC0 Functions. - Arnaud Durand 001; Anselm Haak; Juha Kontinen; Heribert Vollmer (CSL, 2016)

Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth. - Arnaud Durand 001; Anselm Haak; Heribert Vollmer (CoRR, 2017)

Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. - Arnaud Durand 001; Anselm Haak; Heribert Vollmer (LICS, 2018)

Counting of Teams in First-Order Team Logics. - Anselm Haak; Juha Kontinen; Fabian Müller 003; Heribert Vollmer; Fan Yang 004 (MFCS, 2019)

A model-theoretic characterization of constant-depth arithmetic circuits. - Anselm Haak; Heribert Vollmer (Ann. Pure Appl. Log., 2019)

Parameterised Counting Classes with Bounded Nondeterminism. - Anselm Haak; Arne Meier; Om Prakash 002; B. V. Raghavendra Rao (CoRR, 2019)

Descriptive complexity of #P functions: A new perspective. - Arnaud Durand 001; Anselm Haak; Juha Kontinen; Heribert Vollmer (J. Comput. Syst. Sci., 2021)

Descriptive complexity of circuit-based counting classes - Anselm Haak (2021)

Enumerating teams in first-order team logics. - Anselm Haak; Arne Meier; Fabian Müller 003; Heribert Vollmer (Ann. Pure Appl. Log., 2022)

PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). - Alexander Leonhardt; Holger Dell; Anselm Haak; Frank Kammer; Johannes Meintrup; Ulrich Meyer 001; Manuel Penschuck (IPEC, 2023)

Parameterised Counting in Logspace. - Anselm Haak; Arne Meier; Om Prakash 002; B. V. Raghavendra Rao (Algorithmica, 2023)

Solving Polynomial Equations Over Finite Fields. - Holger Dell; Anselm Haak; Melvin Kallmayer; Leo Wennmann (SODA, 2025)

Why not? Developing ABox Abduction beyond Repairs. - Anselm Haak; Patrick Koopmann; Yasir Mahmood 002; Anni-Yasmin Turhan (CoRR, 2025)