Home * People * Igor Roizen

Igor Roizen,
an American computer scientist at the Cognitive Systems Laboratory and Department of Computer Science at University of California, Los Angeles. In the 80s he worked with Judea Pearl on search algorithms like Alpha-Beta, Scout and SSS*.

Selected Publications

^{[1] [2]}

• Igor Roizen (1981). On the Average Number of Terminal Nodes examined by Alpha-Beta. Technical Report UCLA-ENG-CSL-8108, University of California at Los Angeles, Cognitive Systems Laboratory
• Igor Roizen, Judea Pearl (1983). The Average Performance of Three Game-Searching Algorithms. UCLA Cognitive Systems Laboratory Technical Report (R-40).
• Igor Roizen, Judea Pearl (1983). A Minimax Algorithm Better than Alpha-Beta? Yes and No. Artificial Intelligence, Vol. 21, pp. 199-230. ISSN 0004-3702
• Igor Roizen, Judea Pearl (1985). Learning Link Probabilities in Causal Trees. as pdf
• Michael D. Greenfield, Igor Roizen (1993). Katydid synchronous chorusing is an evolutionarily stable outcome of female choice. Nature Vol 364, pdf

References

1. ^ Claude G. Diderich (1993). A Bibliography on Minimax Trees. ACM SIGACT News, Vol. 24, No. 4
2. ^ dblp: Igor Roizen

What links here?

Up one level