Competitive Access Time via Dynamic Storage
暂无分享,去创建一个
[1] Sandy Irani,et al. Two Results on the List Update Problem , 1991, Inf. Process. Lett..
[2] Noga Alon,et al. A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..
[3] Jeffery R. Westbrook,et al. Randomized competitive algorithms for the list update problem , 1991, SODA '91.
[4] Martin Grötschel. Theoretical and practical aspects of combinatorial problem solving , 1992, SODA '92.
[5] Chak-Kuen Wong,et al. Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems , 1980, CSUR.
[6] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..
[7] Harvey F. Silverman,et al. Placement of Records on a Secondary Storage Device to Minimize Access Time , 1973, JACM.
[8] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.
[9] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[10] Chak-Kuen Wong,et al. On the Optimality of the Probability Ranking Scheme in Storage Applications , 1973, JACM.
[11] C. K. Wong,et al. Near-Optimal Solutions to a 2-Dimensional Placement Problem , 1975, SIAM J. Comput..
[12] James W. Stamos,et al. Static grouping of small objects to enhance performance of a paged virtual memory , 1984, TOCS.
[13] O. Hounkonnou. Modelling and simulation of an automated warehouse in activity , 1990 .