Anselm Haak

21 papers A* 2A 1B 3C 1Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
2025 A* conf
Solving Polynomial Equations Over Finite Fields.
SODA
Holger Dell, Anselm Haak, Melvin Kallmayer, Leo Wennmann
2025 — conf
Why not? Developing ABox Abduction Beyond Repairs.
DL
Anselm Haak, Patrick Koopmann, Yasir Mahmood, Anni-Yasmin Turhan
2025 J jnl
Why not? Developing ABox Abduction beyond Repairs.
CoRR
Anselm Haak, Patrick Koopmann, Yasir Mahmood, Anni-Yasmin Turhan
2024 J jnl
Solving Polynomial Equations Over Finite Fields.
CoRR
Holger Dell, Anselm Haak, Melvin Kallmayer, Leo Wennmann
2023 B conf
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM).
IPEC
Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck
2023 J jnl
Parameterised Counting in Logspace.
Algorithmica
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
2022 J jnl
Enumerating teams in first-order team logics.
Ann. Pure Appl. Log.
Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer
2021 J jnl
Descriptive complexity of #P functions: A new perspective.
J. Comput. Syst. Sci.
Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
2021 — —
Descriptive complexity of circuit-based counting classes
Anselm Haak
2021 A conf
Parameterised Counting in Logspace.
STACS
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
2020 J jnl
Enumerating Teams in First-Order Team Logics.
CoRR
Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer
2019 J jnl
A model-theoretic characterization of constant-depth arithmetic circuits.
Ann. Pure Appl. Log.
Anselm Haak, Heribert Vollmer
2019 B conf
Counting of Teams in First-Order Team Logics.
MFCS
Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang
2019 J jnl
Counting of Teams in First-Order Team Logics.
CoRR
Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang
2019 J jnl
Parameterised Counting Classes with Bounded Nondeterminism.
CoRR
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
2018 A* conf
Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth.
LICS
Arnaud Durand, Anselm Haak, Heribert Vollmer
2017 J jnl
Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth.
CoRR
Arnaud Durand, Anselm Haak, Heribert Vollmer
2016 C conf
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits.
WoLLIC
Anselm Haak, Heribert Vollmer
2016 J jnl
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits.
CoRR
Anselm Haak, Heribert Vollmer
2016 B conf
Descriptive Complexity of #AC
CSL
Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
2016 J jnl
Descriptive Complexity of #AC
CoRR
Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer