Amos Fiat

Tel Aviv University

Papers

2

Total Citations

49

H-Index

2

About

Amos Fiat is a leading figure in algorithm design, with foundational contributions spanning online algorithms, computational game theory, and robotics. His work on "Randomized Robot Navigation Algorithms" (1996, 44 citations) pioneered the use of randomization to solve the fundamental challenge of a robot navigating an unmapped environment with obstacles—a problem with no prior knowledge of the terrain. This research laid critical groundwork for modern autonomous systems. Fiat also made significant strides in resource optimization, as seen in his paper "Competitive Access Time via Dynamic Storage Rearrangement" (2002, 5 citations), which models warehouse item storage as a graph problem to minimize server travel distance, with direct applications to industrial stacker crane management. Beyond these, his broader impact is evident in his highly cited work on competitive analysis for paging and caching, and his influential research on algorithmic mechanism design, including the study of truthful auctions and price of anarchy. A prolific scholar, Fiat’s ideas continue to shape how we design efficient, adaptive systems in uncertain environments.

Research Focus

Key Achievements

2
H-Index
2
Papers
49
Total Citations
25
Avg Citations/Paper
🏆 Most Cited Paper
Randomized robot navigation algorithms
44 citations · 1996
📈 Most Prolific Year: 1996 (1 Papers)
🤝 Key Collaborators: 8
🏛 Institutions: Tel Aviv University

Top Papers

  1. 1
  2. 2

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 12 days ago