Beyond competitive analysis [on-line algorithms]
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 372, 394-400
- https://doi.org/10.1109/sfcs.1994.365677
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Strongly Competitive Algorithms for Paging with Locality of ReferenceSIAM Journal on Computing, 1996
- Thek-server dual and loose competitiveness for pagingAlgorithmica, 1994
- The server problem and on-line gamesPublished by American Mathematical Society (AMS) ,1992
- A statistical adversary for on-line algorithmsPublished by American Mathematical Society (AMS) ,1992
- Competitive paging algorithmsJournal of Algorithms, 1991
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- Memory versus randomization in on-line algorithmsPublished by Springer Nature ,1989
- Shortest paths without a mapPublished by Springer Nature ,1989
- An optimal online algorithm for metrical task systemsPublished by Association for Computing Machinery (ACM) ,1987
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985