{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T02:22:46Z","timestamp":1772245366480,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405054","type":"print"},{"value":"9783540450665","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_5","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T07:41:13Z","timestamp":1172648473000},"page":"73-88","source":"Crossref","is-referenced-by-count":8,"title":["Generating Gray Codes in O(1) Worst-Case Time per Word"],"prefix":"10.1007","author":[{"given":"Timothy","family":"Walsh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"5_CR1","unstructured":"Gray, F.: Pulse Code Communication. U.S. Patent 2 632 058 (March 17, 1953)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1145\/355609.362322","volume":"16","author":"C.N. Liu","year":"1973","unstructured":"Liu, C.N., Tang, D.T.: Algorithm 452, Enumerating M out of N objects. Comm. ACM 16 (1973) 485","journal-title":"Comm. ACM"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(84)90091-7","volume":"19","author":"P. Eades","year":"1984","unstructured":"Eades, P., McKay, B.: An Algorithm for Generating Subsets to Fixed Size with a Strong Minimal Interchange Property. Information Processing Letters 19 (1984) 131\u2013133","journal-title":"Information Processing Letters"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"282","DOI":"10.2307\/2003846","volume":"17","author":"S.M. Johnson","year":"1963","unstructured":"Johnson, S.M.: Generation of Permutations by Adjacent Transpositions. Mathematics of Computation 17 (1963) 282\u2013285","journal-title":"Mathematics of Computation"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1145\/368637.368660","volume":"5","author":"H.F. Trotter","year":"1962","unstructured":"Trotter, H.F.: Algorithm 115: Perm. Comm. ACM 5 (1962) 434\u2013435","journal-title":"Comm. ACM"},{"key":"5_CR6","volume-title":"Combinatorial Algorithms for Computers and Calculators","author":"A. Nijenhuis","year":"1978","unstructured":"Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms for Computers and Calculators, second edition. Academic Press, N.Y. (1978)","edition":"second edition"},{"key":"5_CR7","first-page":"215","volume":"69","author":"P.J. Chase","year":"1989","unstructured":"Chase, P.J.: Combination Generation and Graylex Ordering. Proceedings of the 18th Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, 1988. Congressus Numerantium 69 (1989) 215\u2013242","journal-title":"Congressus Numerantium"},{"key":"5_CR8","first-page":"201","volume":"762","author":"F. Ruskey","year":"1993","unstructured":"Ruskey, F.: Simple Combinatorial Gray Codes Constructed by Reversing Sublists. L.N.C.S. 762 (1993) 201\u2013208","journal-title":"L.N.C.S."},{"key":"5_CR9","unstructured":"Vajnovszki, V., Walsh, T.R.: A loopless two-close Gray code algorithm for listing k-ary Dyck words. Submitted for publication"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0196-6774(90)90030-I","volume":"11","author":"F. Ruskey","year":"1990","unstructured":"Ruskey, F., Proskurowski, A.: Generating Binary Trees by Transpositions. J. Algorithms 11 (1990) 68\u201384","journal-title":"J. Algorithms"},{"issue":"5","key":"5_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0020-0190(98)00171-9","volume":"68","author":"B. Bultena","year":"1998","unstructured":"Bultena, B., Ruskey, F.: An Eades-McKay Algorithm for Well-Formed Parentheses Strings. Inform. Process. Lett. 68 (1998), no. 5, 255\u2013259","journal-title":"Inform. Process. Lett."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(89)90007-2","volume":"10","author":"C. Savage","year":"1989","unstructured":"Savage, C.: Gray Code Sequences of Partitions. Journal of Algorithms 10 (1989) 577\u2013595","journal-title":"Journal of Algorithms"},{"key":"5_CR13","unstructured":"Walsh, T.R.: A Simple Sequencingan d Ranking Method that Works on Almost All Gray Codes. Research Report No. 243, Department of Mathematics and Computer Science, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al (April 1995)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G. Ehrlich","year":"1973","unstructured":"Ehrlich, G.: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations: J. ACM 20 (1973) 500\u2013513","journal-title":"J. ACM"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/360336.360343","volume":"19","author":"J.R. Bitner","year":"1976","unstructured":"Bitner, J.R., Ehrlich, G., Reingold, E.M.: Efficient Generation of the Binary Reflected Gray Code and its Applications. Comm. ACM 19 (1976) 517\u2013521","journal-title":"Comm. ACM"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1137\/0209013","volume":"9","author":"J.T. Joichi","year":"1980","unstructured":"Joichi, J.T., White, D.E., Williamson, S.G.: Combinatorial Gray Codes. SIAM J. Computing 9 (1980) 130\u2013141","journal-title":"SIAM J. Computing"},{"key":"5_CR17","first-page":"95","volume":"36","author":"T.R. Walsh","year":"2001","unstructured":"Walsh, T.R.: Gray Codes for Involutions. JCMCC 36 (2001) 95\u2013118","journal-title":"JCMCC"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1006\/jagm.1998.0960","volume":"29","author":"T.R. Walsh","year":"1998","unstructured":"Walsh, T.R.: Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time. J. Algorithms 29 (1998) 165\u2013173","journal-title":"J. Algorithms"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1006\/jagm.1999.1073","volume":"35","author":"D. Roelants van Baronaigien","year":"2000","unstructured":"Roelants van Baronaigien, D.: A Loopless Gray-Code Algorithm for Listing k-ary Trees. J. Algorithms 35 (2000), no. 1, 100\u2013107","journal-title":"J. Algorithms"},{"key":"5_CR20","volume-title":"Combinatorics for Computer Science","author":"S.G. Williamson","year":"1985","unstructured":"Williamson, S.G.: Combinatorics for Computer Science. Computer Science Press, Rockville (1985)"},{"key":"5_CR21","first-page":"87","volume":"90","author":"D. Roelants van Baronaigien","year":"1992","unstructured":"Roelants van Baronaigien, D.: Constant Time Generation of Involutions. Congressus Numerantium 90 (1992) 87\u201396","journal-title":"Congressus Numerantium"},{"key":"5_CR22","unstructured":"Vajnovszki, V.: Generating Multiset Permutations. Accepted for publication in Theoretical Computer Science"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0196-6774(82)90006-2","volume":"3","author":"P. Klingsberg","year":"1982","unstructured":"Klingsberg, P.: A Gray Code for Compositions. Journal of Algorithms 3 (1982) 41\u201344","journal-title":"Journal of Algorithms"},{"key":"5_CR24","first-page":"323","volume":"33","author":"T.R. Walsh","year":"2000","unstructured":"Walsh, T.R.: Loop-free sequencing of bounded integer compositions, JCMCC 33 (2000) 323\u2013345","journal-title":"JCMCC"}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T22:06:33Z","timestamp":1550268393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}