. Caceres, Efficient parallel graph algorithms for coarse grained multicomputers and BSP, Automata, Languages and Programming Proceedings of the 24th International Colloquium ICALP'97, pp.390-400, 1997.
DOI : 10.1007/3-540-63165-8_195

. Culler, LogP: Towards a Realistic Model of Parallel Computation, Proceeding of 4-th ACM SIGPLAN Symp. on Principles and Practises of Parallel Programming, pp.1-12, 1993.

. Dehne, 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. Dehne, F. Dehne, and S. W. Song, Randomized parallel list ranking for distributed memory multiprocessors, Concurrency and Parallelism, Programming, Networking, and Security Proceedings of the Asian Computer Science Conference (ASIAN '96), pp.1-10, 1996.
DOI : 10.1007/BF02700044
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.6004

. Karp, . Ramachandran, 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

J. Sibeyn, Better trade-offs for parallel list ranking, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures , SPAA '97, pp.221-230, 1997.
DOI : 10.1145/258492.258514

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

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.