1. D. Aldous, Reversible Markov chains and random walks on graphs, Monograph Draft, version of January 25, 1993, Department of Statistics, University of California, Berkeley, CA (1993).
2. D. Aldous and P. Diaconis, Hammersley’s interacting particle process and longest increasing subsequences, Technical Report, Department of Statistics, U.C. Berkeley, Berkeley, CA (1993).
3. N. Alon, Generating pseudo-random permutations and maximum flow algorithms, Information Processing Letters 35 (1990), pp. 201–204.
4. N. Alon, B. BOLLOBáS, G. Brightwell and S. Janson, Linear extensions of a random partial order, to appear in Ann. Appl. Prob. 3 (1993).
5. R.M. Baer and P. Brock, Natural sorting over permutation spaces, Math. Comp. 22 (1968), pp. 385–510.