Author:
Ma Weimin,Gao Ting,Wang Ke
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communication of the ACM 28, 202–208 (1985)
2. Karlin, R., Manasse, M., Rudlph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica 3, 79–119 (1988)
3. Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for on-line problems. In: Proc. 20th Annual ACM Symp. on Theory of Computing, pp. 322–333. ACM Press, New York (1988)
4. Borodin, A., Linial, N., Sake, M.: An optimal on-line algorithm for metrical task systems. Journal of ACM 39, 745–763 (1992)
5. Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. Journal of Algorithms (11), 208–230 (1990)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Value of foreknowledge in the online k-taxi problem;International Journal of Machine Learning and Cybernetics;2016-01-05