Steinhaus–Johnson–Trotter algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Steinhaus–Johnson–Trotter algorithm" in English language version.

refsWebsite

Global rank English rank

13doi.org

2^nd place

9ams.org

451^st place

277^th place

7jstor.org

26^th place

20^th place

5semanticscholar.org

11^th place

8^th place

4psu.edu

207^th place

136^th place

3harvard.edu

18^th place

17^th place

3web.archive.org

1^st place

1umn.edu

1,266^th place

860^th place

1utexas.edu

916^th place

706^th place

1umich.edu

459^th place

360^th place

ams.org

mathscinet.ams.org

Lenstra & Rinnooy Kan (1979); Savage (1997), section 3; Bird (2010). Lenstra, J. K.; Rinnooy Kan, A. H. G. (September 1979), "A recursive approach to the implementation of enumerative methods", Proceedings of the School on Analysis and Design of Algorithms in Combinatorial Optimization, Udine, Italy (PDF), Technical report 8003/0, Erasmus University Rotterdam; see Section 2.1, "A minimum-change generator", pp. 3–8 Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
Johnson (1963). Johnson, Selmer M. (1963), "Generation of permutations by adjacent transposition", Mathematics of Computation, 17 (83): 282–285, doi:10.1090/S0025-5718-1963-0159764-2, JSTOR 2003846, MR 0159764
Ehrlich (1973); Dershowitz (1975); Sedgewick (1977); Bird (2010). Ehrlich, Gideon (1973), "Loopless algorithms for generating permutations, combinations, and other combinatorial configurations", Journal of the ACM, 20 (3): 500–513, doi:10.1145/321765.321781, S2CID 21493963 Dershowitz, Nachum (1975), "A simplified loop-free algorithm for generating permutations", Nordisk Tidskr. Informationsbehandling (BIT), 15 (2): 158–164, doi:10.1007/bf01932689, MR 0502206, S2CID 121353303 Sedgewick, Robert (1977), "Permutation generation methods", ACM Comput. Surv., 9 (2): 137–164, doi:10.1145/356689.356692, S2CID 12139332
See, e.g., section 11 of Savage (1997). Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
Dijkstra (1976); Knuth (2011). Dijkstra, Edsger W. (1976), "On a gauntlet thrown by David Gries" (PDF), Acta Informatica, 6 (4): 357–359, doi:10.1007/BF00268136, MR 0426492, S2CID 7085805. Although Dijkstra does not cite any prior literature, an earlier draft EWD502 reveals that he knew of Trotter (1962). Knuth, Donald (2011), "Section 7.2.1.2: Generating All Permutations", The Art of Computer Programming, volume 4A: Combinatorial Algorithms, Part 1
Savage (1997). Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
Johnson (1963); Trotter (1962). Johnson, Selmer M. (1963), "Generation of permutations by adjacent transposition", Mathematics of Computation, 17 (83): 282–285, doi:10.1090/S0025-5718-1963-0159764-2, JSTOR 2003846, MR 0159764 Trotter, H. F. (August 1962), "Algorithm 115: Perm", Communications of the ACM, 5 (8): 434–435, doi:10.1145/368637.368660, S2CID 1013826
Steinhaus (1964). Steinhaus, Hugo (1964), One hundred problems in elementary mathematics, New York: Basic Books, pp. 49–50, MR 0157881
Ruskey (1989). Ruskey, Frank (1989), "Transposition generation of alternating permutations", Order, 6 (3): 227–233, doi:10.1007/BF00563523, MR 1048093

doi.org

