Anselm Haak

According to our database, Anselm Haak authored at least 11 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Parameterised Counting in Logspace.

Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao

Algorithmica, October, 2023

PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM).

Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022

Enumerating teams in first-order team logics.

Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer

Ann. Pure Appl. Log., 2022

2021

Descriptive complexity of circuit-based counting classes

Anselm Haak

PhD thesis, 2021

Descriptive complexity of #P functions: A new perspective.

Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer

J. Comput. Syst. Sci., 2021

2019

Parameterised Counting Classes with Bounded Nondeterminism.

Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao

CoRR, 2019

A model-theoretic characterization of constant-depth arithmetic circuits.

Anselm Haak, Heribert Vollmer

Ann. Pure Appl. Log., 2019

Counting of Teams in First-Order Team Logics.

Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth.

Arnaud Durand, Anselm Haak, Heribert Vollmer

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth.

Arnaud Durand, Anselm Haak, Heribert Vollmer

CoRR, 2017

2016

Descriptive Complexity of #AC⁰ Functions.

Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016