论文信息 - Competitive Analysis of Algorithms - 字舞流文

Competitive Analysis of Algorithms

Gerhard J. Woeginger | Amos Fiat | A. Fiat | G. Woeginger

[1] T. Cover. Universal Portfolios , 1996 .

[2] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[3] Neil D. Pearson,et al. Consumption and Portfolio Policies With Incomplete Markets and Short‐Sale Constraints: the Finite‐Dimensional Case , 1991 .

[4] Lyle A. McGeoch,et al. Competitive algorithms for on-line problems , 1988, STOC '88.

[5] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.

[6] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[7] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.

[8] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.

[9] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.

[10] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[11] Douglas R. Woodall. The Bay Restaurant — A Linear Storage Problem , 1974 .

[12] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .

[13] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[14] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .