×

zbMATH — the first resource for mathematics

Adelson-Velsky, Georgy Maximovich

Compute Distance To:
Author ID: adelson-velsky.george-m Recent zbMATH articles by "Adelson-Velsky, Georgy Maximovich"
Published as: Adel’son-Vel’skii, G. M.; Adel’son-Vel’skij, G. M.; Adel’son-Vel’skiĭ, G. M.; Adel’son-Velskij, G. M.; Adelson-Velskiy, G. M.; Adelson-Velsky, G.; Adelson-Velsky, G. M.; Adelson-Velsky, George M.; Adelson-Welsky, G.
External Links: MGP · Math-Net.Ru · Wikidata · dblp · GND
Documents Indexed: 26 Publications since 1945, including 3 Books
Biographic References: 1 Publication

Publications by Year

Citations contained in zbMATH

12 Publications have been cited 26 times in 24 Documents Cited by Year
Example of a graph without a transitive automorphism group. Zbl 0208.52501
Adel’son-Vel’skiĭ, G. M.; Veĭsfeĭler, B. Yu.; Leman, A. A.; Faradzev, I. A.
6
1969
Project scheduling in AND-OR graphs: a generalization of Dijkstra’s algorithm. Zbl 1082.90522
Adelson-Velsky, George M.; Levner, Eugene
3
2002
Some methods of controlling the tree search in chess programs. Zbl 0313.68069
Adelson-Velskiy, G. M.; Arlazarov, V. L.; Donskoy, M. V.
3
1975
The Banach mean on groups. Zbl 0079.25603
Adel’son-Vel’skiĭ, G. M.; Shreĭder, Yu. A.
3
1957
Sur les lignes de niveau des fonctions continues possedant des dérivées partielles. Zbl 0063.00015
Adelson-Velsky, G. M.; Kronrode, A. S.
3
1945
A fast scheduling algorithm in AND-OR graphs. Zbl 1036.90037
Adelson-Velsky, George M.; Gelbukh, Alexander; Levner, Eugene
2
2001
On fast path-finding algorithms in AND-OR graphs. Zbl 1069.90103
Adelson-Velsky, George M.; Gelbukh, Alexander; Levner, Eugene
1
2002
Algorithms for games. Transl. from the Russian by Arthur Brown. Zbl 0666.90089
Adelson-Velsky, G. M.; Arlazarov, V. L.; Donskoy, M. V.
1
1988
Discrete mathematics for engineers. Zbl 0788.00004
Kuznetsov, O. P.; Adel’son-Vel’skii, G. M.
1
1985
What can we do with problems of exhaustive search? Zbl 0573.68014
Adel’son-Vel’skij, G. M.; Slisenko, A. O.
1
1982
Discrete mathematics for the engineer. Zbl 0463.00003
Kuznetsov, O. P.; Adel’son-Vel’skiĭ, G. M.
1
1980
On a direct proof of the analyticity of a monogenic function. Zbl 0063.00017
Adel’son-Vel’skij, G. M.; Kronrod, A. S.
1
1945
Project scheduling in AND-OR graphs: a generalization of Dijkstra’s algorithm. Zbl 1082.90522
Adelson-Velsky, George M.; Levner, Eugene
3
2002
On fast path-finding algorithms in AND-OR graphs. Zbl 1069.90103
Adelson-Velsky, George M.; Gelbukh, Alexander; Levner, Eugene
1
2002
A fast scheduling algorithm in AND-OR graphs. Zbl 1036.90037
Adelson-Velsky, George M.; Gelbukh, Alexander; Levner, Eugene
2
2001
Algorithms for games. Transl. from the Russian by Arthur Brown. Zbl 0666.90089
Adelson-Velsky, G. M.; Arlazarov, V. L.; Donskoy, M. V.
1
1988
Discrete mathematics for engineers. Zbl 0788.00004
Kuznetsov, O. P.; Adel’son-Vel’skii, G. M.
1
1985
What can we do with problems of exhaustive search? Zbl 0573.68014
Adel’son-Vel’skij, G. M.; Slisenko, A. O.
1
1982
Discrete mathematics for the engineer. Zbl 0463.00003
Kuznetsov, O. P.; Adel’son-Vel’skiĭ, G. M.
1
1980
Some methods of controlling the tree search in chess programs. Zbl 0313.68069
Adelson-Velskiy, G. M.; Arlazarov, V. L.; Donskoy, M. V.
3
1975
Example of a graph without a transitive automorphism group. Zbl 0208.52501
Adel’son-Vel’skiĭ, G. M.; Veĭsfeĭler, B. Yu.; Leman, A. A.; Faradzev, I. A.
6
1969
The Banach mean on groups. Zbl 0079.25603
Adel’son-Vel’skiĭ, G. M.; Shreĭder, Yu. A.
3
1957
Sur les lignes de niveau des fonctions continues possedant des dérivées partielles. Zbl 0063.00015
Adelson-Velsky, G. M.; Kronrode, A. S.
3
1945
On a direct proof of the analyticity of a monogenic function. Zbl 0063.00017
Adel’son-Vel’skij, G. M.; Kronrod, A. S.
1
1945

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.