The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Holger Spakowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Holger Spakowski, Rahul Tripathi
    On the Power of Unambiguity in Alternating Machines. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:125-136 [Conf]
  2. Holger Spakowski, Jörg Vogel
    The Operators minCh and maxCh on the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:524-535 [Conf]
  3. Holger Spakowski, Mayur Thakur, Rahul Tripathi
    Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:375-386 [Conf]
  4. Holger Spakowski, Jörg Vogel
    Theta2p-Completeness: A Classical Approach for New Results. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:348-360 [Conf]
  5. Jörg Rothe, Holger Spakowski, Jörg Vogel
    Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:310-322 [Conf]
  6. Holger Spakowski, Rahul Tripathi
    Degree Bounds on Polynomials and Relativization Theory. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:97-110 [Conf]
  7. Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
    Complexity of Cycle Length Modularity Problems in Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:509-518 [Conf]
  8. Holger Spakowski, Rahul Tripathi
    Hierarchical Unambiguity. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:777-788 [Conf]
  9. Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
    Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:258-269 [Conf]
  10. Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
    Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  11. Jörg Rothe, Holger Spakowski, Jörg Vogel
    Exact Complexity of the Winner Problem for Young Elections [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  12. Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
    Complexity of Cycle Length Modularity Problems in Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  13. Holger Spakowski, Mayur Thakur, Rahul Tripathi
    Quantum and classical complexity classes: Separations, collapses, and closure properties. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:200, n:1, pp:1-34 [Journal]
  14. Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
    An improved exact algorithm for the domatic number problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:3, pp:101-106 [Journal]
  15. Holger Spakowski, Rahul Tripathi
    LWPP and WPP are not uniformly gap-definable. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:660-689 [Journal]
  16. Jörg Rothe, Holger Spakowski, Jörg Vogel
    Exact Complexity of the Winner Problem for Young Elections. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:4, pp:375-386 [Journal]
  17. Edith Hemaspaandra, Holger Spakowski, Jörg Vogel
    The complexity of Kemeny elections. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:382-391 [Journal]
  18. 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. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:300-311 [Conf]
  19. Holger Spakowski, Rahul Tripathi
    Hierarchical Unambiguity [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  20. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  21. Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
    An Improved Exact Algorithm for the Domatic Number Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  22. Holger Spakowski, Rahul Tripathi
    On the Power of Unambiguity in Alternating Machines. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:41, n:2, pp:291-326 [Journal]

  23. Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002