default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHolger Spakowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Edith Hemaspaandra, Lane A. Hemaspaandra
, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. Comput. Complex. 29(2): 7 (2020)
2010 – 2019
- 2018
- [j12]Lane A. Hemaspaandra, Holger Spakowski:
Column: Team Diagonalization. SIGACT News 49(3): 51-61 (2018) - [c12]Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. MFCS 2018: 51:1-51:14 - [i9]Lane A. Hemaspaandra, Holger Spakowski:
Team Diagonalization. CoRR abs/1807.10983 (2018) - 2017
- [i8]Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. CoRR abs/1711.01250 (2017) - 2016
- [c11]Holger Spakowski:
On Limited Nondeterminism and ACC Circuit Lower Bounds. LATA 2016: 320-329 - 2012
- [j11]Eric Allender, Holger Spakowski:
Avoiding Simplicity is Complex. Theory Comput. Syst. 51(3): 282-296 (2012)
2000 – 2009
- 2009
- [j10]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Frequency of correctness versus average polynomial time. Inf. Process. Lett. 109(16): 946-949 (2009) - [j9]Holger Spakowski, Rahul Tripathi:
Hierarchical Unambiguity. SIAM J. Comput. 38(5): 2079-2112 (2009) - [j8]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Generalized juntas and NP-hard sets. Theor. Comput. Sci. 410(38-40): 3995-4000 (2009) - 2008
- [i7]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas. CoRR abs/0806.2555 (2008) - 2007
- [j7]Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto:
An improved exact algorithm for the domatic number problem. Inf. Process. Lett. 101(3): 101-106 (2007) - [j6]Holger Spakowski, Rahul Tripathi:
On the Power of Unambiguity in Alternating Machines. Theory Comput. Syst. 41(2): 291-326 (2007) - [c10]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. FCT 2007: 300-311 - [i6]Holger Spakowski, Rahul Tripathi:
Hierarchical Unambiguity. CoRR abs/cs/0702047 (2007) - [i5]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time. CoRR abs/cs/0703097 (2007) - 2006
- [j5]Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. RAIRO Theor. Informatics Appl. 40(1): 75-91 (2006) - [j4]Holger Spakowski, Rahul Tripathi:
LWPP and WPP are not uniformly gap-definable. J. Comput. Syst. Sci. 72(4): 660-689 (2006) - [c9]Holger Spakowski, Rahul Tripathi:
Hierarchical Unambiguity. MFCS 2006: 777-788 - [i4]Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto:
An Improved Exact Algorithm for the Domatic Number Problem. CoRR abs/cs/0603060 (2006) - 2005
- [b1]Holger Spakowski:
Completeness for parallel access to NP and counting class separations. University of Düsseldorf, Germany, 2005, pp. I-VI, 1-105 - [j3]Holger Spakowski, Mayur Thakur, Rahul Tripathi:
Quantum and classical complexity classes: Separations, collapses, and closure properties. Inf. Comput. 200(1): 1-34 (2005) - [j2]Edith Hemaspaandra, Holger Spakowski, Jörg Vogel:
The complexity of Kemeny elections. Theor. Comput. Sci. 349(3): 382-391 (2005) - [c8]Holger Spakowski, Rahul Tripathi:
On the Power of Unambiguity in Alternating Machines. FCT 2005: 125-136 - [p1]Holger Spakowski:
Completeness for parallel access to NP and counting class separation. Ausgezeichnete Informatikdissertationen 2005: 181-190 - 2004
- [c7]Holger Spakowski, Rahul Tripathi:
Degree Bounds on Polynomials and Relativization Theory. IFIP TCS 2004: 97-110 - [c6]Edith Hemaspaandra, Holger Spakowski, Mayur Thakur:
Complexity of Cycle Length Modularity Problems in Graphs. LATIN 2004: 509-518 - 2003
- [j1]Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of the Winner Problem for Young Elections. Theory Comput. Syst. 36(4): 375-386 (2003) - [c5]Holger Spakowski, Mayur Thakur, Rahul Tripathi:
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. FSTTCS 2003: 375-386 - [i3]Edith Hemaspaandra, Holger Spakowski, Mayur Thakur:
Complexity of Cycle Length Modularity Problems in Graphs. CoRR cs.CC/0306131 (2003) - 2002
- [c4]Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections. IFIP TCS 2002: 310-322 - [c3]Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. WG 2002: 258-269 - 2001
- [i2]Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. CoRR cs.CC/0110025 (2001) - [i1]Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of the Winner Problem for Young Elections. CoRR cs.CC/0112021 (2001) - 2000
- [c2]Holger Spakowski, Jörg Vogel:
Theta2p-Completeness: A Classical Approach for New Results. FSTTCS 2000: 348-360
1990 – 1999
- 1999
- [c1]Holger Spakowski, Jörg Vogel:
The Operators minCh and maxCh on the Polynomial Hierarchy. FCT 1999: 524-535
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-04-24 23:14 CEST 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:
