Yiftach Ravid

According to our database, Yiftach Ravid authored at least 8 papers between 1990 and 2000.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2000

Access Control Meets Public Key Infrastructure, Or: Assigning Roles to Strangers.

Amir Herzberg, Yosi Mass, Joris Mihaeli, Dalit Naor, Yiftach Ravid

Proceedings of the 2000 IEEE Symposium on Security and Privacy, 2000

1998

Competitive Algorithms for Layered Graph Traversal.

Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan

SIAM J. Comput., 1998

1994

Lower Bounds for Randomized k-Server and Motion-Planning Algorithms.

Howard J. Karloff, Yuval Rabani, Yiftach Ravid

SIAM J. Comput., 1994

Competitive k-Server Algorithms.

Amos Fiat, Yuval Rabani, Yiftach Ravid

J. Comput. Syst. Sci., 1994

A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle.

Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber

Algorithmica, 1994

1992

Lower bounds for on-line problems

Yiftach Ravid

PhD thesis, 1992

1990

Universal sequences for complete graphs.

Noga Alon, Yossi Azar, Yiftach Ravid

Discret. Appl. Math., 1990

Competitive k-Server Algorithms (Extended Abstract)

Amos Fiat, Yuval Rabani, Yiftach Ravid

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990