Anselm Haak

Orcid: 0000-0003-1031-5922

Affiliations:
  • Paderborn University, Germany
  • Goethe University Frankfurt, Germany (former)
  • Leibniz Universität Hannover, Germany (former)


According to our database1, Anselm Haak authored at least 12 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Solving Polynomial Equations Over Finite Fields.
CoRR, 2024

2023
Parameterised Counting in Logspace.
Algorithmica, October, 2023

PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM).
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022
Enumerating teams in first-order team logics.
Ann. Pure Appl. Log., 2022

2021
Descriptive complexity of circuit-based counting classes
PhD thesis, 2021

Descriptive complexity of #P functions: A new perspective.
J. Comput. Syst. Sci., 2021

2019
Parameterised Counting Classes with Bounded Nondeterminism.
CoRR, 2019

A model-theoretic characterization of constant-depth arithmetic circuits.
Ann. Pure Appl. Log., 2019

Counting of Teams in First-Order Team Logics.
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.
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.
CoRR, 2017

2016
Descriptive Complexity of #AC<sup>0</sup> Functions.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016


  Loading...