Author:
Diallol Mohamadou,Ferreira Afonso,Rau-Chaplin Andrew
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. S. Akl and K. Lyons. Parallel Computational Geometry. Prentice Hall, 1993.
2. M. Atallah and J. Tsay. On the parallel-decomposability of geometric problems. In Proceedings of the 5th Annual ACM Symposium on Computational Geometry, pages 104–113, 1989.
3. R. Cole, M. Goodrich, and C. Dunlaing. Merging free trees in parallel for efficient voronoï diagram construction. In 17th ICALP, England, July 1990.
4. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subrarnonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Fifth ACM SIGPLAN Symposium on the Principles and Practice of Parallel Programming, 1993.
5. F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 27–33, 1995.