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="Ravid, Yiftach"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Competitive algorithms for layered graph traversal
Amos Fiat
,
Dean P. Foster
,
Howard Karloff
,
Yuval Rabani
,
Yiftach Ravid
,
Sundar Vishwanathan
SIAM Journal on Computing
28
(2), 1998, pp. 447-462
Competitive
k
-server algorithms
Amos Fiat
,
Yuval Rabani
,
Yiftach Ravid
Journal of Computer and System Sciences
48
(3), 1994, pp. 410-428
Lower bounds for randomized
k
-server and motion-planning algorithms
Howard Karloff
,
Yuval Rabani
,
Yiftach Ravid
SIAM Journal on Computing
23
(2), 1994, April, pp. 293-312
Competitive algorithms for layered graph traversal
Amos Fiat
,
Dean P. Foster
,
Howard Karloff
,
Yuval Rabani
,
Yiftach Ravid
,
Sundar Vishwanathan
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 288-297
Lower bounds for randomized
k
-server and motion-planning algorithms
Howard Karloff
,
Yuval Rabani
,
Yiftach Ravid
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC'91 (New Orleans, Louisiana, May 6-8, 1991)
, 1991, pp. 278-288