dblp.uni-trier.dewww.uni-trier.de

Holger Spakowski

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
24EEHolger Spakowski, Rahul Tripathi: Hierarchical Unambiguity. SIAM J. Comput. 38(5): 2079-2112 (2009)
2008
23EEGá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
22EEGá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
21EEHolger Spakowski, Rahul Tripathi: Hierarchical Unambiguity CoRR abs/cs/0702047: (2007)
20EEGá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)
19EETobias 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)
18EEHolger Spakowski, Rahul Tripathi: On the Power of Unambiguity in Alternating Machines. Theory Comput. Syst. 41(2): 291-326 (2007)
2006
17EEHolger Spakowski, Rahul Tripathi: Hierarchical Unambiguity. MFCS 2006: 777-788
16EETobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto: An Improved Exact Algorithm for the Domatic Number Problem CoRR abs/cs/0603060: (2006)
15EEHolger Spakowski, Rahul Tripathi: LWPP and WPP are not uniformly gap-definable. J. Comput. Syst. Sci. 72(4): 660-689 (2006)
2005
14EEHolger Spakowski, Rahul Tripathi: On the Power of Unambiguity in Alternating Machines. FCT 2005: 125-136
13EEHolger Spakowski, Mayur Thakur, Rahul Tripathi: Quantum and classical complexity classes: Separations, collapses, and closure properties. Inf. Comput. 200(1): 1-34 (2005)
12EEEdith Hemaspaandra, Holger Spakowski, Jörg Vogel: The complexity of Kemeny elections. Theor. Comput. Sci. 349(3): 382-391 (2005)
2004
11 Holger Spakowski, Rahul Tripathi: Degree Bounds on Polynomials and Relativization Theory. IFIP TCS 2004: 97-110
10EEEdith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs. LATIN 2004: 509-518
2003
9EEHolger Spakowski, Mayur Thakur, Rahul Tripathi: Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. FSTTCS 2003: 375-386
8EEEdith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs CoRR cs.CC/0306131: (2003)
7EEJörg Rothe, Holger Spakowski, Jörg Vogel: Exact Complexity of the Winner Problem for Young Elections. Theory Comput. Syst. 36(4): 375-386 (2003)
2002
6 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
5EEEdith 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
4EEEdith 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)
3EEJörg Rothe, Holger Spakowski, Jörg Vogel: Exact Complexity of the Winner Problem for Young Elections CoRR cs.CC/0112021: (2001)
2000
2EEHolger Spakowski, Jörg Vogel: Theta2p-Completeness: A Classical Approach for New Results. FSTTCS 2000: 348-360
1999
1EEHolger Spakowski, Jörg Vogel: The Operators minCh and maxCh on the Polynomial Hierarchy. FCT 1999: 524-535

Coauthor Index

1Gábor Erdélyi [20] [22] [23]
2Edith Hemaspaandra (Edith Spaan) [4] [5] [8] [10] [12]
3Lane A. Hemaspaandra (Lane A. Hemachandra) [20] [22] [23]
4Tobias Riege [16] [19]
5Jörg Rothe [3] [4] [5] [6] [7] [16] [19] [20] [22] [23]
6Mayur Thakur [8] [9] [10] [13]
7Rahul Tripathi [9] [11] [13] [14] [15] [17] [18] [21] [24]
8Jörg Vogel [1] [2] [3] [6] [7] [12]
9Masaki Yamamoto [16] [19]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)