1. A provably fast linear-expected-time maxima-finding algorithm

   • M. J. Golin

   OriginalPaper Pages: 501 - 524

2. Thek-server dual and loose competitiveness for paging

   • N. Young

   OriginalPaper Pages: 525 - 541

3. Competitive randomized algorithms for nonuniform problems

   • A. R. Karlin
   • M. S. Manasse
   • S. Owicki

   OriginalPaper Pages: 542 - 571

4. A deterministicO(k ³)-competitivek-server algorithm for the circle

   • A. Fiat
   • Y. Rabani
   • B. Schieber

   OriginalPaper Pages: 572 - 578