A. G. Alexandrakis, A. V. Gerbessiotis, D. S. Lecomber, and C. J. Siniolakis, Bandwidth, space and computation efficient PRAM programming: The BSP approach, Proceedings of the SUP'EUR '96

A. Bar-noy and S. Kipnis, Designing broadcasting algorithms in the Postal Model for message passing systems, The 4th annual ACM symposium on parallel algorithms and architectures, pp.13-22, 1992.

R. P. Brent, The Parallel Evaluation of General Arithmetic Expressions, Journal of the ACM, vol.21, issue.2, pp.201-206, 1974.
DOI : 10.1145/321812.321815

E. Caceres, F. Dehne, A. Ferreira, P. Locchini, I. Rieping et al., Efficient parallel graph algorithms for coarse grained multicomputers and BSP, The 24th International Colloquium on Automata Languages and Programming, pp.390-400, 1997.
DOI : 10.1007/3-540-63165-8_195

D. E. Culler, R. M. Karp, D. A. Patterson, A. Sahay, K. E. Schauser et al., LogP:towards a realistic model of parallel computation, 4th ACM SIGPLAN Symposium on principles and practice of parallel programming, 1993.

F. Dehne, Coarse grained parallel algorithms Algorithmica Special Issue onCoarse grained parallel algorithms, pp.173-176, 1999.

F. Dehne, A. Fabri, and A. Rau-chaplin, SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS, International Journal of Computational Geometry & Applications, vol.06, issue.03, pp.379-400, 1996.
DOI : 10.1142/S0218195996000241

S. Fortune and J. Wyllie, Parallelism in random access machines, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.114-118, 1978.
DOI : 10.1145/800133.804339

A. H. Gebremedhin, I. Guérin-lassous, J. Gustedt, and J. A. Telle, Graph coloring on a coarse grained multiprocessor, LNCS, pp.184-195, 1928.
URL : https://hal.archives-ouvertes.fr/inria-00099384

A. V. Gerbessiotis, D. S. Lecomber, C. J. Siniolakis, and K. R. Sujithan, PRAM programming: theory vs. practice, Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing, PDP '98 -, 1998.
DOI : 10.1109/EMPDP.1998.647194
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.6893

A. V. Gerbessiotis and C. J. Siniolakis, A new randomized sorting algorithm on the BSP model, 2001.

A. V. Gerbessiotis and L. G. Valiant, Direct Bulk-Synchronous Parallel Algorithms, Journal of Parallel and Distributed Computing, vol.22, issue.2, pp.251-267, 1994.
DOI : 10.1006/jpdc.1994.1085
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.9332

P. B. Gibbons, Y. Matias, and V. Ramachandran, Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation? Theory of Computing Systems, 1999.

R. Greenlaw, H. J. Hoover, and W. L. Ruzzo, Limits to Parallel Computation: P-Completeness Theory, Madison Anv, 1995.

I. Guérin-lassous, J. Gustedt, and M. Morvan, Handling graphs according to a coarse grained approach: Experiments with MPI and PVM, Recent Advances in Parallel Virtual Machine and Message Passing Interface, 7th European PVM/MPI Users' Group Meeting, pp.72-79, 1908.

K. Hawick, High performance computing and communications glossary. see http

J. Jájá, An Introduction to Parallel Algorithms, 1992.

J. F. Jájá and K. W. Ryu, The block distributed memory model, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.8, pp.830-840, 1996.
DOI : 10.1109/71.532114

R. M. Karp and V. Ramachandran, Parallel Algorithms for Shared-Memory Machines, Algorithms and Complexity, vol.A, pp.869-941, 1990.
DOI : 10.1016/B978-0-444-88071-0.50022-9

C. P. Kruskal, L. Rudolph, and M. Snir, A complexity theory of efficient parallel algorithms, Theoretical Computer Science, vol.71, issue.1, pp.95-132, 1990.
DOI : 10.1016/0304-3975(90)90192-K

B. M. Maggs, L. R. Matheson, and R. E. Tarjan, Models of parallel computation: a survey and synthesis, Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences, pp.61-70, 1995.
DOI : 10.1109/HICSS.1995.375476

L. G. Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.
DOI : 10.1145/79173.79181

J. S. Vitter and R. A. Simons, New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P, IEEE Transactions on Computers, vol.35, issue.5, pp.35403-418, 1986.
DOI : 10.1109/TC.1986.1676783

I. Unité-de-recherche, . Lorraine, V. Technopôle-de-nancy-brabois, I. Unité-de-recherche, and . Rennes, Campus scientifique, 615 rue du Jardin Botanique Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, p.78153, 2004.