default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnselm Haak
Person information
- affiliation: Paderborn University, Germany
- affiliation (former): Goethe University Frankfurt, Germany
- affiliation (former): Leibniz Universität Hannover, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2021
[b1]Anselm Haak:
Descriptive complexity of circuit-based counting classes. University of Hanover, Germany, 2021
Journal Articles
- 2023
- [j4]Anselm Haak, Arne Meier, Om Prakash
, B. V. Raghavendra Rao:
Parameterised Counting in Logspace. Algorithmica 85(10): 2923-2961 (2023) - 2022
- [j3]Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer:
Enumerating teams in first-order team logics. Ann. Pure Appl. Log. 173(10): 103163 (2022) - 2021
- [j2]Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive complexity of #P functions: A new perspective. J. Comput. Syst. Sci. 116: 40-54 (2021) - 2019
- [j1]Anselm Haak, Heribert Vollmer:
A model-theoretic characterization of constant-depth arithmetic circuits. Ann. Pure Appl. Log. 170(9): 1008-1029 (2019)
Conference and Workshop Papers
- 2023
- [c6]Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck:
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC 2023: 37:1-37:7 - 2021
- [c5]Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting in Logspace. STACS 2021: 40:1-40:17 - 2019
- [c4]Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang:
Counting of Teams in First-Order Team Logics. MFCS 2019: 19:1-19:15 - 2018
- [c3]Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. LICS 2018: 354-363 - 2016
- [c2]Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC0 Functions. CSL 2016: 20:1-20:16 - [c1]Anselm Haak, Heribert Vollmer:
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. WoLLIC 2016: 234-248
Informal and Other Publications
- 2024
- [i7]Holger Dell, Anselm Haak, Melvin Kallmayer, Leo Wennmann:
Solving Polynomial Equations Over Finite Fields. CoRR abs/2410.20162 (2024) - 2020
- [i6]Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer:
Enumerating Teams in First-Order Team Logics. CoRR abs/2006.06953 (2020) - 2019
- [i5]Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang:
Counting of Teams in First-Order Team Logics. CoRR abs/1902.00246 (2019) - [i4]Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting Classes with Bounded Nondeterminism. CoRR abs/1904.12156 (2019) - 2017
- [i3]Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth. CoRR abs/1710.01934 (2017) - 2016
- [i2]Anselm Haak, Heribert Vollmer:
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. CoRR abs/1603.09531 (2016) - [i1]Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC0 Functions. CoRR abs/1604.06617 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 01:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
