Baglivo, J. (1994) Forthcoming Book.
Balmer, D. (1988) Recursive enumeration of r × c tables for exact likelihood evaluation, Applied Statistics
Békéssy A., Békéssy P., Komlós, J. (1972) Asymptotic enumeration of regular matrices, Studia Sci. Math. Hung.
Bender, E. (1974) The asymptotic number of non-negative integer matrices, with given row and column sums, Discrete Math.
Bishop Y., Fienber S., and Holland, P. (1975) Discrete Multivariate Analysis, MIT Press, Cambridge, MA.
Bona, M. (1994) Bounds on the volume of the set of doubly stochastic matrices, Technical Report, Dept. of Mathematics, M.I.T.
Boulton D., and Wallace, C. (1973) Occupancy of a regular array, Computing 16, 57–63.
Chung F., Graham R., and Yau, S. (1994) On sampling in combinatorial structures, unpublished manuscript.
Cormen T., Leiserson C., and Rivest, R. (1990) Introduction to algorithms, McGraw-Hill, New York.
Curtis C., and Reiner, I. (1962) Representation Theory of Finite Groups and Associative Algebras, Wiley Interscience, New York.
Dahmen W., and Micchelli, C. (1988) The number of solutions to linear Diophantine equations and multivariate splines, Trans. Amer. Math. Soc.
Danilov, V. (1978) The geometry of toric varieties, Russian Math. Surveys 33, 97–154.
Diaconis P., and Efron, B. (1985) Testing for independence in a two-way table: new interpretations of the chi-square statistic (with discussion), Ann. Statist. 13, 845–913.
Diaconis, P. (1988) Group representations in probability and statistics, IMS Lecture Notes-Monograph Series, II. Institute of Mathematical Statistics, Hayward, CA.
Diaconis, P. (1989) Spectral analysis for ranked data, Ann. Statist. 17, 781–809.
Diaconis P., McGrath M., and Pitman, J. (1993) Descents and random permutations, to appear, Combinatorica.
Diaconis P., and Saloff-Coste, L. (1993) Nash inequalities for Markov chains, Technical Report, Dept. of Statistics, Harvard University.
Diaconis P., and Sturmfels, B. (1993) Algebraic algorithms for sampling from conditional distributions, Technical Report, Dept. of Statistics, Stanford University.
Dyer A., and Frieze, A. (1991) Computing the volume of convex bodies: a case where randomness provably helps, in B. Bollobás, Probabilistic Combinatorics and Its Applications, Amer. Math. Soc, Providence, RI.
Dyer M., Kannan R., and Mount, J. (1994) Unpublished manuscript.
Everett C., and Stein, P. (1971) The asymptotic number of integer stochastic matrices, Discrete Math.
Fisher, R.A. (1935) The Design of Experiments, Oliver and Boyd, London.
Foulkes, H. (1976) Enumeration of permutations with prescribed up-down and inversion sequences, Discrete Math.
Foulkes, H. (1980) Eulerian numbers, Newcomb’s problem and representations of symmetric groups, Discrete Math.
Fulton, W. (1993) Introduction to Toric Varieties, Princeton University Press, Princeton, NJ.
Gail M., and Mantel, N. (1977) Counting the number of r × c contingency tables with fixed margine, Jour. Amer. Statist. Assoc.
Gangolli, A. (1991) Convergence bounds for Markov chains and applications to sampling, Ph.D. Thesis, Computer Science Dept., Stanford University.
Garey M., and Johnson, D. (1979) Computers and Intractability, Freeman, San Francisco.
Garsia, A. (1990) Combinatorics of the free Lie algebra and the symmetric group, Analysis and etc. (P.H. Rabinowitz and E. Zehnder, eds.), pp. 309–382. Academic Press, Boston.
Garsia A., and Reutenauer, C. (1989) A decomposition of Soloman’s descent algebra, Adv. Math.
Gessel, I. (1990) Symmetric functions and P-recursiveness, Jour. Comb. Th.
A 53, 257–285.
Gessel I., and Reutenauer, C. (1993) Counting permutations with given cycle structure and descent set, Jour. Comb. Th.
A 56, 189–215.
Good, I.J. (1976) On the application of symmetric Dirichlet distributions and their mixtures to contingency tables, Ann. Statist.
Good, I.J., and Crook, J. (1977) The enumeration of arrays and a generalization related to contingency tables, Discrete Math.
Goulden I., Jackson, D. and Reilly, J. (1983) The Hammond series of a symmetric function and its application to P- recursiveness, SIAM Jour., Alg. Discrete Methods
Gusfield, D. (1988) A graph-theoretic approach to statistical data security, SIAM Jour. Comp. 17, 552–57
Hancock, J. (1974) Remark on Algorithm 434, Communications of the ACM 18, 117–119.
Humphreys, J. (1990) Reflection Groups and Coxeter Groups, Cambridge University Press, Cambridge.
Irving R., and Jerrum, M. (1990) 3-D statistical data security problems, Technical Report, Dept. of Computing Science, University of Glasgow.
Jackson D., and Van Rees (1975) The enumeration of generalized double stochastic non-negative integer square matrices, SIAM Jour. Comp.
James, G.D., and Kerber, A. (1981) The representation theory of the symmetric group, Addison-Wesley, Reading, MA.
Jerrum M., and Sinclair, A. (1989) Approximating the permanent, SIAM Jour. Comp.
Jerrum M., Valiant L., and Vazirani, V. (1986) Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science
Jia, R. (1994) Symmetric magic squares and multivariate splines, Technical Report, Dept. of Mathematics, University of Alberta.
Kerov, S.V., Kirillov, A.N., and Reshetikin, N.Y. (1986) Combinatorics, Bethe Ansatz, and representations of the symmetric group, translated from: Zapiski Mauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V.A. Steklova An SSSR
Knuth, D. (1970) Permutations, matrices, and generalized Young tableaux, Pacific Jour.
Knuth, D. (1973) The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA.
Lovasz L., and Simonovits, M. (1990). The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume. Preprint 27, Hung. Acad. Sci.
MacMahon, P. (1916) Combinatorial Analysis, Cambridge University Press, Cambridge.
Macdonald, J. (1979) Symmetric Functions and Hall Polynomial, Clarendon, Press, Oxford.
Mann, B. (1994) Unpublished manuscript.
March, D. (1972) Exact probabilities for r×c contingency tables, Communications of the ACM
Mehta, C, and Patel, N. (1983) A network algorithm for performing Fisher’s exact test in r × c contingency tables, Jour. Artier. Statist. Assoc.
Mehta, C, and Patel, N. (1992) Statexact.
Mount, J. (1994) Ph.D. Thesis, Dept. of Computer Science, Carnegie Mellon University.
O’Neil, P. (1969) Asymptotics and random matrices with row-sum and column-sum restrictions, Bull. Amer. Math. Soc.
Pagano M., and Taylor-Halvorsen, K. (1981) iAn algorithm for finding the exact significance levels of r c contingency tables, Jour. Amer. Statist. Assoc.
Sinclair, A. (1993) Algorithms for random generalization and counting: a Markov chain approach, Birkhäuser, Boston.
Sinclair A., and Jerrum, M. (1989) Approximate counting, uniform generation and rapidly mixing Markov chains, Information and Computation
Snee, R. (1974) Graphical display of two-way contingency tables, Amer. Statistician
Soloman, L. (1976) A Mackey formula in the group ring of a Coxeter group, J. Alg. 41, 255–26
Stanley, R. (1973) Linear homogeneous Diophantine equations and magic labelings of graphs, Duke Math. Jour.
Stanley, R. (1986) Enumerative Combinatorics, Wadsworth, Monterey, CA.
Stein, M.L., and Stein, P. (1970) Enumeration of stochastic matrices with integer elements, Los Alamos Scientific Laboratory Report, LA-4434.
Valiant, L. (1979) The complexity of computing the permanent, Theoretical Computer Sci. vn8, 189–201.