Publisher
Springer Science and Business Media LLC
Reference39 articles.
1. Achlioptas D, Chrobak M, Noga J (2000) Competitive analysis of randomized paging algorithms. Theor Comput Sci 234(1–2):203–218
2. Albers S, Koga H (1995) Page migration with limited local memory capacity. In: Proc of the 4th int workshop on algorithms and data structures (WADS), pp 147–158
3. Albers S, Koga H (1998) New on-line algorithms for the page replication problem. J Algorithms 27(1):75–96. Also appeared in Proc of the 4th SWAT, pp 25–36 (1994)
4. Alon N, Azar Y (1992) On-line Steiner trees in the Euclidean plane. In: Proc of the 8th ACM symp on computational geometry (SoCG), pp 337–343
5. Awerbuch B, Bartal Y, Fiat A (1993) Competitive distributed file allocation. In: Proc of the 25th ACM symp on theory of computing (STOC), pp 164–173
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Toward Online Mobile Facility Location on General Metrics;Theory of Computing Systems;2023-10-06
2. A $$3+\varOmega (1)$$ Lower Bound for Page Migration;Algorithmica;2020-03-23
3. Dynamic Beats Fixed;ACM Transactions on Algorithms;2019-10-31
4. Uniform Page Migration Problem in Euclidean Space;Algorithms;2016-08-23
5. A 3+Omega(1) Lower Bound for Page Migration;2015 Third International Symposium on Computing and Networking (CANDAR);2015-12