Finding Coarse Grained Parallelism in Computational Geometry Algorithms

Volodymyr Beletskyy. Finding Coarse Grained Parallelism in Computational Geometry Algorithms. In Vipin Kumar, Marina L. Gavrilova, Chih Jeng Kenneth Tan, Pierre L Ecuyer, editors, Computational Science and Its Applications - ICCSA 2003, International Conference, Montreal, Canada, May 18-21, 2003, Proceedings, Part III. Volume 2669 of Lecture Notes in Computer Science, pages 913-922, Springer, 2003. [doi]

Abstract

Abstract is missing.