RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (CIAC, 1997)

Query Order in the Polynomial Hierarchy. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (FCT, 1997)

A Downward Translation in the Polynomial Hierarchy. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (STACS, 1997)

An Introduction to Query Order. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (Bull. EATCS, 1997)

The Operators min and max on the Polynomial Hierarchy - Harald Hempel; Gerd Wechsung (Electron. Colloquium Comput. Complex., 1997)

Boolean hierarchies - on collapse properties and query order. - Harald Hempel (1998)

Downward Collapse from a Weaker Hypothesis - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (CoRR, 1998)

Query Order and the Polynomial Hierarchy. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (J. Univers. Comput. Sci., 1998)

RS N1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (Theory Comput. Syst., 1998)

A Downward Collapse within the Polynomial Hierarchy. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (SIAM J. Comput., 1998)

Query Order. - Lane A. Hemaspaandra; Harald Hempel; Gerd Wechsung (SIAM J. Comput., 1998)

What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (SIGACT News, 1998)

Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (STACS, 1999)

R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (CoRR, 1999)

Translating Equality Downwards - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (CoRR, 1999)

Self-Specifying Machines. - Lane A. Hemaspaandra; Harald Hempel; Gerd Wechsung (Int. J. Found. Comput. Sci., 1999)

Algebraic Properties for P-Selectivity. - Lane A. Hemaspaandra; Harald Hempel; Arfst Nickelsen (COCOON, 2001)

Using the No-Search Easy-Hard Technique for Downward Collapse - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (CoRR, 2001)

On claw-free asteroidal triple-free graphs. - Harald Hempel; Dieter Kratsch (Discret. Appl. Math., 2002)

Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph. - Richard Beigel; Lane A. Hemaspaandra; Harald Hempel; Jörg Vogel 001 (Inf. Comput., 2002)

On Functions and Relations. - André Große; Harald Hempel (DMTCS, 2003)

P-immune sets with holes lack self-reducibility properties. - Lane A. Hemaspaandra; Harald Hempel (Theor. Comput. Sci., 2003)

Algebraic Properties for Selector Functions. - Lane A. Hemaspaandra; Harald Hempel; Arfst Nickelsen (SIAM J. Comput., 2004)

Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (SIAM J. Comput., 2005)

All superlinear inverse schemes are coNP-hard. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (Theor. Comput. Sci., 2005)

Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. - Michael Krüger; Harald Hempel (ISAAC, 2006)

Randomized Algorithms and Complexity Theory. - Harald Hempel (J. Univers. Comput. Sci., 2006)

Approximating Alternative Solutions. - Michael Krüger; Harald Hempel (COCOON, 2008)

Inverse Problems Have Inverse Complexity. - Tobias Berg; Harald Hempel (IFIP TCS, 2008)

Persistent Computations of Turing Machines. - Harald Hempel; Madlen Kimmritz (CIAA, 2008)

Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights. - Tobias Berg; Harald Hempel (LATA, 2009)

Aspects of Persistent Computations. - Harald Hempel; Madlen Kimmritz (Int. J. Found. Comput. Sci., 2009)

Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete. - Harald Hempel; Michael Krüger (Theor. Comput. Sci., 2012)