A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In ACM STOC, 1987. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Random Walks on Weighted Graphs, and Applications.. - Coppersmith.. (1993) (24 citations) (Correct)
Random Walks on Weighted Graphs, and Applications.. - Coppersmith.. (1990) (24 citations) (Correct)
On-line Learning and the Metrical Task System Problem - Blum, Burch (2000) (22 citations) (Correct)
A Ramsey-type Theorem for Metric Spaces and its.. - Bartal.. (2001) (1 citation) (Correct)
On-line Learning and the Metrical Task System Problem - Blum, Burch (1997) (22 citations) (Correct)
Memory Paging for Connectivity and Path Problems in Graphs - Feuerstein (1998) (15 citations) (Correct)
Rational Competitive Analysis - Tennenholtz (Correct)
On-line Scheduling with Hard Deadlines - Goldman, Parwatikar, Suri (1998) (13 citations) (Correct)
Online Algorithms for Locating Checkpoints - Marshall Bern Daniel (1994) (3 citations) (Correct)
Online Algorithms for Locating Checkpoints - Bern, Greene, Raghunathan, Sudan (1994) (3 citations) (Correct)
Beyond Competitive Analysis - Koutsoupias, Papadimitriou (1994) (62 citations) (Correct)
One-Way Trading Online Algorithms - El-Yaniv, Fiat, Karp, Turpin (Correct)
Online Performance-Improvement - Prasad Chalasani August (Correct)
The k-client Problem - Alborzi, Torng, Uthaisombut, Wagner (1997) (Correct)
The k-client Problem - Houman Alborzi Department (Correct)
New Directions in Machine Scheduling - Uthaisombut (2000) (Correct)
Topology Matters: Smoothed Competitiveness of Metrical Task.. - Guido Schafer And (2003) (Correct)
A Competitive Algorithm for the General 2-Server Problem - Sitters, Stougie, de Paepe (2003) (1 citation) (Correct)
On Approximating Arbitrary Metrics by Tree Metrics - Bartal (1998) (87 citations) (Correct)
Multi-Embedding and Path Approximation of Metric Spaces - Yair Bartal Manor (2003) (1 citation) (Correct)
Topology Matters: - Smoothed Competitiveness Of (2003) (Correct)
Dr. Frankenstein's Approach to On-line Algorithms - Extended Yossi (Correct)
On Online Computation - Irani, Karlin (1997) (44 citations) (Correct)
One-Way Trading Online Algorithms - El-Yaniv, Fiat, Karp, Turpin (Correct)
Randomized Robot Navigation Algorithms - Berman, Blum, Fiat, Karloff.. (1996) (25 citations) Self-citation (Saks) (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC