On the power of randomization in online algorithms
暂无分享,去创建一个
Allan Borodin | Shai Ben-David | Richard M. Karp | Avi Wigderson | Gábor Tardos | A. Wigderson | R. Karp | A. Borodin | Shai Ben-David | G. Tardos
[1] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[2] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.
[3] Lyle A. McGeoch,et al. Competitive algorithms for on-line problems , 1988, STOC '88.
[4] Marek Chrobak,et al. New results on server problems , 1991, SODA '90.
[5] Lyle A. McGeoch,et al. Competitive Algorithms for Server Problems , 1990, J. Algorithms.
[6] Gábor Tardos,et al. A competitive 3-server algorithm , 1990, SODA '90.
[7] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.