1

Dimitris Achlioptas , Marek Chrobak , John Noga, Competive Analysis of Randomized Paging Algorithms, Proceedings of the Fourth Annual European Symposium on Algorithms, p.419-430, September 25-27, 1996

2

Dimitris Achlioptas , Marek Chrobak , John Noga, Competitive analysis of randomized paging algorithms, Theoretical Computer Science, v.234 n.1-2, p.203-218, March 6, 2000  [doi>10.1016/S0304-3975(98)00116-9]

3

Yair Bartal , Eddie Grove, The harmonic k-server algorithm is competitive, Journal of the ACM (JACM), v.47 n.1, p.1-15, Jan. 2000  [doi>10.1145/331605.331606]

4

Wolfgang W. Bein , Rudolf Fleischer , Lawrence L. Larmore, Limited bookmark randomized online algorithms for the paging problem, Information Processing Letters, v.76 n.4-6, p.155-162, Dec.31 2000  [doi>10.1016/S0020-0190(00)00140-X]

5

Wolfgang W. Bein , Lawrence L. Larmore, Trackless online algorithms for the server problem, Information Processing Letters, v.74 n.1-2, p.73-79, April 2000  [doi>10.1016/S0020-0190(00)00034-X]

6

Allan Borodin , Ran El-Yaniv, Online computation and competitive analysis, Cambridge University Press, New York, NY, 1998

7

Marek Chrobak , Elias Koutsoupias , John Noga, More on randomized on-line algorithms for caching, Theoretical Computer Science, v.290 n.3, p.1997-2008, 3 January 2003  [doi>10.1016/S0304-3975(02)00045-2]

8

Marek Chrobak , Lawrence L. Larmore, On fast algorithms for two servers, Journal of Algorithms, v.12 n.4, p.607-614, Dec. 1991  [doi>10.1016/0196-6774(91)90035-W]

9

Marek Chrobak , Lawrence L. Larmore, HARMONIC is a 3–competitive for two servers, Theoretical Computer Science, v.98 n.2, p.339-346, 18 May 1992  [doi>10.1016/0304-3975(92)90007-3]

10

Marek Chrobak , Lawrence L. Larmore , Carsten Lund , Nick Reingold, A better lower bound on the competitive ratio of the randomized 2-server problem, Information Processing Letters, v.63 n.2, p.79-83, July 28, 1997  [doi>10.1016/S0020-0190(97)00099-9]

11

Marek Chrobak , Jiří Sgall, A simple analysis of the harmonic algorithm for two servers, Information Processing Letters, v.75 n.1-2, p.75-77, July 2000  [doi>10.1016/S0020-0190(00)00070-3]

12

Don Coppersmith , Peter Doyle , Prabhakar Raghavan , Marc Snir, Random walks on weighted graphs and applications to on-line algorithms, Journal of the ACM (JACM), v.40 n.3, p.421-453, July 1993  [doi>10.1145/174130.174131]

13

Leah Epstein , Csanád Imreh , Rob van Stee, More on Weighted Servers or FIFO is Better than LRU, Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, p.257-268, August 26-30, 2002

14

Amos Fiat , Richard M. Karp , Michael Luby , Lyle A. McGeoch , Daniel D. Sleator , Neal E. Young, Competitive paging algorithms, Journal of Algorithms, v.12 n.4, p.685-699, Dec. 1991  [doi>10.1016/0196-6774(91)90041-V]

15

Sandy Irani , Ronitt Rubinfeld, A competitive 2-server algorithm, Information Processing Letters, v.39 n.2, p.85-91, July 31, 1991  [doi>10.1016/0020-0190(91)90160-J]

16

Elias Koutsoupias and Christos Papadimitriou. Beyond competitive analysis. In Proc. 35th Symp. Foundations of Computer Science (FOCS), pages 394--400. IEEE, 1994.

17

Elias Koutsoupias , Christos H. Papadimitriou, On the k-server conjecture, Journal of the ACM (JACM), v.42 n.5, p.971-983, Sept. 1995  [doi>10.1145/210118.210128]

18

Mark S. Manasse , Lyle A. McGeoch , Daniel D. Sleator, Competitive algorithms for server problems, Journal of Algorithms, v.11 n.2, p.208-230, Jun. 1990  [doi>10.1016/0196-6774(90)90003-W]

19

P. Raghavan , M. Snir, Memory versus randomization in on-line algorithms, IBM Journal of Research and Development, v.38 n.6, p.683-707, Nov. 1994

Marek Chrobak: colleagues