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="Karloff, H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algebraic methods for interactive proof systems
C. Lund
,
L. Fortnow
,
H. Karloff
,
N. Nisan
Journal of the ACM
39
(4), 1992, October, pp. 859-868
New results on server problems
M. Chrobak
,
H. Karloff
,
T. Payne
,
S. Vishwanathan
SIAM Journal on Discrete Mathematics
4
(2), 1991, May, pp. 172-181
Connectivity vs.~reachability
M. Chrobak
,
H. Karloff
,
T. Radzik
Information and Computation
91
(2), 1991, April, pp. 177-188
A competitive 3-server algorithm
P. Berman
,
H. Karloff
,
G. Tardos
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 280-290
New results on server problems
M. Chrobak
,
H. Karloff
,
T. Payne
,
S. Vishwanathan
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 291-300
Algebraic methods for interactive proof systems
C. Lund
,
L. Fortnow
,
H. Karloff
,
N. Nisan
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 2-10
Coloring planar graphs in parallel
J.F. Boyar
,
H.J. Karloff
Journal of Algorithms
8
(4), 1987, December, pp. 470-479
Efficient parallel algorithms for edge coloring problems
H.J. Karloff
,
D.B. Shmoys
Journal of Algorithms
8
(1), 1987, March, pp. 39-52
A Las Vegas RNC algorithm for maximum matching
H.J. Karloff
Combinatorica
6
(4), 1986, pp. 387-392
Efficient parallel algorithms for graph coloring and partitioning problems
H. Karloff
,
D. Shmoys
,
D. Soroker
misc