Geodesic
Reconstruction of linear index expressions for reducing programs to a linear class
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 3, pp. 532-544 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1998_38_3_a16,
     author = {D. V. Khmelev},
     title = {Reconstruction of linear index expressions for reducing programs to a linear class},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {532--544},
     year = {1998},
     volume = {38},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_3_a16/}
}
TY  - JOUR
AU  - D. V. Khmelev
TI  - Reconstruction of linear index expressions for reducing programs to a linear class
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1998
SP  - 532
EP  - 544
VL  - 38
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_3_a16/
LA  - ru
ID  - ZVMMF_1998_38_3_a16
ER  - 
%0 Journal Article
%A D. V. Khmelev
%T Reconstruction of linear index expressions for reducing programs to a linear class
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1998
%P 532-544
%V 38
%N 3
%U http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_3_a16/
%G ru
%F ZVMMF_1998_38_3_a16
D. V. Khmelev. Reconstruction of linear index expressions for reducing programs to a linear class. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 3, pp. 532-544. http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_3_a16/

[1] Voevodin V. V., Matematicheskie osnovy parallelnykh vychislenii, Izd-vo MGU, M., 1991

[2] Voevodin V. V., Mathematical foundations of parallel computing, Ser. Computer Sci., 33, World Scient. Publ. Co., Singapur, 1992 | MR | Zbl

[3] Voevodin V. V., “Information structure of sequental programs”, Russ. J. Numer. Analys. and Math. Modelling, 10:3 (1995), 279–286 | DOI | MR | Zbl

[4] Voevodin Vl. V., “Teoriya i praktika issledovaniya parallelizma posledovatelnykh programm”, Programmirovanie, 1992, no. 3, 38–53

[5] Pugh W. A., “Practical algorithm for exact array dependence analysis”, Communs ACM, 35:8 (1992), 102–114 | DOI

[6] Ashmanov S. A., Timokhov A. V., Teoriya optimizatsii v zadachakh i uprazhneniyakh, Fizmatgiz, M., 1991

[7] Minoux M., Programmation matématique, Bordas et C.N.E.T-E.N.S.T., Paris, 1989

[8] Kovalev M. M., Diskretnaya optimizatsiya, Izd-vo BGU, Minsk, 1977 | Zbl

[9] Gofman A. Dzh., Kraskal Dzh. B., “Tselochislennye granichnye tochki vypuklykh mnogogrannikov”, Lineinye neravenstva i smezhnye voprosy, Izd-vo inostr. lit., M., 1959, 325–347

[10] Korbut A. A., Finkelshtein Yu. Yu., Diskretnoe programmirovanie, Nauka, M., 1969 | Zbl

[11] Kheller I., Tompkins Ch. B., “Obobschenie odnoi teoremy Dantsiga”, Lineinye neravenstva i smezhnye voprosy, Izd-vo inostr. lit., M., 1959, 348–351

[12] Knut D., Iskusstvo programmirovaniya dlya EVM, v. 1, Osnovnye algoritmy, Mir, M., 1976