On-line algorithms for locating checkpoints
暂无分享,去创建一个
[1] Richard Cole,et al. Online algorithms for finger searching , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[2] Allan Borodin,et al. On the power of randomization in online algorithms , 1990, STOC '90.
[3] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[4] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[5] Marek Chrobak,et al. New results on server problems , 1991, SODA '90.
[6] Lyle A. McGeoch,et al. Competitive algorithms for on-line problems , 1988, STOC '88.
[7] Prabhakar Raghavan,et al. Random walks on weighted graphs and applications to on-line algorithms , 1993, JACM.
[8] Marek Chrobak,et al. An Optimal On-Line Algorithm for k-Servers on Trees , 1991, SIAM J. Comput..
[9] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.
[10] Edward F. Grove. The harmonic online K-server algorithm is competitive , 1991, STOC '91.
[11] James A. Storer,et al. Data Compression , 1992, Inf. Process. Manag..
[12] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[13] Lyle A. McGeoch,et al. Competitive Algorithms for Server Problems , 1990, J. Algorithms.
[14] Edward R. Fiala,et al. Data compression with finite windows , 1989, CACM.
[15] A. Robert Calderbank,et al. Sequencing Problems in Two-Server Systems , 1985, Math. Oper. Res..
[16] G.G. Langdon,et al. Data compression , 1988, IEEE Potentials.