- Lev Finkelstein, Shaul Markovitch, and Ehud Rivlin.
Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources.
J. Artif. Intell. Res. (JAIR), 19:73-138, 2003[pdf][abstract]
- Lev Finkelstein, Shaul Markovitch, and Ehud Rivlin.
Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Independent Processes.
In AAAI/IAAI, 719-724, 2002[pdf][abstract]
- Lev Finkelstein, Evgeniy Gabrilovich, Yossi Matias, Ehud Rivlin, Zach Solan, Gadi Wolfman, and Eytan Ruppin.
Placing search in context: the concept revisited.
ACM Trans. Inf. Syst., 20(1):116-131, 2002[pdf][abstract]
- Lev Finkelstein, Evgeniy Gabrilovich, Yossi Matias, Ehud Rivlin, Zach Solan, Gadi Wolfman, and Eytan Ruppin.
Placing search in context: the concept revisited.
In WWW, 406-414, 2001[pdf][abstract]
- Lev Finkelstein, Shaul Markovitch, and Ehud Rivlin.
Optimal Schedules for Parallelizing Anytime Algorithms.
In Proceedings of The AAAI Fall Symposium on Using Uncertainty within Computation, 49--56, 2001[pdf][abstract]