Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Adelʹson-Velskii, Georgii Maksimovich
(1922–2014)
Statistics
in MathSciNet: 16 (16)
in zbMATH: 21 (21)
in Scopus: 5 (5)
Adelʹson-Velskii, Georgii Maksimovich
Professor
Doctor of technical sciences

https://www.mathnet.ru/eng/person24726
https://ru.wikipedia.org/wiki/%D0%90%D0%B4%D0%B5%D0%BB%D1%8C%D1%81%D0%BE%D0%BD-%D0%92%D0%B5%D0%BB%D1%8C%D1%81%D0%BA%D0%B8%D0%B9,_%D0%93%D0%B5%D0%BE%D1%80%D0%B3%D0%B8%D0%B9_%D0%9C%D0%B0%D0%BA%D1%81%D0%B8%D0%BC%D0%BE%D0%B2%D0%B8%D1%87
List of publications on Google Scholar
https://mathscinet.ams.org/mathscinet/MRAuthorID/228863

List of publications:
| scientific publications | by years | by types | by times cited | common list |


Citations (Crossref Cited-By Service + Math-Net.Ru)
1. I. I. Levintov, G. M. Adelson-Velsky, “Real part of the $p$-$p$ forward scattering amplitude of high energies”, Phys. Lett., 13:2 (1964), 185–187  crossref  adsnasa  scopus 20
2. G. M. Adelson-Velsky, E. Levner, “Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm”, Mathematics of Operations Research, 27:3 (2002), 504–517  crossref  zmath  scopus 13
3. G. M. Adel'son-Vel'skii, V. L. Arlazarov, A. R. Bitman, A. A. Zhivotovskii, A. V. Uskov, “Programming a computer to play chess”, Russian Math. Surveys, 25:2 (1970), 221–262  mathnet  crossref  mathscinet  zmath  adsnasa  scopus
4. G. M. Adel'son-Vel'skii, Yu. A. Shreider, “The Banach mean on groups”, Uspekhi Mat. Nauk, 12:6(78) (1957), 131–136  mathnet  mathscinet  zmath
5. G. M. Adel'son-Vel'skii, E. M. Landis, “An algorithm for organization of information”, Dokl. Akad. Nauk SSSR, 146:2 (1962), 263–266  mathnet  mathscinet
6. G. Adelson-Velsky, A. Gelbukh, E. Levner, “On Grammars, Hypergraphs, and AND-OR Graphs Based on Generalized Bellman Equations”, Proceedings of the IASTED International Conference on Advances in Computer Science and Technology (November 22–24, 2004, St. Thomas, US Virgin Islands), ACTA Press, 2004
7. G. Adelson-Velsky, A. Gelbukh, E. Levner, “On fast path-fiding algorithms in AND-OR graphs”, Math. Probl. Eng., 8:4-5 (2002), 283–293  crossref  mathscinet  zmath  scopus
8. G. M. Adelson-Velsky, E. Levner, “Routing information flows in networks: A generalization of Dijkstra's algorithm”, Proceedings of the International Conference Distributed Computer Communication Networks, 1999
9. G. Adelson-Velsky, “On difficulties of Programming for parallel computers”, Proceedings of the Int. Workshop “Intelligent Scheduling of Robots and Flexible Manufacturing Systems” (Holon, Israel, June 5, 1996), CTEH Press, 1997
10. G. Adelson-Velsky, “On the ways to form heuristic Algorithms and Programs”, Proceedings of the Int. Workshop “Intelligent Scheduling of Robots and Flexible Manufacturing Systems” (Holon, Israel, June 5, 1996), CTEH Press, 1997
11. G. Adelson-Velsky, “On Design of Software Systems capable of Self-Improvement during the Expert-Machine Dialogue”, Proceedings of the Int. Workshop “Intelligent Scheduling of Robots and Flexible Manufacturing Systems” (Holon, Israel, July 2, 1995), CTEH Press, 1995
12. G.Adelson-Velskii, V. Arlazarov, A. Bitman, M. Donskoi, Mashina igraet v shakhmaty, Zinatne, Riga, 1991, 204 pp. (na latyshskom yazyke)
13. G.M. Adelson-Velskii, “Mezhdistsiplinarnye usiliya v reshenii prikladnykh zadach”, Sistemnye issledovaniya. Metodologicheskie problemy, AN SSSR, VNIISI, M., 1991
14. O. Kuznetsov, G.Adelson-Velskii, Diskretnaya matematika dlya inzhenera, s il., 2-e izd., Energoatomizdat, M., 1988, 480 pp.
15. G.Adelson-Velskii, A.Bitman, “O formirovanii algoritmov dlya mashinnoi igry v shakhmaty”, Izvestiya Akademii nauk SSSR. Tekhnicheskaya kibernetika, 1988, no. 2
16. G.Adelson-Velskii, V. Akimov, “Neshennonovskie algoritmy poiska”, Izvestiya Akademii nauk SSSR, Tekhnicheskaya kibernetika, 1988, no. 3
17. G.Adelson-Velskii, V. Arlazarov, “Analiz modelei dannykh v ramkakh edinoi formalizatsii”, Sbornik trudov VNIISI, 22, 1988
18. G. M. Adel'son-Vel'skii, V. P. Akimov, “On validity of Shannon's game model”, Avtomat. i Telemekh., 1987, no. 1, 171–173  mathnet
19. O. Kuznetsov, G. Adelson-Velsky, Discrete Mathematics for Engineers, Gordon and Breach Science Publishers, New York–London, et al., 1985  zmath
20. G. M. Adelson-Velskii, “Opredelenie kachestva otsenochnoi funktsii bez uchastiya ekspertov”, Metodologiya sistemnykh issledovanii, tez. dokl. Vses. simp., M., 1985
21. G. M. Adelson-Velskii, V. L. Arlazarov, A. R. Bitman, M. V. Donskoi, Mashina igraet v shakhmaty, s il., ed. A. F. Volkov, Nauka, M., 1983, 207 pp.
22. Adelson-Velskii G. M., Slisenko A.O., Chto my mozhem sdelat s zadachami polnogo perebora?, Algoritmy v sovremennoi matematike i ee prilozheniyakh, Materialy mezhdunarodnogo simpoziuma, v 2-kh ch. (Urgench, UzSSR, 16–22 sent. 1979 g.), v. 2, eds. A. P. Ershov, D. Knut, VTs SO AN SSSR, Novosibirsk, 1982, 364 pp.
23. G. M. Adelson-Velskii, V. P. Akimov, V. L. Arlazarov, “O veroyatnostnom podkhode k obosnovaniyu igrovoi modeli Shennona”, Avtomat. i telemekh., 1980, no. 9, 138–144  mathnet  mathscinet  zmath; G. M. Adel'son-Vel'skii, V. P. Akimov, V. L. Arlazarov, “On a probabilistic approach to verification of the Shannon game model”, Autom. Remote Control, 41:9 (1981), 1299–1304  mathscinet  zmath
24. O. Kuznetsov, G.Adelson-Velskii, Diskretnaya matematika dlya inzhenera, s il., 1-e izd., Energoizdat, 1980, 344 pp.
25. G. Adelson-Velskii, V. Arlazarov, M. Donskoi, “Printsipy sozdaniya shakhmatnykh programm”, Zhurnal Priroda, 1979, no. 7, 86–97
26. G. M. Adelson-Velskii, V. L. Arlazarov, “O veroyatnostnom podkhode k modelirovaniyu igr dvukh protivnikov s polnoi informatsiei”, Semiotika i informatika, 1979, no. 12
27. G. M. Adelson-Velskii, V. P. Akimov, V. L. Arlazarov, N. E. Kosacheva, “O primenenii veroyatnostnogo podkhoda dlya povysheniya kachestva vybora khoda pri programmirovanii igr dvukh protivnikov s polnoi informatsiei”, Semiotika i informatika, 1979, no. 12
28. G. M. Adelson-Velskii, V. P. Arlazarov, M. V. Donskoi, Programmirovanie igr, Nauka, M., 1978, 225 pp.  mathscinet; G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy, Algorithms for games, Springer-Verlag, New York, 1988, x+197 pp.  crossref  mathscinet  zmath
29. G. M. Adelson-Velskii, V. P. Arlazarov, M. V. Donskoi, “Programmirovanie shakhmat”, Vestnik Akademii Nauk SSSR, 1978, no. 4
30. G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy, “Algorithms of adaptive search”, Machine Intelligence, 9 (1978)
31. G.M. Adelson-Velsky, V. Arlazarov, M. Donskoy, “On the structure of an important class of exhaustive problems and on the ways of search reduction for them”, Advances in Computer Chess, 1 (1977)
32. G. M. Adelson-Velskii, V. P. Arlazarov, M. V. Donskoi, “Metody adaptivnogo poiska”, Mezhdunarodnoe soveschanie po kompleksnomu intellektu. Annotatsii dokladov Mezhdunarodnoi konferentsii po iskusstvennomu intellektu (Repino, 1977), M., 1977, 22 pp.
33. G. M. Adelson-Velskii, A. Futer, “O metode tselenapravlennoi igry dlya sokrascheniya poiska v shakhmatnykh programmakh”, Mezhdunarodnoe soveschanie po kompleksnomu intellektu. Annotatsii dokladov Mezhdunarodnoi konferentsii po iskusstvennomu intellektu (Repino, 1977), M., 1977, 22 pp.
34. On construction and identification of graphs, with contributions of A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld, B. Weisfeiler, Lecture Notes in Math., 558, ed. B. Weisfeiler, Springer-Verlag, Berlin–New York, 1976, xiv+237 pp.  mathscinet  zmath
35. G. M. Adelson-Velskii, E. A. Dinits, A. V. Karzanov, Potokovye algoritmy, Nauka, M., 1975, 119 pp.  mathscinet
36. G. M. Adelson-Velskii, R. Rappoport i dr., “Puti modelirovaniya planirovaniya rabot”, Ekonomika i matematicheskie metody, 11:2 (1975)
37. G.M. Adelson-Velsky, V. Arlazarov, M. Donskoy, “Some Methods of controlling the Tree Search in Chess Programs”, Artificial Intelligence, 1975, no. 6  zmath
38. G.M. Adelson-Velsky, V. Arlazarov, M. Donskoy, “Chess Programming”, Prog. of 4-th Artificial Intelligence Conf., 1975
39. G.M. Adelson-Velsky, V. Arlazarov, M. Donskoy, “On the Structure of an important Class of exhaustive Problems and on the ways of Search Reduction for them”, Prog. of 4-th Artificial Intelligence Conf., 1975
40. G. M. Adelson-Velskii, E. Dinits, N. Emelyanov, M. Furman, “Blok-modul '‘Programmirovanie`’”, Mnogoprotsessornye vychislitelnye sistemy, AN SSSR. M-vo priborostroeniya, sredstv avtomatizatsii i sistem upravleniya SSSR. In-t problem upravlen, eds. V. L. Arlazarov, A. F. Volkov, Nauka, M., 1975, 142 pp.
41. G. M. Adelson-Velskii, A. Volkov i dr., “Vozmozhnosti primeneniya oborudovaniya dlya uluchsheniya effektivnosti programmirovaniya”, Mnogoprotsessornye vychislitelnye sistemy, AN SSSR. M-vo priborostroeniya, sredstv avtomatizatsii i sistem upravleniya SSSR. In-t problem upravlen, eds. V. L. Arlazarov, A. F. Volkov, Nauka, M., 1975, 142 pp.
42. G. M. Adelson-Velskii, V. Arlazarov, “Metody ukrepleniya shakhmatnykh programm”, Problemy kibernetiki, 29, ed. S. V. Yablonskii, Nauka, Glavnaya redaktsiya fiziko-matematicheskoi literatury, M., 1974
43. G.M. Adelson-Velsky, V. Arlazarov, M. Donskoy, “More commentary on the Chichelly Heuristics”, Sigart, 45:6 (1974)
44. G. M. Adelson-Velskii, I.Bernshtein, M. Gerver, “Ob otsenke kolichestva deistvii dlya chastichnogo opredeleniya poryadka v konechnom mnozhestve chisel”, Issledovaniya po diskretnoi matematike, ed. A. A. Fridman, Nauka, M., 1973, 184–189
45. G. M. Adelson-Velskii, V. Titov, “O 4-khromaticheskikh po rebram kubicheskikh grafakh”, Voprosy kibernetiki, Trudy seminara po kombinatornoi matematike, Nauka, Moskva, 1973, 4–14
46. G. M. Adelson-Velskii, “O nekotorykh voprosakh setevogo planirovaniya”, Issledovaniya po diskretnoi matematike, ed. A. A. Fridman, Nauka, M., 1973, 105–134
47. Adelson-Velskii, N. Beketova, “Realizatsiya metoda otsenivaniya oshibok”, Nekotorye problemy obschei i prikladnoi fiziki, 8, Nauka Kazakhstana, 1972, 2–8
48. G. Adelson-Velskii, M. Bernshtein, M. Gerver, Kto poedet v Rio?, Kvant, 1972, no. 8, 2–8
49. G. M. Adelson-Velskii, “Problemy programmnogo obespecheniya dlya avtomaticheskogo upravleniya gidrotekhnicheskogo zdaniya”, Matematicheskie metody v ekonomike, 9, Zinatne, Riga, 1972
50. G. M. Adelson-Velskii, S. Kalinovskaya, V. Voropaev, “Struktura i soderzhanie programmnogo obespecheniya dlya avtomaticheskogo upravleniya”, Trudy akademii selskokhozyaistvennykh nauk Latv. SSR, 1972
51. G. Adelson-Velskii, N. Beketova, Nekotorye problemy obschei i prikladnoi fiziki, Nauka Kazakhstana, 1972
52. G. Adelson-Velskii, S. S. Kalinovskaya, O strukture ekonomicheskikh informatsionnykh sistem, In-t problem upravleniya, M., 1971, 23 pp.
53. G. Adelson-Velskii, S. Kalinovskaya, V. Voropaev, “Obobschennaya set v stroitelnoi industrii: Metody raschetov na obobschennoi setevoi modeli”, Na stroikakh Rossii, 4:5 (1971)
54. G. Adelson-Velskii, N. Beketova, I. Chernysheva, “Puti rascheta obratnoi matritsy k matritse chastnykh proizvodnykh”, Zavodskaya laboratoriya, 1971, no. 1
55. G. M. Adelson-Velskii, I. Razdolskii, M. Strizhevskii, “Optimalnoe upravlenie parametrami potentsiala dlya vzryvoopasnykh predpriyatii”, Trudy Chetvertoi zimnei shkoly po matematicheskomu programmirovaniyu i smezhnym voprosam (25 yanvarya–6 fevralya, g. Drogobych), 1971
56. G. M. Adelson-Velskii, S. Kalinovskaya, V. Voropaev, “Obobschennye seti”, Trudy Chetvertoi zimnei shkoly po matematicheskomu programmirovaniyu i smezhnym voprosam (25 yanvarya–6 fevralya, g. Drogobych), 1971
57. G. Adelson-Velskii, A. Kronrod i dr., Biblioteka B-61 — biblioteka standartnykh programm dlya mashin M-20, v. 1, In-t teoret. i eksperim. fiziki. Matem. laboratoriya, M., 1970
58. G. Adelson-Velskii, S. Kalinovskaya, “Minimalnoe chislo deistvii neobkhodimoe dlya otsenki pozitsii”, Trudy 3-i zimnei ShKOLY po matematicheskomu programmirovaniyu, v. 1, 1970
59. G. Adelson-Velskii, S. Kalinovskaya, “Zadacha o tekhnologiyakh”, Doklad na 29 nauchno-tekhnicheskoi konferentsii MISI im. Kuibysheva, 1970, 5 pp.
60. G. Adelson-Velskii, V. Arlazarov, M. Bongard, S. Lavrov, “Evristicheskoe Programmirovanie”, Trudy 2-i vsesoyuznoi konferentsii po programmirovaniyu, v. 1, 1970
61. G. Adelson-Velskii, V. Arlazarov, “Programmirovaniya igry EVM v shakhmaty”, Trudy 2-i vsesoyuznoi konf po programmirovaniyu, 1970, 5 pp.
62. G. Adelson-Velskii, S. Adelson, “Issledovanie mekhanizma degidrirovaniya izopentana iodom v prisutstvii kisloroda”, DAN SSSR tematicheskaya seriya Khimiya, 192:3 (1970), 3 pp.
63. G. Adelson-Velskii, S. Kalinovskaya, “O strukture ekonomicheskikh informatsionnykh sistem”, Trudy 3-i zimnei ShKOLY po matematicheskomu programmirovaniyu, v. 1, 1970
64. G. Adelson-Velskii, S. Kalinovskaya, “O strukture ekonomicheskoi informatsii”, Matematicheskoe programmirovanie i raschet stroitelnykh konstruktsii, 83 (1970), 3 pp.
65. G. M. Adelson-Velskii, B. Yu. Veisfeiler, A. A. Leman, I. A. Faradzhev, “Ob odnom primere grafa, ne imeyuschego tranzitivnoi gruppy avtomorfizmov”, Dokl. AN SSSR, 185 (1969), 975–976  mathnet  mathscinet  zmath  zmath
66. G. Adelson-Velskii, S. Kalinovskaya, “Opredelenie minimalnoi prodolzhitelnosti proekta pri zadannykh ogranicheniyakh neskladiruemogo resursa”, Trudy 1-i zimnei ShKOLY po matematicheskomu programmirovaniyu, 1969, 4 pp.
67. G. Adelson-Velskii, F.Filler, “O poiske ekstremumov funktsii mnogikh peremennykh”, Trudy 1-i zimnei ShKOLY po matematicheskomu programmirovaniyu, 1969, 4 pp.
68. G. Adelson-Velskii, V. Arlazarov i dr., “O programmirovanii shakhmatnoi igry”, Trudy 1-i zimnei ShKOLY po matematicheskomu programmirovaniyu, 1969, 5 pp.
69. Adelson-Velskii, E. Dymshits i dr., “Informatsionno-logicheskaya model stroitelnoi organizatsii”, Trudy 2-i zimnei ShKOLY po matematicheskomu programmirovaniyu, 1969
70. G. Adelson-Velskii, S. Kalinovskaya, “Setevoe planirovanie pri peremennykh prodolzhitelnostyakh rabot”, Trudy 2-i zimnei ShKOLY po matematicheskomu programmirovaniyu, 1969
71. G. Adelson-Velskii, S. Kalinovskaya, “Sistemy otobrazhenii”, Trudy 2-i zimnei ShKOLY po matematicheskomu programmirovaniyu, 1969, 4 pp.
72. G. Adelson-Velskii, “Shakhmaty — “Drozofila” evristicheskogo programmirovaniya”, Priroda, 1968, no. 2, 75–76
73. G.M. Adelson-Velsky, “Computer-Chess USSR-USA”, Wissenschaft und Technik, 1968, no. 19, 1 pp. (in German)
74. G. M. Adel'son-Vel'skii, P. E. Kunin, A. A. Leman, “One class of adaptive recognition algorithms”, Dokl. Akad. Nauk SSSR, 173:3 (1967), 532–534  mathnet  zmath
75. G. Adelson-Velskii, “Sistemy informatsii dlya opisaniya chastno uporyadochennykh mnozhestv”, Kibernetiku na sluzhbu kommunizmu, Sbornik statei, Nauka, M., 1967, 5 pp.
76. G. Adelson-Velskii, V. Arlazarov i dr., O Shakhmatnykh programmakh ITEF, rukopis, 1967, 8 pp.
77. G. Adelson-Velskii, F. Filler, “Programma vychisleniya setevykh grafikov dlya EVM M-20”, Sbornik algoritmov i programm, Statistika, M., 1967, 8 pp.
78. G. M. Adel'son-Vel'skii, A. A. Leman, “An algorithm for a rapid determination of the pseudo-maxima of a function given on an integer lattice in the case of bounded memory”, Dokl. Akad. Nauk SSSR, 167:4 (1966), 772–774  mathnet
79. G. M. Adel'son-Vel'skii, F. M. Filler, “A program for calculating network charts”, U.S.S.R. Comput. Math. Math. Phys., 5:1 (1965), 206–212  mathnet  crossref  mathscinet  zmath  scopus
80. G. M. Adel'son-Vel'skii, A. L. Brudno, A. S. Kronrod, P. T. Reznikovskii, “A system of commands for a three-address machine without address register”, Dokl. Akad. Nauk SSSR, 154:3 (1964), 545–548  mathnet
81. G. Adelson-Velskii, V. Arlazarov, A. Uskov, “Programma, igrayuschaya v Shakhmaty”, Doklad na mezhdunarodnom simpoziume po verkhnei mantii, 1963, 5 pp.
82. G. Adelson-Velskii, V. Arlazarov, F.Filler, “O poiske ekstremumov funktsii mnogikh peremennykh”, Doklad na mezhdunarodnom simpoziume po verkhnei mantii, 1963, 4 pp.
83. L. L. Goldin, G. M. Adelson-Velskii, A. P. Birzgal, A. D. Piliya, K. A. Ter-\allowbreakMartirosyan, “$\alpha$-raspad nesfericheskikh yader”, ZhETF, 35:1 (1958), 184–202  zmath; L. L. Gol'din, G. M. Adel'son-Vel'skij, A. P. Birzgal, A. D. Piliya, K. A. Ter-Martirosyan, “Alpha decay of nonspherical nuclei”, Soviet Phys. JETP, 8 (1959), 127–139
84. A. S. Kronrod, G. M. Adelson-Velskii, Chislennye raschety kriticheskikh razmerov reaktora, v kn:: A. D. Galanin, Teoriya yadernykh reaktorov na teplovykh neitronakh, Atomizdat, M., 1957, 169–183  zmath
85. D. O. Shklyarskii, G. M. Adelson-Velskii, N. N. Chentsov, A. M. Yaglom, I. M. Yaglom, Izbrannye zadachi i teoremy elementarnoi matematiki, Biblioteka matematicheskogo kruzhka, 1, Gostekhizdat, M., 1950, 296 pp.  zmath
86. G.M. Adelson-Velskii, M. I. Vishik (per.), Veil Andre. Integrirovanie v topologicheskikh gruppakh i ego primeneniya, Per. s fr., ed. N. Ya. Vilenkin, Izd-vo inostr. lit., Obraztsovaya tip. im. Zhdanova, M., 1950, 223 pp.
87. G. M. Adelson-Velskii, “Spektralnyi analiz koltsa ogranichennykh lineinykh operatorov gilbertova prostranstva”, Dokl. AN SSSR, 67 (1949), 957–959  mathscinet  zmath
88. G. M. Adelson-Velskii, Spektralnyi analiz koltsa granichnykh lineinykh operatorov, Diss. … kand. fiz.-matem. nauk, MGU, M., 1948
89. G. M. Adelson-Welsky, A. S. Kronrode, “Sur le principe du maximum pour les solutions d'un système d'équations à dérivées partielles du type elliptique”, Dokl. AN SSSR, 49 (1945), 539–541  mathscinet  zmath
90. G. M. Adelson-Velskii, A. S. Kronrod, “Pryamoe dokazatelstvo analitichnosti monogennoi funktsii”, Dokl. AN SSSR, 50 (1945), 7–9  mathscinet  zmath
91. G. Adelson-Welsky, “Généralisation d'un théorème geométrique de M. Serge Bernstein”, Dokl. AN SSSR, 49 (1945), 391–392  mathscinet  zmath
92. G. M. Adelson-Welsky, A. S. Kronrode, “Sur les lignes de niveau des fonctions continues possédant des dérivées partielles”, Dokl. AN SSSR, 49:4 (1945), 235–237  mathscinet  zmath

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025