Sedgewick (1977). Sedgewick, Robert (1977), "Permutation generation methods", ACM Comput. Surv., 9 (2): 137–164, doi:10.1145/356689.356692, S2CID 12139332
Lenstra & Rinnooy Kan (1979); Savage (1997), section 3; Bird (2010). Lenstra, J. K.; Rinnooy Kan, A. H. G. (September 1979), "A recursive approach to the implementation of enumerative methods", Proceedings of the School on Analysis and Design of Algorithms in Combinatorial Optimization, Udine, Italy (PDF), Technical report 8003/0, Erasmus University Rotterdam; see Section 2.1, "A minimum-change generator", pp. 3–8 Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
Williams (2013). Williams, Aaron (2013), "The Greedy Gray Code Algorithm", in Dehne, Frank; Solis-Oba, Roberto; Sack, Jörg-Rüdiger (eds.), Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings, Lecture Notes in Computer Science, vol. 8037, Springer, pp. 525–536, doi:10.1007/978-3-642-40104-6_46, ISBN 978-3-642-40103-9
Johnson (1963). Johnson, Selmer M. (1963), "Generation of permutations by adjacent transposition", Mathematics of Computation, 17 (83): 282–285, doi:10.1090/S0025-5718-1963-0159764-2, JSTOR 2003846, MR 0159764
Trotter (1962). Trotter, H. F. (August 1962), "Algorithm 115: Perm", Communications of the ACM, 5 (8): 434–435, doi:10.1145/368637.368660, S2CID 1013826
Ehrlich (1973); Dershowitz (1975); Sedgewick (1977); Bird (2010). Ehrlich, Gideon (1973), "Loopless algorithms for generating permutations, combinations, and other combinatorial configurations", Journal of the ACM, 20 (3): 500–513, doi:10.1145/321765.321781, S2CID 21493963 Dershowitz, Nachum (1975), "A simplified loop-free algorithm for generating permutations", Nordisk Tidskr. Informationsbehandling (BIT), 15 (2): 158–164, doi:10.1007/bf01932689, MR 0502206, S2CID 121353303 Sedgewick, Robert (1977), "Permutation generation methods", ACM Comput. Surv., 9 (2): 137–164, doi:10.1145/356689.356692, S2CID 12139332
See, e.g., section 11 of Savage (1997). Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
Dijkstra (1976); Knuth (2011). Dijkstra, Edsger W. (1976), "On a gauntlet thrown by David Gries" (PDF), Acta Informatica, 6 (4): 357–359, doi:10.1007/BF00268136, MR 0426492, S2CID 7085805. Although Dijkstra does not cite any prior literature, an earlier draft EWD502 reveals that he knew of Trotter (1962). Knuth, Donald (2011), "Section 7.2.1.2: Generating All Permutations", The Art of Computer Programming, volume 4A: Combinatorial Algorithms, Part 1
Savage (1997). Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
White (1996). White, Arthur T. (November 1996), "Fabian Stedman: the first group theorist?", The American Mathematical Monthly, 103 (9): 771–778, doi:10.1080/00029890.1996.12004816, JSTOR 2974446
Johnson (1963); Trotter (1962). Johnson, Selmer M. (1963), "Generation of permutations by adjacent transposition", Mathematics of Computation, 17 (83): 282–285, doi:10.1090/S0025-5718-1963-0159764-2, JSTOR 2003846, MR 0159764 Trotter, H. F. (August 1962), "Algorithm 115: Perm", Communications of the ACM, 5 (8): 434–435, doi:10.1145/368637.368660, S2CID 1013826
Hu & Tien (1976). Hu, T. C.; Tien, B. N. (October 1976), "Generating permutations with nondistinct items", The American Mathematical Monthly, 83 (8): 629–631, doi:10.1080/00029890.1976.11994195, JSTOR 2319890
Ruskey (1989). Ruskey, Frank (1989), "Transposition generation of alternating permutations", Order, 6 (3): 227–233, doi:10.1007/BF00563523, MR 1048093

harvard.edu

ui.adsabs.harvard.edu

Lenstra & Rinnooy Kan (1979); Savage (1997), section 3; Bird (2010). Lenstra, J. K.; Rinnooy Kan, A. H. G. (September 1979), "A recursive approach to the implementation of enumerative methods", Proceedings of the School on Analysis and Design of Algorithms in Combinatorial Optimization, Udine, Italy (PDF), Technical report 8003/0, Erasmus University Rotterdam; see Section 2.1, "A minimum-change generator", pp. 3–8 Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
See, e.g., section 11 of Savage (1997). Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
Savage (1997). Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049

