Memory versus randomization in on-line algorithms
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 687-703
- https://doi.org/10.1007/bfb0035792
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- The electrical resistance of a graph captures its commute and cover timesPublished by Association for Computing Machinery (ACM) ,1989
- Competitive snoopy cachingAlgorithmica, 1988
- Cache operations by MRU changeIEEE Transactions on Computers, 1988
- Competitive algorithms for on-line problemsPublished by Association for Computing Machinery (ACM) ,1988
- 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