External Links

    Journal: Algorithmica

    Volume 11, Issue 6

    501 -- 524Mordecai J. Golin. A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm
    525 -- 541Neal E. Young. The k-Server Dual and Loose Competitiveness for Paging
    542 -- 571Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki. Competitive Randomized Algorithms for Nonuniform Problems
    572 -- 578Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber. A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle
    runs on