Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
- 1 April 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (2) , 293-312
- https://doi.org/10.1137/s0097539792224838
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Competitive algorithms for layered graph traversalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Competitive k-server algorithmsJournal of Computer and System Sciences, 1994
- Competitive paging algorithmsJournal of Algorithms, 1991
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- New Ressults on Server ProblemsSIAM Journal on Discrete Mathematics, 1991
- An Optimal On-Line Algorithm for K Servers on TreesSIAM Journal on Computing, 1991
- Competitive algorithms for server problemsJournal of Algorithms, 1990
- An on-line graph coloring algorithm with sublinear performance ratioDiscrete Mathematics, 1989
- Memory versus randomization in on-line algorithmsPublished by Springer Nature ,1989
- Shortest paths without a mapPublished by Springer Nature ,1989