, The fth DIMACS implementation challenge, 1995.

M. G. Andrews and D. T. Lee, Parallel algorithms for convex bipartite graphs and related problems, Proc. of Allerton Conference Communication, Control, and Computing, pp.195-204, 1994.

M. Atallah, F. Dehne, R. Miller, A. Rau-chaplin, and J. J. Tsay, Multisearch t e c hniques: parallel data structures on mesh-connected computers, Journal of Parallel and Distributed Computing, vol.20, pp.1-13, 1994.

J. L. Bentley, Decomposable searching problems. Information Processing Letters, vol.8, pp.244-251, 1979.

G. E. Blelloch and J. J. Little, Parallel solutions to geometric problems on the scan model of computation, Proc. International Conference on Parallel Processing, pp.218-222, 1988.

B. Chazelle, Lower bounds for orthogonal range searching, I. The reporting case, Journal of the ACM, vol.37, issue.2, pp.200-212, 1990.

R. Culler, D. Karp, A. Patterson, K. Sahay, E. Hauser et al., LogP: Towards a realistic model of parallel computation, Fifth ACM SIGPLAN Symposium on the Principles and Practice o f P a r allel Programming, pp.1-9

F. Dehne, X. Deng, P. Dymond, and A. A. Khokar, A randomized parallel 3D convex hull algorithm for coarse grained parallel multicomputers, Proc. of the ACM Sympoisum on Parallel Algorithms and Architectures, pp.1-9

F. Dehne, A. Fabri, and C. Kenyon, Scalable and architecture independent parallel geometric algorithms with high probability optimal time, Proc. of the 6 th IEEE Symposium on Parallel and Distributed Processing, pp.1-9

F. Dehne and A. Rau-chaplin, Implementing data structures on a hypercube multiprocessor and applications in parallel computation geometry, Journal of Parallel and Distributed Computing, vol.8, issue.4, pp.367-375, 1989.

X. Deng and N. Gu, Good programming style multiprocessors, Proc. of the 6 th IEEE Symposium on Parallel and Distributed P r ocessing, 1994.

A. Fabri, F. Dehne, and A. Rau-chaplin, Scalable parallel geometric algorithms for coarse grained multicomputers, Proc. of the 9 th ACM Symposium on Computational Geometry, pp.298-307, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00074853

A. Fabri and O. Devillers, Scalable algorithms for bichromatic line segment i n tersection problems on coarse grained multicomputers, Proc. of the 3 th Workshop on Algorithms and Data Structures, 1993.

A. Ferreira, A. Rau-chaplin, and S. Ub-eda, Scalable 2d convex hull and triangulation for coarse grained multicomputers, Proc. of the 6 th IEEE Symposium on Parallel and Distributed P r ocessing, p.1, 1996.

T. Goodrich, Communication-eecient parallel sorting, Proc. of the 28 th annual ACM Symposium on Theory of Computing (STOC)

S. E. Hambausch and A. A. Khokhar, C 3 : A n a r c hitecture-independent model for coarse-grained parallel machines, Proc. of the 6 th IEEE Symposium on Parallel and Distributed P r ocessing, 1994.

H. Li and K. C. Sevick, Parallel sorting by o verpartitioning, Proc. of the ACM Symposium on Parallel Algorithms and Architectures, pp.46-56, 1994.

F. P. Preparata and M. I. Shamos, Range-searching problems, c hapter 3, pages 67{88, 1985.

R. Sridhar, S. Iyegar, and S. Rajanarayanan, Range search in parallel using distributed data structures, Journal of Parallel And Distributed Computing, vol.15, pp.70-74, 1982.

S. Subramanian and R. Ramaswamy, The P-range tree: A new data structure for range searching in secondary memory, I n Proc. of the 6 th annual Symposium On Discrete Algorithms, pp.378-387, 1995.

L. G. Valiant, A bridging model for parallel computation, Communication of ACM, vol.38, pp.103-111, 1990.

L. G. Valiant, General purpose parallel architecture, J. van Leewen, 1990.