Competitive k-Server Algorithms (Extended Abstract) - Amos Fiat; Yuval Rabani; Yiftach Ravid (FOCS, 1990)

Universal sequences for complete graphs. - Noga Alon; Yossi Azar; Yiftach Ravid (Discret. Appl. Math., 1990)

Lower bounds for on-line problems - Yiftach Ravid (1992)

A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle. - Amos Fiat; Yuval Rabani; Yiftach Ravid; Baruch Schieber (Algorithmica, 1994)

Competitive k-Server Algorithms. - Amos Fiat; Yuval Rabani; Yiftach Ravid (J. Comput. Syst. Sci., 1994)

Lower Bounds for Randomized k-Server and Motion-Planning Algorithms. - Howard J. Karloff; Yuval Rabani; Yiftach Ravid (SIAM J. Comput., 1994)

Competitive Algorithms for Layered Graph Traversal. - Amos Fiat; Dean P. Foster; Howard J. Karloff; Yuval Rabani; Yiftach Ravid; Sundar Vishwanathan (SIAM J. Comput., 1998)

Access Control Meets Public Key Infrastructure, Or: Assigning Roles to Strangers. - Amir Herzberg; Yosi Mass; Joris Mihaeli; Dalit Naor; Yiftach Ravid (S&P, 2000)