Holger Spakowski

Publication Activity (10 Years)

Years Active: 1999-2020
Publications (10 Years): 6

Top Venues

CoRR

Theory Comput. Syst.

Comput. Complex.

MFCS

University of Düsseldorf, Germany (PHD)

Education History

University of Düsseldorf, Germany

PHD

Publications

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) (2020)
Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. MFCS (2018)
Lane A. Hemaspaandra, Holger Spakowski
Column: Team Diagonalization. SIGACT News 49 (3) (2018)
Lane A. Hemaspaandra, Holger Spakowski
Team Diagonalization. CoRR (2018)
Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. CoRR (2017)
Holger Spakowski
On Limited Nondeterminism and ACC Circuit Lower Bounds. LATA (2016)
Eric Allender, Holger Spakowski
Avoiding Simplicity is Complex. Theory Comput. Syst. 51 (3) (2012)
Holger Spakowski, Rahul Tripathi
Hierarchical Unambiguity. SIAM J. Comput. 38 (5) (2009)
Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
Frequency of correctness versus average polynomial time. Inf. Process. Lett. 109 (16) (2009)
Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
Generalized juntas and NP-hard sets. Theor. Comput. Sci. 410 (38-40) (2009)
Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas CoRR (2008)
Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
An improved exact algorithm for the domatic number problem. Inf. Process. Lett. 101 (3) (2007)
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 (2007)
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)
Holger Spakowski, Rahul Tripathi
Hierarchical Unambiguity CoRR (2007)
Holger Spakowski, Rahul Tripathi
On the Power of Unambiguity in Alternating Machines. Theory Comput. Syst. 41 (2) (2007)
Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
An Improved Exact Algorithm for the Domatic Number Problem CoRR (2006)
Holger Spakowski, Rahul Tripathi
LWPP and WPP are not uniformly gap-definable. J. Comput. Syst. Sci. 72 (4) (2006)
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) (2006)
Holger Spakowski, Rahul Tripathi
Hierarchical Unambiguity. MFCS (2006)
Holger Spakowski, Rahul Tripathi
On the Power of Unambiguity in Alternating Machines. FCT (2005)
Holger Spakowski
Completeness for parallel access to NP and counting class separation. Ausgezeichnete Informatikdissertationen (2005)
Edith Hemaspaandra, Holger Spakowski, Jörg Vogel
The complexity of Kemeny elections. Theor. Comput. Sci. 349 (3) (2005)
Holger Spakowski, Mayur Thakur, Rahul Tripathi
Quantum and classical complexity classes: Separations, collapses, and closure properties. Inf. Comput. 200 (1) (2005)
Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
Complexity of Cycle Length Modularity Problems in Graphs. LATIN (2004)
Holger Spakowski, Rahul Tripathi
Degree Bounds on Polynomials and Relativization Theory. IFIP TCS (2004)
Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
Complexity of Cycle Length Modularity Problems in Graphs CoRR (2003)
Jörg Rothe, Holger Spakowski, Jörg Vogel
Exact Complexity of the Winner Problem for Young Elections. Theory Comput. Syst. 36 (4) (2003)
Holger Spakowski, Mayur Thakur, Rahul Tripathi
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. FSTTCS (2003)
Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. WG (2002)
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)
Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP CoRR (2001)
Jörg Rothe, Holger Spakowski, Jörg Vogel
Exact Complexity of the Winner Problem for Young Elections CoRR (2001)
Holger Spakowski, Jörg Vogel
-Completeness: A Classical Approach for New Results. FSTTCS (2000)
Holger Spakowski, Jörg Vogel
The Operators minCh and maxCh on the Polynomial Hierarchy. FCT (1999)

Holger Spakowski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Holger Spakowski