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

M. Essa¨?diessa¨?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

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

J. Gustedt, Randomized permutations in a coarse grained parallel environment, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '03, 2002.
DOI : 10.1145/777412.777454
URL : https://hal.archives-ouvertes.fr/inria-00107672

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

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.

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