Author:
Bein Wolfgang,Larmore Lawrence L.,Noga John
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theoret. Comput. Sci. 234, 203–218 (2000)
2. Bein, W., Fleischer, R., Larmore, L.L.: Limited bookmark randomized online algorithms for the paging problem. Inform. Process. Lett. 76, 155–162 (2000)
3. Bein, W., Larmore, L.L.: Trackless online algorithms for the server problem. Inform. Process. Lett. 74, 73–79 (2000)
4. Bein, W., Larmore, L.L., Reischuk, R.: Knowledge state algorithms: Randomization with limited information(2007) Arxiv: archive.org/cs/0701142
5. Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Syst. J. 5, 78–101 (1966)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献