On random and adaptive parallel generation of combinatorial objects

References

• Akl , S.G. 1989 . The Design and Analysis of Parallel Algorithms , Englewood Cliffs, New Jersey : Prentice Hall .
   Google Scholar
• Akl , S.G. 1987 . Adaptive and optimal parallel algorithms for enumerating permutations and combinations . The Computer Journal , 30 ( 5 ) : 433 – 436 .
   Web of Science ®Google Scholar
• Akl , S.G. , Calvert , J. and Stojmenovic , I. 1991 . “ Systolic generation of derangements ” . In Algorithms and Parallel VLSI Architectures , North-Holland . to appear
   Google Scholar
• Akl , S.G. , Gries , D. and Stojmenovic , I. 1989 . An optimal parallel algorithm for generating combinations . Information Processing Letters , 33 : 135 – 139 . 90
   Google Scholar
• Akl , S.G. , Meijer , H. and Stojmenovic , I. January 1990 . “ Optimal parallel algorithms for generating permutations ” . In Department of Computing and Information Science , January , Kingston, , Canada : Queen's University . Technical Report No. 90-270
   Google Scholar
• Akl S.G. Stojmenovic I. A parallel algorithm for generating binary trees in preparation
   Google Scholar
• Arnold , D.B. and Sleep , M.R. 1980 . Uniform random generation of balanced parenthesis strings . ACM Trans, on Progr. Lang, and Syst , 2 ( 1 ) 122 – 128 .
   Google Scholar
• Chan , B. and Akl , S.G. 1986 . Generating combinations in parallel . BIT , 26 ( 1 ) 2 – 6 .
   Web of Science ®Google Scholar
• Chen , G.H. and Chern , M.S. 1986 . Parallel generation of permutations and combinations . BIT , 26 277 – 283 .
   Web of Science ®Google Scholar
• Durstenfeld , R. 1964 . Random permutation . Comm.ACM , 7 January : 420 algorithm 235
   Web of Science ®Google Scholar
• Er , M.C. 1988 . A parallel algorithm for cost-optimal generation of permutations of r out of n items . J.of Information & Optimization Sciences , 9 ( 1 ) January : 53 – 56 .
   Google Scholar
• Er , M.C. 1987 . Lexicographic listing and ranking t-ary trees . The Computer Journal , 30 ( 6 ) January : 569 – 572 .
   Web of Science ®Google Scholar
• Even , S. 1973 . Algorithmic Combinatorics , New York : Macmillan .
   Google Scholar
• Gries , D. and Xue , J. 1988 . Generating a random cyclic permutation . BIT , 28 : 569 – 572 .
   Google Scholar
• Gupta , P. and Bhattacharjee , G.P. 1983 . Parallel generation of permutations . The Computer Journal , 26 ( 2 ) : 97 – 105 .
   Web of Science ®Google Scholar
• Kimble , G.W. 1989 . Observations on the generation of permutations from random sequences . Intern.J.Computer Math , 29 : 11 – 19 .
   Web of Science ®Google Scholar
• Knott , G.D. 1977 . A numbering system for binary trees . Comm. ACM , 20 : 113 – 115 .
   Web of Science ®Google Scholar
• Knott , G.D. 1974 . A numbering system for combinations . Comm. ACM , 17 ( 1 ) : 45 – 46 .
   Web of Science ®Google Scholar
• Knott , G.D. 1976 . A numbering system for permutations of combinations . Comm. ACM , 19 ( 6 ) : 355 – 356 .
   Web of Science ®Google Scholar
• Knuth , D.E. 1968 . “ The Art of Computer Programming ” . In Fundamental Algorithms , Vol. 1 , Reading, MA : Addison-Wesley .
   Google Scholar
• Knuth , D.E. 1981 . Seminumerical Algorithms , Reading, MA : Addison-Wesley . 2nd ed
   Google Scholar
• Kulkarni , V.G. 1990 . Generating random combinatorial objects . J. Alg , 11 : 185 – 207 .
   Google Scholar
• Lin , C.J. 1990 . Parallel algorithm for generating permutations on linear array . Inf. Proc. Lett , 33 : 167 – 170 .
   Google Scholar
• Lin , C.J. and Tsay , J.C. 1989 . A systolic generation of combinations . BIT , 29 : 23 – 36 .
   Google Scholar
• Mor , M. and Fraenkel , A.S. 1982 . Permutation generation on vector processors . The Computer Journal , 25 ( 4 ) : 423 – 428 .
   Web of Science ®Google Scholar
• Martin , H.W. , Kiltinen , J.O. and McNeill , R.B. . The representation and enumeration of ordered k-ary trees . Proc. of Int. Conf. on Computing and Information . pp. 105 – 109 . North-Holland .
   Google Scholar
• Martin , H.W. and Orr , B.J. . A random binary tree generator, Computing Trends in the 1990's . ACM Seventeenth Computer Science Conference . Feb , pp. 33 – 38 . Louisville, Kentucky
   Google Scholar
• Moses , L.E. and Oakford , R.V. 1963 . Tables of Random Permutations , Stanford : Stanford Univ. Press .
   Google Scholar
• Nijenhius , A. and Wilf , H.S. 1978 . Combinatorial Algorithms , N.Y : Academic Press .
   Google Scholar
• Nijenhius , A. and Wilf , H.S. 1975 . A method and two algorithms on the theory of partitions . J. Comb. Theory A , 18 : 219 – 222 .
   Web of Science ®Google Scholar
• Page , E.S. 1967 . A note on generating random permutations . Applied Statistics , 16 ( 3 ) : 273 – 274 .
   Web of Science ®Google Scholar
• Proskurowski , A. 1980 . On the generation of binary trees . J. ACM , 27 : 1 – 2 .
   Web of Science ®Google Scholar
• Reingold , E.M. , Nievergelt , J. and Deo , N. 1977 . Combinatorial Algorithms , Englewood Cliffs, New Jersey : Prentice Hall .
   Google Scholar
• Ruskey , F. and Hu , T.C. 1977 . Generating binary trees lexicographically . SIAM J. Comp , 6 : 745 – 758 .
   Web of Science ®Google Scholar
• Sattolo , S. 1986 . An algorithm to generate a random cyclic permutation . Inf. Proc. Lett , 22 : 315 – 317 .
   Google Scholar
• Solomon , M. and Finkel , R.A. 1980 . A note on enumerating binary trees . J. of ACM , 27 : 3 – 5 .
   Web of Science ®Google Scholar
• Stojmenovic , I. 1990 . An optimal algorithm for generating equivalence relations on a linear array of processors . BIT , 30 ( 3 ) : 424 – 436 .
   Web of Science ®Google Scholar
• Stojmenovic I. A simple systolic algorithm for generating combinations in lexicographic order Comput. & Math, with Applic 1990 To appear
   Google Scholar
• Trojanowski , A.E. 1978 . Ranking and listing algorithms for k-ary trees . SIAM J. Comput , 7 ( 4 ) : 492 – 509 .
   Web of Science ®Google Scholar
• Zaks , S. 1980 . Lexicographic generation of ordered trees . Theor. Comput. Sci , 10 : 63 – 82 .
   Web of Science ®Google Scholar