| 2000 |
|---|
| 9 | EE | Amir Herzberg,
Yosi Mass,
Joris Mihaeli,
Dalit Naor,
Yiftach Ravid:
Access Control Meets Public Key Infrastructure, Or: Assigning Roles to Strangers.
IEEE Symposium on Security and Privacy 2000: 2-14 |
| 1998 |
|---|
| 8 | | Amos Fiat,
Dean P. Foster,
Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid,
Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal.
SIAM J. Comput. 28(2): 447-462 (1998) |
| 1994 |
|---|
| 7 | | Amos Fiat,
Yuval Rabani,
Yiftach Ravid,
Baruch Schieber:
A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle.
Algorithmica 11(6): 572-578 (1994) |
| 6 | | Amos Fiat,
Yuval Rabani,
Yiftach Ravid:
Competitive k-Server Algorithms.
J. Comput. Syst. Sci. 48(3): 410-428 (1994) |
| 5 | | Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid:
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms.
SIAM J. Comput. 23(2): 293-312 (1994) |
| 1991 |
|---|
| 4 | | Amos Fiat,
Dean P. Foster,
Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid,
Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal
FOCS 1991: 288-297 |
| 3 | | Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid:
Lower Bounds for Randomized k-Server and Motion Planning Algorithms
STOC 1991: 278-288 |
| 1990 |
|---|
| 2 | | Amos Fiat,
Yuval Rabani,
Yiftach Ravid:
Competitive k-Server Algorithms (Extended Abstract)
FOCS 1990: 454-463 |
| 1 | EE | Noga Alon,
Yossi Azar,
Yiftach Ravid:
Universal sequences for complete graphs.
Discrete Applied Mathematics 27(1-2): 25-28 (1990) |
