The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harald Hempel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:49-60 [Conf]
  2. Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
    Algebraic Properties for P-Selectivity. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:49-58 [Conf]
  3. André Große, Harald Hempel
    On Functions and Relations. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:181-192 [Conf]
  4. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Query Order in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:222-232 [Conf]
  5. Michael Krüger, Harald Hempel
    Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:243-252 [Conf]
  6. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    All Superlinear Inverse Schemes Are coNP-Hard. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:368-379 [Conf]
  7. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    A Downward Translation in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:319-328 [Conf]
  8. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:269-280 [Conf]
  9. Harald Hempel, Gerd Wechsung
    The Operators min and max on the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:93-104 [Conf]
  10. Harald Hempel, Dieter Kratsch
    On Claw-Free Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:377-390 [Conf]
  11. Lane A. Hemaspaandra, Harald Hempel
    P-Immune Sets with Holes Lack Self-Reducibility Properties [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  12. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Using the No-Search Easy-Hard Technique for Downward Collapse [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  13. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    All Superlinear Inverse Schemes are coNP-Hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  14. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Downward Collapse from a Weaker Hypothesis [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  15. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
    Query Order [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  16. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  17. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  18. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    An Introduction to Query Order [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  19. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Query Order and the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  20. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
    Self-Specifying Machines [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  21. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    A Downward Collapse within the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  22. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Translating Equality Downwards [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  23. Harald Hempel, Dieter Kratsch
    On claw-free asteroidal triple-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:155-180 [Journal]
  24. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    An Introduction to Query Order. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1997, v:63, n:, pp:- [Journal]
  25. Harald Hempel, Gerd Wechsung
    The Operators min and max on the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:25, pp:- [Journal]
  26. Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel
    Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:2, pp:123-131 [Journal]
  27. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
    Self-Specifying Machines. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:3, pp:263-276 [Journal]
  28. Harald Hempel, Gerd Wechsung
    The Operators min and max on the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:315-342 [Journal]
  29. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Query Order and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1998, v:4, n:6, pp:574-588 [Journal]
  30. Harald Hempel
    Randomized Algorithms and Complexity Theory. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2006, v:12, n:6, pp:746-761 [Journal]
  31. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    RS N1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:3, pp:307-325 [Journal]
  32. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    A Downward Collapse within the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:383-393 [Journal]
  33. Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
    Algebraic Properties for Selector Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:6, pp:1309-1337 [Journal]
  34. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
    Query Order. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:637-651 [Journal]
  35. Lane A. Hemaspaandra, Harald Hempel
    P-immune sets with holes lack self-reducibility properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:457-466 [Journal]
  36. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    All superlinear inverse schemes are coNP-hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:345-358 [Journal]
  37. Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
    Algebraic Properties for Selector Functions [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]

  38. Approximating Alternative Solutions. [Citation Graph (, )][DBLP]


  39. Inverse Problems Have Inverse Complexity. [Citation Graph (, )][DBLP]


  40. Persistent Computations of Turing Machines. [Citation Graph (, )][DBLP]


  41. Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002