Pavol Purcz. Asymptotical Behaviour of the Communication Complexity of One Parallel Algorithm. In Roman Wyrzykowski, Jack Dongarra, Marcin Paprzycki, Jerzy Wasniewski, editors, Parallel Processing and Applied Mathematics, 5th International Conference, PPAM 2003, Czestochowa, Poland, September 7-10, 2003. Revised Papers. Volume 3019 of Lecture Notes in Computer Science, pages 201-206, Springer, 2003. [doi]
@inproceedings{Purcz03,
title = {Asymptotical Behaviour of the Communication Complexity of One Parallel Algorithm},
author = {Pavol Purcz},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3019&spage=201},
researchr = {https://researchr.org/publication/Purcz03},
cites = {0},
citedby = {0},
pages = {201-206},
booktitle = {Parallel Processing and Applied Mathematics, 5th International Conference, PPAM 2003, Czestochowa, Poland, September 7-10, 2003. Revised Papers},
editor = {Roman Wyrzykowski and Jack Dongarra and Marcin Paprzycki and Jerzy Wasniewski},
volume = {3019},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-21946-3},
}