| 2009 |
|---|
| 42 | EE | Tobias Berg,
Harald Hempel:
Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights.
LATA 2009: 141-151 |
| 2008 |
|---|
| 41 | EE | Harald Hempel,
Madlen Kimmritz:
Persistent Computations of Turing Machines.
CIAA 2008: 171-180 |
| 40 | EE | Michael Krüger,
Harald Hempel:
Approximating Alternative Solutions.
COCOON 2008: 204-214 |
| 39 | EE | Tobias Berg,
Harald Hempel:
Inverse Problems Have Inverse Complexity.
IFIP TCS 2008: 73-86 |
| 2006 |
|---|
| 38 | EE | Michael Krüger,
Harald Hempel:
Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete.
ISAAC 2006: 243-252 |
| 37 | EE | Harald Hempel:
Randomized Algorithms and Complexity Theory.
J. UCS 12(6): 746-761 (2006) |
| 2005 |
|---|
| 36 | EE | Lane A. Hemaspaandra,
Harald Hempel,
Arfst Nickelsen:
Algebraic Properties for Selector Functions
CoRR abs/cs/0501022: (2005) |
| 35 | EE | 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) |
| 34 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
All superlinear inverse schemes are coNP-hard.
Theor. Comput. Sci. 345(2-3): 345-358 (2005) |
| 2004 |
|---|
| 33 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
All Superlinear Inverse Schemes Are coNP-Hard.
MFCS 2004: 368-379 |
| 32 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
All Superlinear Inverse Schemes are coNP-Hard
CoRR cs.CC/0410023: (2004) |
| 31 | EE | Lane A. Hemaspaandra,
Harald Hempel,
Arfst Nickelsen:
Algebraic Properties for Selector Functions.
SIAM J. Comput. 33(6): 1309-1337 (2004) |
| 2003 |
|---|
| 30 | EE | André Große,
Harald Hempel:
On Functions and Relations.
DMTCS 2003: 181-192 |
| 29 | EE | Lane A. Hemaspaandra,
Harald Hempel:
P-immune sets with holes lack self-reducibility properties.
Theor. Comput. Sci. 302(1-3): 457-466 (2003) |
| 2002 |
|---|
| 28 | | Harald Hempel,
Dieter Kratsch:
On claw-free asteroidal triple-free graphs.
Discrete Applied Mathematics 121(1-3): 155-180 (2002) |
| 27 | EE | 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 |
|---|
| 26 | EE | Lane A. Hemaspaandra,
Harald Hempel,
Arfst Nickelsen:
Algebraic Properties for P-Selectivity.
COCOON 2001: 49-58 |
| 25 | EE | Lane A. Hemaspaandra,
Harald Hempel:
P-Immune Sets with Holes Lack Self-Reducibility Properties
CoRR cs.CC/0102024: (2001) |
| 24 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
Using the No-Search Easy-Hard Technique for Downward Collapse
CoRR cs.CC/0106037: (2001) |
| 2000 |
|---|
| 23 | | Harald Hempel,
Gerd Wechsung:
The Operators min and max on the Polynomial Hierarchy.
Int. J. Found. Comput. Sci. 11(2): 315-342 (2000) |
| 1999 |
|---|
| 22 | EE | 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 |
| 21 | EE | Harald Hempel,
Dieter Kratsch:
On Claw-Free Asteroidal Triple-Free Graphs.
WG 1999: 377-390 |
| 20 | EE | Lane A. Hemaspaandra,
Harald Hempel,
Gerd Wechsung:
Query Order
CoRR cs.CC/9909020: (1999) |
| 19 | EE | 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) |
| 18 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness
CoRR cs.CC/9910003: (1999) |
| 17 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
An Introduction to Query Order
CoRR cs.CC/9910004: (1999) |
| 16 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
Query Order and the Polynomial Hierarchy
CoRR cs.CC/9910005: (1999) |
| 15 | EE | Lane A. Hemaspaandra,
Harald Hempel,
Gerd Wechsung:
Self-Specifying Machines
CoRR cs.CC/9910006: (1999) |
| 14 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
A Downward Collapse within the Polynomial Hierarchy
CoRR cs.CC/9910007: (1999) |
| 13 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
Translating Equality Downwards
CoRR cs.CC/9910008: (1999) |
| 12 | | Lane A. Hemaspaandra,
Harald Hempel,
Gerd Wechsung:
Self-Specifying Machines.
Int. J. Found. Comput. Sci. 10(3): 263-276 (1999) |
| 1998 |
|---|
| 11 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
Downward Collapse from a Weaker Hypothesis
CoRR cs.CC/9808002: (1998) |
| 10 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
Query Order and the Polynomial Hierarchy.
J. UCS 4(6): 574-588 (1998) |
| 9 | | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
A Downward Collapse within the Polynomial Hierarchy.
SIAM J. Comput. 28(2): 383-393 (1998) |
| 8 | | Lane A. Hemaspaandra,
Harald Hempel,
Gerd Wechsung:
Query Order.
SIAM J. Comput. 28(2): 637-651 (1998) |
| 7 | | 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) |
| 1997 |
|---|
| 6 | | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness.
CIAC 1997: 49-60 |
| 5 | | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
Query Order in the Polynomial Hierarchy.
FCT 1997: 222-232 |
| 4 | | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
A Downward Translation in the Polynomial Hierarchy.
STACS 1997: 319-328 |
| 3 | | Harald Hempel,
Gerd Wechsung:
The Operators min and max on the Polynomial Hierarchy.
STACS 1997: 93-104 |
| 2 | | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Harald Hempel:
An Introduction to Query Order.
Bulletin of the EATCS 63: (1997) |
| 1 | EE | Harald Hempel,
Gerd Wechsung:
The Operators min and max on the Polynomial Hierarchy
Electronic Colloquium on Computational Complexity (ECCC) 4(25): (1997) |
