EXACT-STATS BIBLIOGRAPHY PART B: ALGORITHMS 1-SEP-96, Compiled by Patrick Onghena, Katholieke Universiteit Leuven (Belgium), based on the advice from subscribers to the EXACT-STATS list. The current version of this part of the bibliography can be obtained by sending the following 1-line (no headers or footers) e-mail message : to: mailbase@mailbase.ac.uk message: send exact-stats biblioalg.txt You can also access this file, and other exact-stats files, via World Wide Web or via anonymous FTP. The URL is: http://www.mailbase.ac.uk/lists-a-e/exact-stats/files/biblioalg.txt The FTP site is ftp.mailbase.ac.uk Send questions, advice, or corrections to Patrick Onghena directly: Patrick.Onghena@ped.kuleuven.ac.be =========================================================================== The exact-stats bibliography is organised in four sections and corresponding files. The first section is in the file BIBLIOGEN.TXT and contains the core references on concepts and designs, the second section is in the file BIBLIOALG.TXT and contains references to algorithms, software announcements and software reviews, the third section is in the file BIBLIOPRE.TXT and contains references to preprints and recent publications (1994-1996), and the last section is in the file BIBLIOCOM.TXT and contains a comprehensive listing of publications on exact tests and related topics. The sections A and C are subdivided in books versus articles. A. CONCEPTS AND DESIGNS A1. BOOKS A2. ARTICLES B. ALGORITHMS C. PREPRINTS AND RECENT PUBLICATIONS C1. BOOKS C2. ARTICLES D. COMPREHENSIVE LISTING [Some references are followed by a code between square brackets giving the main characteristics and technical level of the text, using the following key:] Main characteristics A = good Advocacy I = accessible Introduction R = serves as a Reference work E = useful Examples S = link to accessible usable Software Technical Level T0 = Little statistical training required T1 = Undergraduate statistics T2 = Graduate statistics T3 = Advanced, current research {Annotations and keywords are given between braces} =========================================================================== Abramson, M., & Moser, W. J. (1973). Arrays with fixed row and column sums. _Discrete Mathematics, 6_, 1-14. Agresti, A. (1992). A survey of exact inference for contingency tables (with discussion). _Statistical Science, 7_, 131-172. Agresti, A., Mehta, C. R., & Patel, N. R. (1990). Exact inference for contingency tables with ordered categories. _Journal of the American Statistical Association, 85_, 453-458. Agresti, A., & Wackerly, D. (1977). Some exact conditional tests of independence for R x C cross-classification tables. _Psychometrika, 42_, 111-126. Akl, S. G. (1981). A comparison of combination generation methods. _Association for Computing Machinery Transactions on Mathematical Software, 7_, 42-45. Amana, I. A., & Koch, G. G. (1980). A macro for multivariate randomization analysis of stratified sample data. _SAS SUGI, 5_, 134-144. Arbuckle, J., & Astler, L. S. (1975). A program for Pitman's permutation test for differences in location. _Behavior Research Methods and Instrumentation, 7_, 381. Baglivo, J., Olivier, D., & Pagano, M. (1988). Methods for the analysis of contingency tables with large and small cell counts. _Journal of the American Statistical Association, 83_, 1006-1013. Baglivo, J., Olivier, D., & Pagano, M. (1992). Methods for exact goodness- of-fit tests. _Journal of the American Statistical Association, 87_, 464-469. Baker, F. B., & Collier, R. O. (1961). Analysis of experimental designs by means of randomization: A Univac 1103 program. _Behavioral Science, 6_, 369-369. Baker, R. D. (1995). Appendix: Modern permutation test software. In E. S. Edgington, _Randomization tests_ (3rd ed.) (pp. 391-401). New York, NY: Marcel Dekker. Baker, R. D., & Tilbury, J. B. (1993). Algorithm AS 283: Rapid computation of the permutation paired and grouped t-tests. _Applied Statistics, 42_, 432-441. Baker, R. J. (1977). Exact distributions derived from two-way tables. _Applied Statistics, 26_, 199-206. Balmer, D. W. (1988). Algorithm AS 236: Recursive enumeration of r x c tables for exact likelihood evaluation. _Applied Statistics, 37_, 290-301. Bebbington, A. C. (1975). A simple method of drawing a sample without replacement. _Applied Statistics, 24_, 136. Bernard, A., & Van Efferen, P. (1953). A generalization of the method of m rankings. _Proceedings of the Koninklijke Nederlandse Akademie der Wetenschappen, A56_. Berry, J. J. (1993). A PROC IML program to obtain exact significance levels in the nonparametric two-independent-samples location problem. _Observations: The Technical Journal for SAS Software Users, 3(1)_, 51-56. Berry, J. J. (1995). A simulation-based approach to some nonparametric statistics problems. _Observations: The Technical Journal for SAS Software Users, 4(2)_, 19-26. Berry, J. J. (1995). Obtaining exact significance levels for various nonparametric two-independent-samples location problems. _Observations: The Technical Journal for SAS Software Users, 4(4)_, 40-52. Berry, K. J. (1982). Algorithm AS 179: Enumeration of all permutations of multi-sets with fixed repetition numbers. _Applied Statistics, 31_. Berry, K. J., & Mielke, P. W. (1984). Computation of exact probability values for multiresponse permutation procedures (MRPP). _Communications in Statistics: Simulation and Computation, 13_, 417-432. Berry, K. J., & Mielke, P. W. (1985a). Computation of exact and approximate probability values for a matched-pairs permutation test. _Communications in Statistics: Simulation and Computation, 14_, 229-248. Berry, K. J., Mielke, P. W., & Wary, R. K. W. (1986). Approximate MRPP p-values obtained from four exact moments. _Communications in Statistics: Simulation and Computation, 15_, 581-589. Besag, J., & Clifford, P. (1991). Sequential Monte Carlo p-values. _Biometrika, 78_, 301-304. Bissell, A. F. (1986). Ordered random selection without replacement. _Applied Statistics, 35_. Bitner, J. R., Ehrlich, G., & Rheingold, E. (1976). Efficient generation of the reflected Gray Code and its applications. _Communications of the Association for Computing Machinery, 19_, 517-521. Booth, J. G., & Butler, R. W. (1990). Randomization distributions and saddlepoint approximations in generalized linear models. _Biometrika, 77_, 787-796. Boothroyd, J. (1964). Algorithm 246: Gray code. _Communications of the Association for Computing Machinery, 7_, 701. Boothroyd, J. (1967). Algorithm 29: Permutation of the elements of a vector. _The Computer Journal, 60_, 311. Boswell, M. T., Gore, S. D., Patel, G. P., & Taillie, C. (1993). The art of computer generation of random variables. In C. R. Rao (Ed.), _Handbook of statistics, Vol. 9: Computational statistics_. Amsterdam: North Holland. Boulton, D. M. (1974). Remarks on Algorithm 434. _Communications of the Association for Computing Machinery, 17_, 326. Boyett, J. M. (1979). Algorithm AS 144: Random R x C tables with given row and column totals. _Applied Statistics, 28_. Bratley, P. (1967). Algorithm 306: Permutations with repetitions. _Communications of the Association for Computing Machinery, 10_, 450-451. Chase, P. J. (1970a). Algorithm 382: Combinations of M out of N objects. _Communications of the Association for Computing Machinery, 13_, 368. Chase, P. J. (1970b). Algorithm 383: Permutations of a set with repetitions. _Communications of the Association for Computing Machinery, 13_. Chen, R. S., & Dunlap, W. P. (1993). SAS procedures for approximate randomization tests. _Behavior Research Methods, Instruments, & Computers, 25_, 406-409. Chung, J. H., & Fraser, D. A. S. (1958). Randomization tests for a multivariate two-sample problem. _Journal of the American Statistical Association, 53_, 729-735. Cox, M. A. A., & Plackett, R. L. (1980). Small samples in contingency tables. _Biometrika, 67_, 1-13. D'Abadie, C., & Proschan, F. (1984). Stochastic versions of rearrangement inequalities. In Y. L. Tong (Ed.), _Inequalities in statistics and probability_ (pp. 4-12). Hayward, CA: Institute of Mathematical Statistics. Dallal, G. E. (1988). PITMAN: A Fortran program for exact randomization tests. _Computers and Biomedical Research, 21_, 9-15. Daniels, H. E. (1955). Discussion of a paper by G. E. P. Box and S. L. Anderson. _Journal of the Royal Statistical Society Series B, 17_, 27-28. Daniels, H. E. (1958). Discussion of paper by D. R. Cox. _Journal of the Royal Statistical Society Series B, 20_, 236-238. Davison, A. C., & Hinkley, D. V. (1988). Saddlepoint approximations in randomization methods. _Biometrika, 75_, 417-431. De Cani, J. (1979). An algorithm for bounding tail probabilities for two- variable exact tests. _Randomization, 2_, 23-24. Dershowitz, N. (1975). A simplified loop-free algorithm for generating permutations. _BIT, 15_, 158-164. Durstenfield, R. (1964). Random permutations. _Communications of the Association for Computing Machinery, 7_, 420. Dwass, M. (1957). Modified randomization tests for non-parametric hypotheses. _Annals of Mathematical Statistics, 28_, 181-187. Edgington, E. S. (1995). _Randomization tests_ (3rd ed.). New York: Marcel Dekker. Edgington, E. S., & Strain, A. R. (1973). Randomization tests, computer time requirements. _Journal of Psychology, 85_, 89-95. Edgington, E. S., & Strain, A. R. (1976). A computer program for randomization tests for predicted trends. _Behavior Research Methods and Instrumentation, 8_, 470. Ehrlich, G. (1973). Algorithm 466: Four combinatorial algorithms. _Communications of the Association for Computing Machinery, 16_, 690-691. Fan, C. T., Muller, M. E. & Rezucha, I. (1962). Development of sampling plans by using sequential (item by item) selection technigues and digital computers. _Journal of the American Statistical Association, 57_, 387-402. Feldman, S. E., & Kluger, E. (1963). Shortcut calculations to Fisher-Yates "exact tests". _Psychometrika, 2_, 289-291. Ferron, J., & Ware, W. (1994). Using randomization tests with responsive single-case designs. _Behaviour Research and Therapy, 32_, 787-791. Fike, C. T. (1975). A permutation generation method. _The Computer Journal, 18_, 21-22. Fleishman, A. I. (1977). A program for calculating the exact probabilities along with explorations of m by n contingency tables. _Educational and Psychological Measurement, 33_, 798-803. Foster, G. A. (1995). The randomization test applied to the means of two independent samples. _Observations: The Technical Journal for SAS Software Users, 4(3)_, 51-62. Gabriel, K. R., & Hall, W. J. (1983). Rerandomization inference on regression and shift effects: Computationally feasible methods. _Journal of the American Statistical Association, 78_, 827-836. Gail, M., & Mantel, N. (1977). Counting the number of r x c contingency tables with fixed marginals. _Journal of the American Statistical Association, 72_, 859-862. Gentleman, J. F. (1975). Algorithm AS 88: Generation of all nCr combinations by simulating nested Fortran DO loops. _Applied Statistics, 24_, 374-376. Goetgheluck, P. (1987). Computing binomial coefficients. _American Mathematical Monthly, 94_, 360-365. Good, P. (1991). Most powerful tests for use in matched pair experiments when data may be censored. _Journal of Statistical Computation and Simulation, 38_, 57-63. Goodall, D. W. (1968). Contingency tables and computers. _Praximetric, 9_, 113-119. Graves, G. W., Whinston, & Whinston, A. B. (1970). An algorithm for the quadratic assignment probability. _Management Science, 17_, 453- 471. Green, B. F. (1977). A practical interactive program for randomization tests of location. _The American Statistician, 31_, 37-39. Gregory, R. J. (1973). A Fortran computer program for the Fisher exact probability test. _Educational and Psychological Measurement, 33_, 697-700. Hancock, T. W. (1974). Remark on algorithm 434. _Communications of the Association for Computing Machinery, 18_, 117-119. Hayes, A. F. (1996). PERMUSTAT: A Macintosh program for approximate randomization tests. _Behavior Research Methods, Instruments, & Computers, 28_. Hayes, J. E. (1975). Fortran program for Fisher's exact test. _Behavior Research Methods and Instrumentation, 7_, 481. Hilton, J. F., & Mehta, C. R. (1993). Power and sample size calculations for exact conditional tests with ordered categorical data. _Biometrics, 49_, 609-616. Hilton, J. F., Mehta C. R., & Patel, N. R. (1994). Exact Smirnov p values using a network algorithm. _Computational Statistics and Data Analysis, 17_, 351-361. Hirji, K. F., Mehta, C. R., & Patel, N. R. (1987). Computing distributions for exact logistic regression. _Journal of the American Statistical Association, 82_, 1110-1117. Hirji, K. F., Mehta, C. R., & Patel, N. R. (1988). Exact inference for matched case-control studies. _Biometrics, 44_, 803-814. Hollander, M., & Pena E. (1988). Nonparametric tests under restricted treatment assigment rules. _Journal of the American Statistical Association, 83_, 1144-1151. Howell, D. C., & Gordon, L. R. (1976). Computing the exact probability of an r by c contingency table with fixed marginal totals. _Behavior Research Methods and Instrumentation, 8_, 317. Hubert, L. J., & Schultz, J. (1975). Maximum likelihood paired comparison ranking and quadratic assessment. _Biometrika, 62_, 655-660. Hull, I. D., & Peto, R. (1971). Algorithm AS 35: Probabilities derived from finite populations. Applied Statistics, 20_, 99-105. Ives, F. M. (1976). Permutation enumeration: four new permutation algorithms. _Communications of the Association for Computing Machinery, 19_, 68-70. Joe, H. (1985). An ordering of dependence for contingency tables. _Linear Algebra and its Applications, 70_, 89-103. Joe, H. (1988). Extreme probabilities for contingency tables under row and column independence with applications to Fisher's exact test. Communications in Statistics: Theory and Methods, 17_, 3677-3685. Knott, G. D. (1976). A numbering system for permutations of combinations. Communications of the Association for Computing Machinery, 19_, 355-356. Knuth, D. E. (1973). _The art of computer programming, Vol. 2: Semi- numerical algorithms_. Reading, MA: Addison-Wesley. Kreiner, S. (1987). Analysis of multidimensional contingency tables by exact conditional frequencies: Techniques and strategies. Scandinavian Journal of Statistics, 14_, 97-112. Kurtzburg, J. (1962). Algorithm 94: Combination. _Communications of the Association for Computing Machinery, 5_, 344. Lam, C. W. H., & Sotchen, L. H. (1982). Three new combination algorithms with the minimal-change property. _Communications of the Association for Computing Machinery, 25_, 555-559. Leslie, P. H. (1955). A method of calculating the exact probabilities in 2 x 2 contingency tables with small marginal totals. _Biometrika, 42_, 522-523. Liu, C. H., & Tang, D. T. (1973). Algorithm 452: Enumerating combinations of m out of n objects. _Communications of the Association for Computing Machinery, 16_, 485. Lock, R. H. (1991). A sequential approximation to a permutation test. Communications in Statistics: Simulation and Computation, 20_, 341-363. Mackenzie, G., & O'Flaherty, M. (1982). Direct simulation of nested Fortran DO loops. _Applied Statistics, 31_, 71-74. Manly, B. F. J. (1991). _Randomization and Monte Carlo methods in biology_. London: Chapman & Hall. March, D. L. (1972). Exact probabilities for R x C contingency tables. _Communications of the Association for Computing Machinery, 15_, 991-992. Marriott, F. H. C. (1979). Barnard's Monte Carlo tests: How many simulations? _Applied Statistics, 28_, 75-77. Marsh, N. W. A. (1987). Efficient generation of all binary patterns by Gray Code. _Applied Statistics, 36_, 245-249. Mehta, C. R. (1992). An interdisciplinary approach to exact inference for contingency tables. _Statistical Science, 7_, 167-170. Mehta, C. R., & Patel, N. R. (1980). A network algorithm for the exact treatment of the 2 x K contingency table. _Communications in Statistics: Simulation and Computation, 9_, 649-664. Mehta, C. R., & Patel, N. R. (1983). A network algorithm for performing Fisher's exact test in r x c contingency tables. _Journal of the American Statistical Association, 78_, 427-434. Mehta, C. R., & Patel, N. R. (1986). A hybrid algorithm for Fisher's exact test in unordered r x c contingency tables. Communications in Statistics: Theory and Methods, 15_, 387-403. Mehta, C. R., & Patel, N. R. (1986). FEXACT: A Fortran subroutine for Fisher's exact test on unordered r x c contingency tables. Association for Computing Machinery Transactions on Mathematical Software, 12_, 154-161. Mehta, C. R., Patel, N. R., & Gray, R. (1985). On computing an exact confidence interval for the common odds ratio in several 2 x 2 contingency tables. _Journal of the American Statistical Association, 80_, 969-973. Mehta, C. R., Patel, N. R., & Senchaudhuri, P. (1988). Importance sampling for estimating exact probabilities in permutational inference. _Journal of the American Statistical Association, 83_, 999-1005. Mehta, C. R., Patel, N. R., & Senchaudhuri, P. (1992). Exact stratified linear rank tests for ordered categorical and binary data. _Journal of Computational and Graphical Statistics, 1_, 21-40. Mehta, C. R., Patel, N. R., Senchaudhuri, P., & Tsiatis, A. A. (1994). Exact permutational tests for group sequential clinical trials. _Biometrics, 50_, 1042-1053. Mehta, C. R., Patel, N. R., & Tsiatis, A. A. (1984). Exact significance testing to establish treatment equivalence for ordered categorical data. _Biometrics, 40_, 819-825. Mehta, C. R., Patel, N. R., & Wei L. J.(1988). Computing exact permutational distributions with restricted randomization designs. _Biometrika, 75_, 295-302. Mielke, P. W., & Berry, K. J. (1985). Non-asymptotic inferences based on the chi-square statistic for r x c contingency tables. _Journal of Statistical Planning and Inference, 12_, 41-45. Mielke, P. W., Jr., & Berry, K. J. (1993). Exact goodness-of-fit probability tests for analyzing categorical data. _Educational and Psychological Measurement, 53_, 707-710. Minc, H. (1971). Rearrangements. _Transactions of the American Mathematical Society, 159_, 497-504. Nelson, D. E., & Zerbe, G. O. (1988). A SAS/IML program to execute randomization of response curves with multiple comparisons. _The American Statistician, 42_, 231. Nicholson, T. A. J. (1971). A method for optimizing permutation probabilities and its industrial applications. In P. J. A. Welsh (Ed.), _Combinatorial mathematics and its applications_ (pp. 201- 217. New York: Academic Press. Nigam, A. K., & Gupta, V. K. (1984). A method of sampling with equal or unequal probabilities without replacement. _Applied Statistics, 33_. Nijenhuis, A., & Wilf, H. S. (1978). _Combinatorial algorithms_. New York: Academic Press. Noreen, E. (1989). _Computer-intensive methods for testing hypotheses_. New York: Wiley. Onghena, P. (1993). A theoretical and empirical comparison of mainframe, microcomputer, and pocket calculator pseudorandom number generators. _Behavior Research Methods, Instruments, & Computers, 25_, 384-395. Onghena, P., & Edgington, E. S. (1994). Randomization tests for restricted alternating treatments designs. _Behaviour Research and Therapy, 32_, 783-786. Onghena, P., & May, R. B. (1995). Pitfalls in computing and interpreting randomization test p-values: A commentary on Chen & Dunlap. _Behavior Research Methods, Instruments, & Computers, 27_, 408-411. Onghena, P., & Van Damme, G. (1994). SCRT 1.1: Single Case Randomization Tests. _Behavior Research Methods, Instruments, & Computers, 26_, 369. Ord-Smith, R. J. (1970). Generation of permutation sequences, part 1. _The Computer Journal, 13_, 152-155. Ord-Smith, R. J. (1971). Generation of permutation sequences, part 2. _The Computer Journal, 14_, 136-139. Pagano, M., & Halvorsen, K. (1981). An algorithm for finding the exact significance levels of r x c contingency tables. _Journal of the American Statistical Association, 76_. Pagano, M., & Tritchler, D. (1983). On obtaining permutation distributions in polynomial time. _Journal of the American Statistical Association, 78_, 435-441. Page, E. S. (1967). Note on generating random parameters. _Applied Statistics, 16_, 273-274. Page, E. S., & Wilson, L. B. (1979). _An introduction to combinatorial combinations_. Cambridge, UK: Cambridge University Press. Patefield, W. M. (1981). Algorithm AS 159: An efficient method of generating r x c tables with given row and column totals. _Applied Statistics, 30_, 91-97. Payne, W. H., & Ives, F. M. (1979). Combination generators. _Association for Computing Machinery Transactions on Mathematical Software, 5_, 163-172. Peladeau, N., & Lacouture, Y. (1993). SIMSTAT: Bootstrap computer simulation and statistical program for IBM personal computers. _Behavior Research Methods, Instruments, & Computers, 25_, 410-413. Plackett, R. L. (1968). Random permutations. _Journal of the Royal Statistical Society Series B, 30_, 517-534. Rabinowitz, & Berenson, M. L. (1974). A comparison of various methods of obtaining random order statistics for Monte Carlo computations. _The American Statistician, 28_, 27-29. Radlow, R., & Alf, E. F. (1975). An alternate marginal assessment of the accuracy of the chi-square test of goodness of fit. _Journal of the American Statistical Association, 70_, 811-813. Ray, W. (1966). Logic for a rank test. _Behavioral Science, 11_, 405. Robertson, W. H. (1960). Programming Fisher's exact method of comparing two percentages. _Technometrics, 2_, 103-107. Robinson, J. (1982). Saddlepoint approximations to permutation tests and confidence intervals. _Journal of the Royal Statistical Society Series B, 44_, 91-101. Rogers, M. S. (1964). A Philco 2000 program to exhibit distinguishably different permutations. _Behavioral Science, 9_, 289-299. Rohl, J. S. (1978). Generating permutations by choosing. _The Computer Journal, 21_, 302-305. Romesburg, H. C. (1985). Exploring, confirming, and randomization tests. _Computers and Geosciences, 11_, 19-37. Romesburg, H. C, Marshall, R., & Mauk, T. P. (1981). FITEST: A computer program for "exact chi-square" goodness of fit tests. Computers and Geosciences, 7_, 457-458. Roy, M. K. (1978). Evaluation of permutation algorithms. _The Computer Journal, 21_, 296-301. Sag, T. W. (1964). Algorithm 242: Permutation with a set of repetitions. _Communications of the Association for Computing Machinery, 7_, 585. Saunders, I. W. (1984). Enumeration of r x c tables with repeated row totals. _Applied Statistics, 33_, 340-352. Senchaudhuri, P., Mehta, C. R., & Patel, N. R. (1995). Estimating exact p-values by the method of control variates, or Monte Carlo rescue. _Journal of the American Statistical Association_, June 1995, in press. Shamos, M. I. (1976). Geometry and statistics: problems at the interface. In J. F. Traub (Ed.), _Algorithms and complexity: New directions and recent results_ (pp. 251-279). New York: Academic Press. Simon, J. L. (1993). _Resampling: The new statistics_. Duxbury. Soms, A. P. (1977). An algorithm for the discrete Fisher's permutation tests. _Journal of the American Statistical Association, 72_, 662- 664. Spino, C., & Pagano, M. (1991a). Efficient calculation of the permutation distribution of robust two-sample statistics. _Computational Statistics and Data Analysis, 12_, 349-368. Spino, C., & Pagano, M. (1991b). Efficient calculation of the permutation distribution of trimmed means. _Journal of the American Statistical Association, 86_, 729-737. Streitberg, B., & Rohmel J. (1986). Exact distributions for permutation and rank tests: An introduction to some recently published algorithms. _Statistical Software Newsletter, 12_, 10-17. Streitberg, B., & Rohmel J. (1987). Exact distributions for rank- and permutation-tests in the general c-sample problem. _EDV (elektronische datenverarbeitung) in Medizin und Biologie, 18_, 12-19. Sunter, A. B. (1977). List sequential sampling with equal or unequal probabilities without replacement. _Applied Statistics, 26_, 261- 268. Thomas, D. (1975). Exact and asymptotic methods for the combination of 2 x 2 tables. _Computers and Biomedical Research, 8_, 423-446. Tritchler, D. (1984). An algorithm for exact logistic regression. _Journal of the American Statistical Association, 79_, 709-711. Tritchler, D. L., & Pedrini, D. T. (1979). A computer program for Fisher's exact test. _Educational and Psychological Measurement, 35_, 717- 720. Upton, G. J. G., & Brook, D. (1975). Determination of the optimum position on a ballot paper. _Applied Statistics, 24_, 279-287. van den Brink, W. P., & van den Brink, S. G. J. (1990). A modified approximate permutation test procedure. _Computational Statistics Quarterly, 3_, 241-247. Verbeek, A., & Kroonenberg, P. M. (1985). A survey of algorithms for exact distribution of test statistics in r x c tables with fixed marginals. _Computational Statistics and Data Analysis, 3_, 159- 185. Vitter, J. S. (1984). Faster methods for random sampling. _Communications of the Association for Computing Machinery, 27_, 703-718. Vollset, S. E., Hirji, K. F., & Elashoff, R. M. (1991). Fast computation of exact confidence limits for the common odds ratio in a series of 2 x 2 tables. _Journal of the American Statistical Association, 86_, 404-409. Vollset, S. E., & Hirji, K. F. (1991). A microcomputer program for exact and asymptotic analysis of several 2 x 2 tables. _Epidemiology, 2_, 217-220. Walsh, J. E. (1957). An experimental method for obtaining random digits and permutations. _Sankhya, 17_, 355-360. Wells, M. B. (1971). _Elements of combinatorial computing_. Oxford: Pergamon. {algorithm} Westfall, P H. & Young, S. S. (1993). _Resampling-based multiple testing: Examples and methods for p-value adjustment_. New York: Wiley. Wichmann, B. A., & Hill, I. D. (1982). Algorithm AS 183: An efficient and portable pseudo-random number generator. _Applied Statistics, 31_, 188-190. Woodhill, A. D. (1977). Generation of permutation sequences. _Computer Journal, 20_, 346-349. Wright, T. (1984). A note on Pascal's triangle and simple random sampling. _The College Mathematics Journal, 20_, 59-66. Yanagimoto, T., & Okamoto, M. (1969). Partial orderings for permutations and monotonicity of a rank correlation statistic. _Annals of the Institute of Statistical Mathematics (Tokio), 21_, 489-506. Zar, J. H. (1987). A fast efficient algorithm for the Fisher exact test. _Behavior Research Methods and Instrumentation, 19_, 413-414. Zimmerman, H. (1985a). Exact calculations of permutation distributions for r dependent samples. _Biometrical Journal, 27_, 349-352. Zimmerman, H. (1985b). Exact calculations for permutation distribution for r independent samples. _Biometrical Journal, 27_, 431-443.