Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. S. Albeis. The influence of lookahead in competitive paging algorithms. In Proc. of the 1st Annual European Symposium on Algorithms, pages 1–12, 1993.
2. S. Ben-David and A. Borodin. A new measure for the study of on-line algorithms. Algorithmica, special issue on on-line algorithms, 11(1):73–91, 1994.
3. J.L. Bentley and C.C. McGeoch. Amortized analyses of self-organizing sequential search heuristics. Communications of the ACM, 28(4):404–411, 1985.
4. F.K. Chung, R. Graham and M.E. Saks. A dynamic location problem for graphs. Combinatorica, 9(2):111–131, 1989.
5. M.M. Halldórsson and M. Szegedy. Lower bounds for on-line graph coloring. In Proc. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 211–216, 1992.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献