Yiftach Ravid

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2000
Access Control Meets Public Key Infrastructure, Or: Assigning Roles to Strangers.
Proceedings of the 2000 IEEE Symposium on Security and Privacy, 2000

1994
Competitive k-Server Algorithms.
J. Comput. Syst. Sci., 1994

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

1992
Lower bounds for on-line problems
PhD thesis, 1992

1991
Lower Bounds for Randomized k-Server and Motion Planning Algorithms
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Competitive Algorithms for Layered Graph Traversal
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Universal sequences for complete graphs.
Discret. Appl. Math., 1990

Competitive k-Server Algorithms (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990


  Loading...