Robert Sedgewick
- 1 BOOTHROYD, J "PERM (Algorithm 6)," Computer Bulletin 9, 3 (Dec. 1965), 104Google Scholar
- 2 BOOTHROYD, J. "Permutation of the elements of a vector (Algomthm 29)"; and "Fast permutation of the elements of a vector (Algorithm 30)," Computer J. 10 (1967), 310-312.Google Scholar
- 3 BaATLEY, P "Permutations with repetitious (Algomthm 306)," Comm ACM 1O, 7 (July 1967), 450 Google Scholar
- 4 Cove, YOU, R R.; AND SULLrVAN, J. G. "Permutahon (Algorithm 71)," Comm. ACM 4, 11 (Nov 1961), 497.Google Scholar
- 5 DERSHOWITZ, N. "A simplified loop-free algorithm for generating permutatlous," BIT 15 (1975), 158-164.Google ScholarCross Ref
- 6 DIJKSTRA, E W A discipline of programming, Prentice-Hall, Englewood Cliffs, N.J., 1976. Google Scholar
- 7 DIJKSTRA, E. W "On a gauntlet thrown by David Gries," Acta Informatica 6, 4 (1976), 357.Google ScholarDigital Library
- 8 DURSTENFELD, R. "Random permutation (Algomthm 235)," Comm. ACM 7, 7 (July 1964), 420. Google ScholarDigital Library
- 9 EAVES, B. C "Permute (Algorithm 130)," Comm. ACM 5, 11 (Nov. 1962), 551 (See also: remarks by R. J. Ord-Smith in Comm ACM 10, 7 (July, 1967), 452-3)Google ScholarDigital Library
- 10 EHRLICH, G. "Loopless algorithms for generating permutations, combinations and other combinatorial configurations," J ACM 20, 3 (July 1973), 500-513. Google ScholarDigital Library
- 11 EHRLICH, G "Four combinatoional algorithms (Algorithm 466)," Comm ACM 16, 11 (Nov 1973), 690-691. Google ScholarDigital Library
- 12 EWN, S. Algorthmic combinatorics, Macmillan, Inc., N.Y., 1973.Google Scholar
- 13 FIKE, C T. "A permutation generation method," Computer J 18, 1 (Feb. 1975), 21-22.Google ScholarCross Ref
- 14 FISCHER, L. L.; AND KRAUSE, K. C, Lehrbuch der Combinationslehre und der Arithmetic, Dresden, 1812Google Scholar
- 15 HALL, M.; ANDKNUTH, D.E. "Combinatorial analysis and computers," American Math. Monthly 72, 2 (Feb. 1965, Part II), 21-28.Google ScholarCross Ref
- 16 HEAP, B R. "Permutations by Interchanges," Computer J. 6 (1963), 293-4.Google ScholarCross Ref
- 17 HOWELL, J R. "Generation of permutations by addition,"Math. Comp 16 (1962), 243-44Google ScholarCross Ref
- 18 HOWELL, J .R . "Permutation generater (Algorithm 87)," Comm. ACM 5, 4 (April 1962), 209. (See also: remarks by R. J. Ord-Smith in Comm ACM 10, 7 (July 1967), 452-3.) Google ScholarDigital Library
- 19 IVES, F.M. "Permutation enumeration: four new permutation algorithms," Comm. ACM 19, 2 (Feb. 1976), 68-72. Google ScholarDigital Library
- 20 JOHNSON, S.M. "Generation of permutations by adjacent transposition," Math. Comp. 17 (1963), 282-285.Google ScholarCross Ref
- 21 KNUTH, D.E. "Fundamental algorithms," in The art of computer programming 1, Addison- Wesley, Co., inc., Reading, Mass., 1968.Google Scholar
- 22 KNUTH, D.E. "Seminumerlcal algorithms," in The art of computer programming 2, Addison-Wesley, Co., inc., Reading, Mass., 1969.Google Scholar
- 23 KNUTH, D. E "Sorting and searching," in The art of computer programmtng 3, Addison- Wesley, Co., Inc, Reading, Mass, 1972Google Scholar
- 24 KNUTH, D. E. "St,ru, ctured programming with go to statements, ' Computing Surveys 6, 4 (Dec. 1974), 261-301. Google Scholar
- 25 LANaDON, G. G., Jr., "An algorithm for generating permutations," Comm. ACM 10, 5 (May 1967), 298-9. (See also. letters by R. J. Ord-Smith in Comm. ACM 10, 11 (Nov. 1967), 684; by B. E. Rodden in Comm. ACM 11, 3 (March 1968), 150; CR Rev. 13,891, Computing Reviews 9, 3 (March 1968), and letter by Langdon inComm. ACM 11, 6 (June 1968), 392.) Google Scholar
- 26 LEHMER, D H. "Teaching combinatorial tricks to a computer," in Proc. of Symposium Appl. Math ,Combtnatortal Analysis, Vol. 10, American Mathematical Society, Providence, R.I, 1960, 179-193.Google Scholar
- 27 LEHMER, D.H. "The machine tools of combinatories," in Applied combinatorial mathematws (E. F. Beckenbach, {Ed.}), John Wiley, & Sons, Inc., N Y, 1964Google Scholar
- 28 LEHMER, D.H. "Permutation by adjacent interchanges," Amerwan Math. Monthly 72, 2 (Feb. 1965, Part II), 36-46.Google Scholar
- 29 ORD-SMITH, R J. "Generation of permutation sequences Part 1," Computer J. 13, 3 (March 1970), 152-155.Google ScholarCross Ref
- 30 ORD-SMITH, R. J. "Generation of permutation sequences: Part 2," Computer J. 14, 2 (May 1971), 136-139.Google ScholarCross Ref
- 31 ORD-SMITH, R. J. "Generation of permutations in psoudo-lexicographic order (Algorithm 308)," Comm ACM 10, 7 (July 1967), 452 (See also: remarks in Comm ACM 12, 11 (Nov 1969), 638.) Google ScholarDigital Library
- 32 ORD-SMITH, R J "Generation of permutations in lexicographlc order (Algorithm 323)," Comm. ACM 11, 2 (Feb. 1968), 117 (See also: certification by I. M. Leitch in Comm ACM 12, 9 (Sept. 1969), 512.) Google ScholarDigital Library
- 33 PECK, J E. L; AND SCHRACK, G F "Permute (Algorithm 86)," Comm. ACM 5, 4 (April 1962), 208.Google ScholarDigital Library
- 34 PHmLmS, J. P.N. "Permutation of the elements of a vector in lexicographic order (Algorithm 28)," Computer J. 1O (1967), 310-311Google Scholar
- 35 PLESZCZYNSKL S. "On the generation of permutations," Informatmn Processtng Letters 3, 6 (July 1975), 180-183.Google Scholar
- 36 RIORDAN, J. An introduction to combinatortal analysis, John Wiley & Sons, Inc., N.Y., 1958.Google Scholar
- 37 ROHL, J.S., "Programming improvements to Fike's algorithm for generating permutations," Computer J. 19, 2 (May 1976), 156Google ScholarCross Ref
- 38 ROBXNSON, C. L. "Permutation (Algorithm 317)," Comm. ACM 10, 11 (Nov. 1967), 729.Google Scholar
- 39 SAG, T.W. "Permutations of a set with repetitions (Algorithm 242)," Comm ACM 7, 10 (Oct 1964), 585. Google ScholarDigital Library
- 40 SCHRAK, G. F , AND SHIMRAT, M "Permutation in lexicographlc order (Algorithm 102)," Comm. ACM 5, 6 (June 1962), 346. (See also: remarks by R J Ord-Smith in Comm ACM 10, 7 (July 1967), 452-3.) Google Scholar
- 41 SHEN, M.-K "On the generation ofpermutatlons and combinations," BIT 2 (1962), 228- 231Google ScholarCross Ref
- 42 SHEN, M -K "Generation ofpermutations in lexicographic order (Algorithm 202)," Comm ACM 6, 9 (Sept. 1963), 517. (See also: remarks by R. J. Ord-Snnth in Comm. ACM 10, 7 (July 1967), 452-3.) Google ScholarDigital Library
- 43 SLOANE, N. J. A. A handbook of tnteger sequences, Academic Press, Inc, NY, 1973Google Scholar
- 44 TOMPKIN8, C. "Machine attacks on problems whoso variables are permutations," in Proc Symposium zn Appl. Math., Numerwal Analysts, Vol 6, McGraw-Hill, Inc., N.Y., 1956, 195-211Google Scholar
- 45 TROTTER, H. F. "Perm (Algorithm 115)," Comm. ACM 5, 8 (August 1962), 434-435. Google ScholarDigital Library
- 46 WALKER, R. J "An enumerative technique for a class of combinatorial problems," in Proc Symposium in Appl. Math, Combtnatorial Analysts, Vol. 10, American Mathematical Society, Providence, R.I , 1960, 91Google Scholar
- 47 WZLLS, M. B "Generation of permutations by transposition," Math Comp 15 (1961), 192- 195.Google ScholarCross Ref
- 48 WELLS, M. B. Elements of combtnatortal computtng, Pergamon Press, Elmsford, N.Y., 1971.Google Scholar
- 49 WHITEHEAD, E. G. Combinatorial algorithms. (Notes by C. Frankfeldt and A. E. Kaplan) Courant Institute, New York Univ., 1973, 11-17.Google Scholar
Index Terms
-
Permutation Generation Methods
-
Recommendations
-
Permutation tableaux and permutation patterns
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the -diagrams of Alex Postnikov [A. Postnikov, Webs in ...
-
On the sign-imbalance of permutation tableaux
Permutation tableaux were introduced by Steingrmsson and Williams. Corteel and Kim defined the sign of a permutation tableau in terms of the number of unrestricted columns. The sign-imbalance of permutation tableaux of length n is the sum of signs over ...
-
The sorting index and permutation codes
In the combinatorial study of the coefficients of a bivariate polynomial that generalizes both the length and the reflection length generating functions for finite Coxeter groups, Petersen introduced a new Mahonian statistic sor, called the sorting ...
Comments