BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Abraham I, Delling D, Fiat A, et al. (2016) Highway Dimension and Provably Efficient Shortest Path Algorithms Journal of the Acm. 63: 41 |
| Cohen E, Feldman M, Fiat A, et al. (2012) Envy-Free Makespan Approximation Siam Journal On Computing. 41: 12-25 |
| Cohen E, Fiat A, Kaplan H. (2007) Associative search in peer to peer networks: Harnessing latent semantics Computer Networks. 51: 1861-1881 |
| Bartal Y, Fiat A, Leonardi S. (2006) Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing Siam Journal On Computing. 36: 354-393 |
| Chent K, Fiat A, Kaplan H, et al. (2006) Online conflict-free coloring for intervals Siam Journal On Computing. 36: 1342-1359 |
| Azar Y, Fiat A, Levy M, et al. (2006) An improved algorithm for online coloring of intervals with bandwidth Theoretical Computer Science. 363: 18-27 |
| Azar Y, Cohen E, Fiat A, et al. (2004) Optimal oblivious routing in polynomial time Journal of Computer and System Sciences. 69: 383-394 |
| Awerbuch B, Bartal Y, Fiat A. (2003) Competitive distributed file allocation Information and Computation. 185: 1-40 |
| Awerbuch B, Azar Y, Fiat A, et al. (2001) On-line competitive algorithms for call admission in optical networks Algorithmica (New York). 31: 29-43 |
| El-Yaniv R, Fiat A, Karp RM, et al. (2001) Optimal Search and One-Way Trading Online Algorithms Algorithmica. 30: 101-139 |