Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Harald Hempel
2010 – today
- 2012
[j17]Harald Hempel, Michael Krüger: Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete. Theor. Comput. Sci. 426: 49-65 (2012)
2000 – 2009
- 2009
- [j16]Harald Hempel, Madlen Kimmritz: Aspects of Persistent Computations. Int. J. Found. Comput. Sci. 20(4): 701-715 (2009)
- [c14]Tobias Berg, Harald Hempel: Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights. LATA 2009: 141-151
- 2008
- [c13]
- [c12]
- [c11]
- 2006
- [j15]
- [c10]Michael Krüger, Harald Hempel: Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. ISAAC 2006: 243-252
- 2005
- [j14]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries. SIAM J. Comput. 34(6): 1352-1369 (2005)
- [j13]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All superlinear inverse schemes are coNP-hard. Theor. Comput. Sci. 345(2-3): 345-358 (2005)
- [i14]Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen: Algebraic Properties for Selector Functions. CoRR abs/cs/0501022 (2005)
- 2004
- [j12]Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen: Algebraic Properties for Selector Functions. SIAM J. Comput. 33(6): 1309-1337 (2004)
- [c9]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All Superlinear Inverse Schemes Are coNP-Hard. MFCS 2004: 368-379
- [i13]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All Superlinear Inverse Schemes are coNP-Hard. CoRR cs.CC/0410023 (2004)
- 2003
- [j11]Lane A. Hemaspaandra, Harald Hempel: P-immune sets with holes lack self-reducibility properties. Theor. Comput. Sci. 302(1-3): 457-466 (2003)
- [c8]
- 2002
- [j10]Harald Hempel, Dieter Kratsch: On claw-free asteroidal triple-free graphs. Discrete Applied Mathematics 121(1-3): 155-180 (2002)
- [j9]Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel: Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph. Inf. Comput. 173(2): 123-131 (2002)
- 2001
- [c7]Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen: Algebraic Properties for P-Selectivity. COCOON 2001: 49-58
- [i12]Lane A. Hemaspaandra, Harald Hempel: P-Immune Sets with Holes Lack Self-Reducibility Properties. CoRR cs.CC/0102024 (2001)
- [i11]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Using the No-Search Easy-Hard Technique for Downward Collapse. CoRR cs.CC/0106037 (2001)
- 2000
- [j8]Harald Hempel, Gerd Wechsung: The Operators min and max on the Polynomial Hierarchy. Int. J. Found. Comput. Sci. 11(2): 315-342 (2000)
1990 – 1999
- 1999
- [j7]Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung: Self-Specifying Machines. Int. J. Found. Comput. Sci. 10(3): 263-276 (1999)
- [c6]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. STACS 1999: 269-280
- [c5]
- [i10]
- [i9]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. CoRR cs.CC/9910002 (1999)
- [i8]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness. CoRR cs.CC/9910003 (1999)
- [i7]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: An Introduction to Query Order. CoRR cs.CC/9910004 (1999)
- [i6]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order and the Polynomial Hierarchy. CoRR cs.CC/9910005 (1999)
- [i5]Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung: Self-Specifying Machines. CoRR cs.CC/9910006 (1999)
- [i4]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Collapse within the Polynomial Hierarchy. CoRR cs.CC/9910007 (1999)
- [i3]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Translating Equality Downwards. CoRR cs.CC/9910008 (1999)
- 1998
- [b1]Harald Hempel: Boolean hierarchies - on collapse properties and query order. Universität Jena 1998, pp. I-VIII, 1-114
- [j6]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order and the Polynomial Hierarchy. J. UCS 4(6): 574-588 (1998)
- [j5]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: RS N1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. Theory Comput. Syst. 31(3): 307-325 (1998)
- [j4]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Collapse within the Polynomial Hierarchy. SIAM J. Comput. 28(2): 383-393 (1998)
- [j3]Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung: Query Order. SIAM J. Comput. 28(2): 637-651 (1998)
- [j2]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. SIGACT News 29(3): 10-22 (1998)
- [i2]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Downward Collapse from a Weaker Hypothesis. CoRR cs.CC/9808002 (1998)
- 1997
- [j1]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: An Introduction to Query Order. Bulletin of the EATCS 63 (1997)
- [c4]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. CIAC 1997: 49-60
- [c3]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order in the Polynomial Hierarchy. FCT 1997: 222-232
- [c2]Harald Hempel, Gerd Wechsung: The Operators min and max on the Polynomial Hierarchy. STACS 1997: 93-104
- [c1]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Translation in the Polynomial Hierarchy. STACS 1997: 319-328
- [i1]Harald Hempel, Gerd Wechsung: The Operators min and max on the Polynomial Hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 4(25) (1997)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:45 CET by the dblp team