Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Hempel, Harald"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Inverse Hamiltonian Cycle
and inverse 3
Dimensional Matching
are coNP-complete
Harald Hempel
,
Michael Krüger
Theoretical Computer Science
426-427
, 2012, pp. 49-65
Aspects of persistent computations
Harald Hempel
,
Madlen Kimmritz
International Journal of Foundations of Computer Science
20
(4), 2009, pp. 701-715
Approximating alternative solutions
Michael Krüger
,
Harald Hempel
Lecture Notes in Computer Science
5092
, 2008, pp. 204-214
Approximating alternative solutions
Michael Krüger
,
Harald Hempel
Lecture Notes in Computer Science
5092
, 2008, pp. 204-214
Inverse HAMILTONIAN CYCLE and inverse 3-D MATCHING are coNP-complete
Michael Krüger
,
Harald Hempel
Lecture Notes in Computer Science
4288
, 2006, pp. 243-252
Extending downward collapse from 1-versus-2 queries to
m
-versus-
m + 1
queries
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
SIAM Journal on Computing
34
(6), 2005, pp. 1352-1369
All superlinear inverse schemes are co
NP
-hard
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
Theoretical Computer Science
345
(2-3), 2005, pp. 345-358
All superlinear inverse schemes are co
NP
-hard
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
Lecture Notes in Computer Science
3153
, 2004, pp. 368-379
Algebraic properties for selector functions
Lane A. Hemaspaandra
,
Harald Hempel
,
Arfst Nickelsen
SIAM Journal on Computing
33
(6), 2004, pp. 1309-1337
P
-immune sets with holes lack self-reducibility properties
Lane A. Hemaspaandra
,
Harald Hempel
Theoretical Computer Science
302
(1-3), 2003, pp. 457-466
Optimal series-parallel trade-offs for reducing a function to its own graph
Richard Beigel
,
Lane A. Hemaspaandra
,
Harald Hempel
,
Jörg Vogel
Information and Computation
173
(2), 2002, pp. 123-131
Algebraic properties for
P
-selectivity
Lane A. Hemaspaandra
,
Harald Hempel
,
Arfst Nickelsen
Lecture Notes in Computer Science
2108
, 2001, pp. 49-58
The operators min and max on the polynomial hierarchy
Harald Hempel
,
Gerd Wechsung
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 315-342
Extending downward collapse from 1-versus-2 queries to
j
-versus-
j+1
queries
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
Lecture Notes in Computer Science
1563
, 1999, pp. 270-280
Self-specifying machines
Lane A. Hemaspaandra
,
Harald Hempel
,
Gerd Wechsung
International Journal of Foundations of Computer Science
10
(3), 1999, pp. 263-276
On claw-free asteroidal triple-free graphs
Harald Hempel
,
Dieter Kratsch
Lecture Notes in Computer Science
1665
, 1999, pp. 377-390
A downward collapse within the polynomial hierarchy
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
SIAM Journal on Computing
28
(2), 1998, pp. 383-393
Query order
Lane A. Hemaspaandra
,
Harald Hempel
,
Gerd Wechsung
SIAM Journal on Computing
28
(2), 1998, pp. 637-651
R^{SN}_{1-tt}(NP)
distinguishes robust many-one and Turing completeness
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
Lecture Notes in Computer Science
1203
, 1997, pp. 49-60
A downward translation in the polynomial hierarchy
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
Lecture Notes in Computer Science
1200
, 1997, pp. 319-328
R^{SN}_{1-tt}(NP)
distinguishes robust many-one and Turing completeness
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
Lecture Notes in Computer Science
1203
, 1997, pp. 49-60
Query order in the polynomial hierarchy
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
Lecture Notes in Computer Science
1279
, 1997, pp. 222-232
The operators min and max on the polynomial hierarchy
Harald Hempel
,
Gerd Wechsung
Lecture Notes in Computer Science
1200
, 1997, pp. 93-104