Geodesic
Communication complexity and lower bounds on multilective computations
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 2, pp. 193-212

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1999__33_2_193_0,
     author = {Hromkovi\v{c}, Juraj},
     title = {Communication complexity and lower bounds on multilective computations},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {193--212},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {2},
     year = {1999},
     mrnumber = {1707970},
     zbl = {0946.68052},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1999__33_2_193_0/}
}
TY  - JOUR
AU  - Hromkovič, Juraj
TI  - Communication complexity and lower bounds on multilective computations
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1999
SP  - 193
EP  - 212
VL  - 33
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1999__33_2_193_0/
LA  - en
ID  - ITA_1999__33_2_193_0
ER  - 
%0 Journal Article
%A Hromkovič, Juraj
%T Communication complexity and lower bounds on multilective computations
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1999
%P 193-212
%V 33
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1999__33_2_193_0/
%G en
%F ITA_1999__33_2_193_0
Hromkovič, Juraj. Communication complexity and lower bounds on multilective computations. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 2, pp. 193-212. http://geodesic.mathdoc.fr/item/ITA_1999__33_2_193_0/