| |
| 1979 | ||
|---|---|---|
| 3 | G. M. Adelson-Velskiy, A. O. Slisenko: What can we do with problems of exhaustive search?. Algorithms in Modern Mathematics and Computer Science 1979: 315-342 | |
| 1975 | ||
| 2 | G. M. Adelson-Velskiy, V. L. Arlazarov, M. V. Donskoy: On the Structure Of An Important Class Of Exhaustive Problems And On Ways Of Search Reduction For Them. IJCAI 1975: 304-308 | |
| 1 | G. M. Adelson-Velskiy, V. L. Arlazarov, M. V. Donskoy: Some Methods of Controlling the Tree Search in Chess Programs. Artif. Intell. 6(4): 361-371 (1975) | |
| 1 | V. L. Arlazarov | [1] [2] |
| 2 | M. V. Donskoy | [1] [2] |
| 3 | A. O. Slisenko | [3] |