Geodesic
Complexity of parallel algorithms and computations
Doklady Akademii Nauk, Tome 265 (1982) no. 2, pp. 268-274.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DAN_1982_265_2_a1,
     author = {M. S. Burgin},
     title = {Complexity of parallel algorithms and computations},
     journal = {Doklady Akademii Nauk},
     pages = {268--274},
     publisher = {mathdoc},
     volume = {265},
     number = {2},
     year = {1982},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1982_265_2_a1/}
}
TY  - JOUR
AU  - M. S. Burgin
TI  - Complexity of parallel algorithms and computations
JO  - Doklady Akademii Nauk
PY  - 1982
SP  - 268
EP  - 274
VL  - 265
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1982_265_2_a1/
LA  - ru
ID  - DAN_1982_265_2_a1
ER  - 
%0 Journal Article
%A M. S. Burgin
%T Complexity of parallel algorithms and computations
%J Doklady Akademii Nauk
%D 1982
%P 268-274
%V 265
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1982_265_2_a1/
%G ru
%F DAN_1982_265_2_a1
M. S. Burgin. Complexity of parallel algorithms and computations. Doklady Akademii Nauk, Tome 265 (1982) no. 2, pp. 268-274. http://geodesic.mathdoc.fr/item/DAN_1982_265_2_a1/