H. Thomas, M. T. Cormen, and . Goodrich, A bridging model for parallel computation, communication, and I/O, ACM Computing Surveys, vol.28, issue.4, 1996.

A. Czumaj, P. Kanarek, M. Kutylowski, and K. Lorys, Fast Generation of Random Permutations Via Networks Simulation, Algorithmica, vol.21, issue.1, pp.2-20, 1998.
DOI : 10.1007/PL00009206

F. Dehne, W. Dittrich, and D. Hutchinson, Efficient external memory algorithms by simulating coarsegrained parallel algorithms, ACM Symposium on Parallel Algorithms and Architectures, pp.106-115, 1997.

M. Essaïdi, I. G. Lassous, and J. Gustedt, SSCRAP : An environment for coarse grained algorithms, Fourteenth IASTED International Conference on Parallel and Distributed Computing and Systems, 2002.

I. G. Assefaw-hadish-gebremedhin, J. Lassous, J. A. Gustedt, and . Telle, PRO : a model for parallel resource-optimal computation, 16th Annual International Symposium on High Performance Computing Systems and Applications, pp.106-113, 2002.

T. Michael and . Goodrich, Randomized fully-scalable BSP techniques for multi-searching and convex hull construction, Proceedings of the eighth annual ACM-SIAM Symposium on Discrete Algorithms, pp.767-776, 1997.

I. Guérin, L. , and É. Thierry, Generating random permutations in the framework of parallel coarse grained models, Proceedings of OPODIS'2000, pp.1-16, 2000.

T. Hagerup, Fast parallel generation of random permutations, Automata, Languages and Programming Proceedings of the 18th International Colloquium ICALP'91, pp.405-416, 1991.
DOI : 10.1007/3-540-54233-7_151

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

J. H. Reif, An optimal parallel algorithm for integer sorting, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.496-504, 1985.
DOI : 10.1109/SFCS.1985.9

K. Siegrist, Virtual Laboratories in Probability and Statistics Finite Sampling Models : The Multivariate Hypergeometric Distribution, 2001.

G. Leslie and . Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.

T. Wu, Computation of the multivariate hypergeometric distribution function, Computing Science and Statistics, vol.24, pp.25-28, 1992.

H. Zechner, Efficient sampling from continuous and discrete unimodal distributions, 1994.

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.