Thek-server dual and loose competitiveness for paging
暂无分享,去创建一个
[1] ChrobakMarek,et al. An optimal on-line algorithm for K-servers on trees , 1991 .
[2] Neal E. Young,et al. Competitive paging and dual-guided algorithms for weighted caching and matching (Thesis) , 1991 .
[3] Lyle A. McGeoch,et al. Competitive Algorithms for Server Problems , 1990, J. Algorithms.
[4] Anant Agarwal,et al. Multiprocessor cache analysis using ATUM , 1988, ISCA '88.
[5] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.
[6] Marek Chrobak,et al. New results on server problems , 1991, SODA '90.
[7] Lyle A. McGeoch,et al. A strongly competitive randomized paging algorithm , 1991, Algorithmica.
[8] Marek Chrobak,et al. An Optimal On-Line Algorithm for k-Servers on Trees , 1991, SIAM J. Comput..
[9] Allan Borodin,et al. On the power of randomization in on-line algorithms , 2005, Algorithmica.
[10] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.
[11] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[12] Neal E. Young,et al. On-line caching as cache size varies , 1991, SODA '91.
[13] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[14] Allan Borodin,et al. On the power of randomization in online algorithms , 1990, STOC '90.
[15] Sandy Irani,et al. Strongly competitive algorithms for paging with locality of reference , 1992, SODA '92.
[16] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[17] Allan Borodin,et al. Competitive paging with locality of reference , 1991, STOC '91.