jstor.org

Lenstra & Rinnooy Kan (1979); Savage (1997), section 3; Bird (2010). Lenstra, J. K.; Rinnooy Kan, A. H. G. (September 1979), "A recursive approach to the implementation of enumerative methods", Proceedings of the School on Analysis and Design of Algorithms in Combinatorial Optimization, Udine, Italy (PDF), Technical report 8003/0, Erasmus University Rotterdam; see Section 2.1, "A minimum-change generator", pp. 3–8 Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
Johnson (1963). Johnson, Selmer M. (1963), "Generation of permutations by adjacent transposition", Mathematics of Computation, 17 (83): 282–285, doi:10.1090/S0025-5718-1963-0159764-2, JSTOR 2003846, MR 0159764
See, e.g., section 11 of Savage (1997). Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
Savage (1997). Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
White (1996). White, Arthur T. (November 1996), "Fabian Stedman: the first group theorist?", The American Mathematical Monthly, 103 (9): 771–778, doi:10.1080/00029890.1996.12004816, JSTOR 2974446
Johnson (1963); Trotter (1962). Johnson, Selmer M. (1963), "Generation of permutations by adjacent transposition", Mathematics of Computation, 17 (83): 282–285, doi:10.1090/S0025-5718-1963-0159764-2, JSTOR 2003846, MR 0159764 Trotter, H. F. (August 1962), "Algorithm 115: Perm", Communications of the ACM, 5 (8): 434–435, doi:10.1145/368637.368660, S2CID 1013826
Hu & Tien (1976). Hu, T. C.; Tien, B. N. (October 1976), "Generating permutations with nondistinct items", The American Mathematical Monthly, 83 (8): 629–631, doi:10.1080/00029890.1976.11994195, JSTOR 2319890

psu.edu

citeseerx.ist.psu.edu

Lenstra & Rinnooy Kan (1979); Savage (1997), section 3; Bird (2010). Lenstra, J. K.; Rinnooy Kan, A. H. G. (September 1979), "A recursive approach to the implementation of enumerative methods", Proceedings of the School on Analysis and Design of Algorithms in Combinatorial Optimization, Udine, Italy (PDF), Technical report 8003/0, Erasmus University Rotterdam; see Section 2.1, "A minimum-change generator", pp. 3–8 Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
See, e.g., section 11 of Savage (1997). Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
Savage (1997). Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049
McGuire (2003); Knuth (2011). McGuire, Gary (2003), Bells, motels and permutation groups, CiteSeerX 10.1.1.6.5544 Knuth, Donald (2011), "Section 7.2.1.2: Generating All Permutations", The Art of Computer Programming, volume 4A: Combinatorial Algorithms, Part 1

semanticscholar.org

api.semanticscholar.org

