Memory versus randomization in on-line algorithms
Prabhakar Raghavan, Marc Snir · Lecture notes in computer science · 1989
Cited by 74 works. doi:10.1007/bfb0035792
Authors
References
- Amortized efficiency of list update and paging rules
- Competitive snoopy caching
- Competitive algorithms for on-line problems
- An optimal online algorithm for metrical task systems
- The electrical resistance of a graph captures its commute and cover times
- There are planar graphs almost as good as the complete graph
- Cache operations by MRU change