Journal of the ACM Bibliography
Michael Tarsi. Optimal search on
some game trees. Journal of the ACM, 30(3):389-396, July
1983.
[BibTeX entry]
Selected papers that cite this one
- Ingo Althöfer. The complexity of a
simple stochastic OR-tree model in which ``directional search''
is bad. Journal of Complexity, 6(3):264-277, September
1990.
- Yanjun Zhang. The
variance of two game tree algorithms. In Proceedings of the
Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages
268-277, New Orleans, Louisiana, 5-7 January 1997.
- Yanjun Zhang. The variance of two game
tree algorithms. Journal of Algorithms, 28(1):21-39,
July 1998.
- Yanjun Zhang. On the optimality of
randomized alpha-beta search. SIAM Journal on
Computing, 24(1):138-147, February 1995.
Shortcuts: