Lev Finkelstein
Papers
1
Total Citations
19
H-Index
1
About
Lev Finkelstein is a computer scientist whose work bridges theoretical scheduling and practical algorithmic design, with a particular focus on contract algorithms and multi-robot coordination. His most-cited paper, "Contract algorithms and robots on rays: unifying two scheduling problems" (2003, 19 citations), reveals a key insight: that scheduling flexible algorithms with uncertain run times is formally equivalent to planning the search paths of robots on rays. This elegant unification has influenced both real-time computing and autonomous systems. Finkelstein’s contributions lie in demonstrating how seemingly disparate problems—like trading off solution quality for computational speed and coordinating robots to explore unknown environments—can be solved using shared mathematical frameworks. His work has been cited in research on online algorithms, resource-constrained scheduling, and multi-agent planning. By revealing deep structural parallels, Finkelstein has helped shape how researchers think about decision-making under uncertainty, making his ideas relevant to fields ranging from artificial intelligence to operations research.
Research Focus
Key Achievements
Top Papers
- 1Contract algorithms and robots on rays: unifying two scheduling problems19 citations · 2003