| Year |
Citation |
Score |
| 2016 |
Abraham I, Delling D, Fiat A, Goldberg AV, Werneck RF. Highway Dimension and Provably Efficient Shortest Path Algorithms Journal of the Acm. 63: 41. DOI: 10.1145/2985473 |
0.36 |
|
| 2012 |
Cohen E, Feldman M, Fiat A, Kaplan H, Olonetsky S. Envy-Free Makespan Approximation Siam Journal On Computing. 41: 12-25. DOI: 10.1137/100801597 |
0.311 |
|
| 2007 |
Cohen E, Fiat A, Kaplan H. Associative search in peer to peer networks: Harnessing latent semantics Computer Networks. 51: 1861-1881. DOI: 10.1016/J.Comnet.2006.09.014 |
0.306 |
|
| 2006 |
Bartal Y, Fiat A, Leonardi S. Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing Siam Journal On Computing. 36: 354-393. DOI: 10.1137/S009753979833965X |
0.339 |
|
| 2006 |
Chent K, Fiat A, Kaplan H, Levy M, Matoušek J, Mossel E, Pach J, Sharir M, Smorodinsky S, Wagner U, Welzl E. Online conflict-free coloring for intervals Siam Journal On Computing. 36: 1342-1359. DOI: 10.1137/S0097539704446682 |
0.332 |
|
| 2006 |
Azar Y, Fiat A, Levy M, Narayanaswamy NS. An improved algorithm for online coloring of intervals with bandwidth Theoretical Computer Science. 363: 18-27. DOI: 10.1016/J.Tcs.2006.06.014 |
0.34 |
|
| 2004 |
Azar Y, Cohen E, Fiat A, Kaplan H, Räcke H. Optimal oblivious routing in polynomial time Journal of Computer and System Sciences. 69: 383-394. DOI: 10.1016/J.Jcss.2004.04.010 |
0.326 |
|
| 2003 |
Awerbuch B, Bartal Y, Fiat A. Competitive distributed file allocation Information and Computation. 185: 1-40. DOI: 10.1016/S0890-5401(03)00055-5 |
0.345 |
|
| 2001 |
Awerbuch B, Azar Y, Fiat A, Leonardi S, Rosén A. On-line competitive algorithms for call admission in optical networks Algorithmica (New York). 31: 29-43. DOI: 10.1007/S00453-001-0039-1 |
0.309 |
|
| 2001 |
El-Yaniv R, Fiat A, Karp RM, Turpin G. Optimal Search and One-Way Trading Online Algorithms Algorithmica. 30: 101-139. DOI: 10.1007/S00453-001-0003-0 |
0.307 |
|
| 2001 |
Fiat A, Tassa T. Dynamic Traitor Tracing Journal of Cryptology. 14: 211-223. DOI: 10.1007/S00145-001-0006-7 |
0.302 |
|
| 2000 |
Chor B, Fiat A, Naor M, Pinkas B. Tracing traitors Ieee Transactions On Information Theory. 46: 893-910. DOI: 10.1109/18.841169 |
0.3 |
|
| 1999 |
Fiat A, Woeginger GJ. On-line scheduling on a single machine: minimizing the total completion time Acta Informatica. 36: 287-293. DOI: 10.1007/S002360050162 |
0.312 |
|
| 1999 |
Azar Y, Bartal Y, Feuerstein E, Fiat A, Leonardi S, Rosén A. On Capital Investment Algorithmica. 25: 22-36. DOI: 10.1007/Pl00009281 |
0.301 |
|
| 1998 |
Fiat A, Woeginger GJ. Online algorithms : The state of the art Lecture Notes in Computer Science. 1442. DOI: 10.1007/Bfb0029561 |
0.343 |
|
| 1998 |
Awerbuch B, Bartal Y, Fiat A. Distributed paging for general networks Journal of Algorithms. 28: 67-104. DOI: 10.1006/Jagm.1998.0924 |
0.306 |
|
| 1997 |
Aspnes J, Azar Y, Fiat A, Plotkin S, Waarts O. On-line routing of virtual circuits with applications to load balancing and machine scheduling Journal of the Acm. 44: 486-504. DOI: 10.1145/258128.258201 |
0.345 |
|
| 1994 |
Fiat A, Ricklin M. Competitive algorithms for the weighted server problem Theoretical Computer Science. 130: 85-99. DOI: 10.1016/0304-3975(94)90154-6 |
0.334 |
|
| 1994 |
Fiat A, Rabani Y, Ravid Y, Schieber B. A deterministicO(k3)-competitivek-server algorithm for the circle Algorithmica. 11: 572-578. DOI: 10.1007/Bf01189994 |
0.349 |
|
| 1993 |
Fiat A, Naor M. Implicit O (1) probe search Siam Journal On Computing. 22: 1-10. DOI: 10.1137/0222001 |
0.313 |
|
| 1991 |
Fiat A, Karp RM, Luby M, McGeoch LA, Sleator DD, Young NE. Competitive paging algorithms Journal of Algorithms. 12: 685-699. DOI: 10.1016/0196-6774(91)90041-V |
0.357 |
|
| 1989 |
Fiat A, Shamir A. How to find a battleship Networks. 19: 361-371. DOI: 10.1002/Net.3230190306 |
0.57 |
|
| 1988 |
Fiat A, Naor M, Schmidt JP, Siegel A. Non-oblivious hashing Proceedings of the Annual Acm Symposium On Theory of Computing. 367-376. DOI: 10.1145/146585.146591 |
0.305 |
|
| 1988 |
Feige U, Fiat A, Shamir A. Zero-knowledge proofs of identity Journal of Cryptology. 1: 77-94. DOI: 10.1007/Bf02351717 |
0.598 |
|
| 1986 |
Fiat A, Shamir A. Polymorphic arrays: A novel VLSI layout for systolic computers Journal of Computer and System Sciences. 33: 47-65. DOI: 10.1016/0022-0000(86)90042-5 |
0.584 |
|
| Show low-probability matches. |