Sedgewick (1977). Sedgewick, Robert (1977), "Permutation generation methods", ACM Comput. Surv., 9 (2): 137–164, doi:10.1145/356689.356692, S2CID 12139332
Trotter (1962). Trotter, H. F. (August 1962), "Algorithm 115: Perm", Communications of the ACM, 5 (8): 434–435, doi:10.1145/368637.368660, S2CID 1013826
Ehrlich (1973); Dershowitz (1975); Sedgewick (1977); Bird (2010). Ehrlich, Gideon (1973), "Loopless algorithms for generating permutations, combinations, and other combinatorial configurations", Journal of the ACM, 20 (3): 500–513, doi:10.1145/321765.321781, S2CID 21493963 Dershowitz, Nachum (1975), "A simplified loop-free algorithm for generating permutations", Nordisk Tidskr. Informationsbehandling (BIT), 15 (2): 158–164, doi:10.1007/bf01932689, MR 0502206, S2CID 121353303 Sedgewick, Robert (1977), "Permutation generation methods", ACM Comput. Surv., 9 (2): 137–164, doi:10.1145/356689.356692, S2CID 12139332
Dijkstra (1976); Knuth (2011). Dijkstra, Edsger W. (1976), "On a gauntlet thrown by David Gries" (PDF), Acta Informatica, 6 (4): 357–359, doi:10.1007/BF00268136, MR 0426492, S2CID 7085805. Although Dijkstra does not cite any prior literature, an earlier draft EWD502 reveals that he knew of Trotter (1962). Knuth, Donald (2011), "Section 7.2.1.2: Generating All Permutations", The Art of Computer Programming, volume 4A: Combinatorial Algorithms, Part 1
Johnson (1963); Trotter (1962). Johnson, Selmer M. (1963), "Generation of permutations by adjacent transposition", Mathematics of Computation, 17 (83): 282–285, doi:10.1090/S0025-5718-1963-0159764-2, JSTOR 2003846, MR 0159764 Trotter, H. F. (August 1962), "Algorithm 115: Perm", Communications of the ACM, 5 (8): 434–435, doi:10.1145/368637.368660, S2CID 1013826

umich.edu

name.umdl.umich.edu

Stedman (1677); for lists of plain changes on up to six bells, see pp. 48–80. Stedman, Fabian (1677), Campanalogia, or, The art of ringing improved, London: W. Godbid – via Early English Books Online Text Creation Partnership

umn.edu

ageconsearch.umn.edu

Lenstra & Rinnooy Kan (1979); Savage (1997), section 3; Bird (2010). Lenstra, J. K.; Rinnooy Kan, A. H. G. (September 1979), "A recursive approach to the implementation of enumerative methods", Proceedings of the School on Analysis and Design of Algorithms in Combinatorial Optimization, Udine, Italy (PDF), Technical report 8003/0, Erasmus University Rotterdam; see Section 2.1, "A minimum-change generator", pp. 3–8 Savage, Carla (1997), "A survey of combinatorial Gray codes", SIAM Review, 39 (4): 605–629, Bibcode:1997SIAMR..39..605S, CiteSeerX 10.1.1.39.1924, doi:10.1137/S0036144595295272, JSTOR 2132693, MR 1491049

utexas.edu

cs.utexas.edu

Dijkstra (1976); Knuth (2011). Dijkstra, Edsger W. (1976), "On a gauntlet thrown by David Gries" (PDF), Acta Informatica, 6 (4): 357–359, doi:10.1007/BF00268136, MR 0426492, S2CID 7085805. Although Dijkstra does not cite any prior literature, an earlier draft EWD502 reveals that he knew of Trotter (1962). Knuth, Donald (2011), "Section 7.2.1.2: Generating All Permutations", The Art of Computer Programming, volume 4A: Combinatorial Algorithms, Part 1

web.archive.org

Knuth (2011). Knuth, Donald (2011), "Section 7.2.1.2: Generating All Permutations", The Art of Computer Programming, volume 4A: Combinatorial Algorithms, Part 1
Dijkstra (1976); Knuth (2011). Dijkstra, Edsger W. (1976), "On a gauntlet thrown by David Gries" (PDF), Acta Informatica, 6 (4): 357–359, doi:10.1007/BF00268136, MR 0426492, S2CID 7085805. Although Dijkstra does not cite any prior literature, an earlier draft EWD502 reveals that he knew of Trotter (1962). Knuth, Donald (2011), "Section 7.2.1.2: Generating All Permutations", The Art of Computer Programming, volume 4A: Combinatorial Algorithms, Part 1
McGuire (2003); Knuth (2011). McGuire, Gary (2003), Bells, motels and permutation groups, CiteSeerX 10.1.1.6.5544 Knuth, Donald (2011), "Section 7.2.1.2: Generating All Permutations", The Art of Computer Programming, volume 4A: Combinatorial Algorithms, Part 1