Harald Hempel

Publication Activity (10 Years)

Years Active: 1997-2012
Publications (10 Years): 0

Top Venues

Theor. Comput. Sci.

University of Jena, Germany (PHD)

Education History

University of Jena, Germany

PHD

Publications

Harald Hempel, Michael Krüger
Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete. Theor. Comput. Sci. 426 (2012)
Tobias Berg, Harald Hempel
Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights. LATA (2009)
Harald Hempel, Madlen Kimmritz
Aspects of Persistent Computations. Int. J. Found. Comput. Sci. 20 (4) (2009)
Michael Krüger, Harald Hempel
Approximating Alternative Solutions. COCOON (2008)
Harald Hempel, Madlen Kimmritz
Persistent Computations of Turing Machines. CIAA (2008)
Tobias Berg, Harald Hempel
Inverse Problems Have Inverse Complexity. IFIP TCS (2008)
Harald Hempel
Randomized Algorithms and Complexity Theory. J. Univers. Comput. Sci. 12 (6) (2006)
Michael Krüger, Harald Hempel
Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. ISAAC (2006)
Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
Algebraic Properties for Selector Functions CoRR (2005)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
All superlinear inverse schemes are coNP-hard. Theor. Comput. Sci. 345 (2-3) (2005)
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) (2005)
Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
Algebraic Properties for Selector Functions. SIAM J. Comput. 33 (6) (2004)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
All Superlinear Inverse Schemes Are coNP-Hard. MFCS (2004)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
All Superlinear Inverse Schemes are coNP-Hard CoRR (2004)
Lane A. Hemaspaandra, Harald Hempel
P-immune sets with holes lack self-reducibility properties. Theor. Comput. Sci. 302 (1-3) (2003)
André Große, Harald Hempel
On Functions and Relations. DMTCS (2003)
Harald Hempel, Dieter Kratsch
On claw-free asteroidal triple-free graphs. Discret. Appl. Math. 121 (1-3) (2002)
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) (2002)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Using the No-Search Easy-Hard Technique for Downward Collapse CoRR (2001)
Lane A. Hemaspaandra, Harald Hempel
P-Immune Sets with Holes Lack Self-Reducibility Properties. DMTCS (2001)
Lane A. Hemaspaandra, Harald Hempel
P-Immune Sets with Holes Lack Self-Reducibility Properties CoRR (2001)
Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
Algebraic Properties for P-Selectivity. COCOON (2001)
Harald Hempel, Gerd Wechsung
The Operators min and max on the Polynomial Hierarchy. Int. J. Found. Comput. Sci. 11 (2) (2000)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Query Order and the Polynomial Hierarchy CoRR (1999)
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Self-Specifying Machines. Int. J. Found. Comput. Sci. 10 (3) (1999)
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Self-Specifying Machines CoRR (1999)
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Query Order CoRR (1999)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
(NP) Distinguishes Robust Many-One and Turing Completeness CoRR (1999)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
A Downward Collapse within the Polynomial Hierarchy CoRR (1999)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
An Introduction to Query Order CoRR (1999)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. STACS (1999)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Translating Equality Downwards CoRR (1999)
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 (1999)
Harald Hempel, Dieter Kratsch
On Claw-Free Asteroidal Triple-Free Graphs. WG (1999)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Downward Collapse from a Weaker Hypothesis CoRR (1998)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Query Order and the Polynomial Hierarchy. J. Univers. Comput. Sci. 4 (6) (1998)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
(NP) Distinguishes Robust Many-One and Turing Completeness. Theory Comput. Syst. 31 (3) (1998)
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Query Order. SIAM J. Comput. 28 (2) (1998)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
A Downward Collapse within the Polynomial Hierarchy. SIAM J. Comput. 28 (2) (1998)
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) (1998)
Harald Hempel, Gerd Wechsung
The Operators min and max on the Polynomial Hierarchy Electron. Colloquium Comput. Complex. 4 (25) (1997)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
(NP) Distinguishes Robust Many-One and Turing Completeness. CIAC (1997)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
An Introduction to Query Order. Bull. EATCS 63 (1997)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
A Downward Translation in the Polynomial Hierarchy. STACS (1997)
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Query Order in the Polynomial Hierarchy. FCT (1997)
Harald Hempel, Gerd Wechsung
The Operators min and max on the Polynomial Hierarchy. STACS (1997)

Harald Hempel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Harald Hempel