G. M. Adelson-Velskiy

According to our database, G. M. Adelson-Velskiy authored at least 3 papers between 1975 and 1979.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

1979

What can we do with problems of exhaustive search?.

G. M. Adelson-Velskiy, A. O. Slisenko

Proceedings of the Algorithms in Modern Mathematics and Computer Science, 1979

1975

Some Methods of Controlling the Tree Search in Chess Programs.

G. M. Adelson-Velskiy, Vladimir L. Arlazarov, M. V. Donskoy

Artif. Intell., 1975

On the Structure Of An Important Class Of Exhaustive Problems And On Ways Of Search Reduction For Them.

G. M. Adelson-Velskiy, Vladimir L. Arlazarov, M. V. Donskoy

Proceedings of the Advance Papers of the Fourth International Joint Conference on Artificial Intelligence, 1975