Asymptotical Behaviour of the Communication Complexity of One Parallel Algorithm

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.