{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T15:34:55Z","timestamp":1791992095136,"version":"4.4.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,7,3]],"date-time":"2013-07-03T00:00:00Z","timestamp":1372809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s00224-013-9486-8","type":"journal-article","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T04:45:59Z","timestamp":1372740359000},"page":"551-577","source":"Crossref","is-referenced-by-count":9,"title":["The Coolest Way to Generate Binary Strings"],"prefix":"10.1007","volume":"54","author":[{"given":"Brett","family":"Stevens","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,7,3]]},"reference":[{"key":"9486_CR1","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1016\/j.ejc.2005.07.019","volume":"28","author":"J. Berstel","year":"2007","unstructured":"Berstel, J., Perrin, D.: The origins of combinatorics on words. Eur. J. Comb. 28, 996\u20131022 (2007)","journal-title":"Eur. J. Comb."},{"issue":"19","key":"9486_CR2","first-page":"215","volume":"69","author":"P.J. Chase","year":"1989","unstructured":"Chase, P.J.: Combination generation and graylex ordering. Congr. Numer. 69(19), 215\u2013242 (1989)","journal-title":"Congr. Numer."},{"key":"9486_CR3","first-page":"758","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Proc. K. Ned. Acad. Wet., Ser. A, Math. Sci. 49, 758\u2013764 (1946)","journal-title":"Proc. K. Ned. Acad. Wet., Ser. A, Math. Sci."},{"key":"9486_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.jda.2012.04.015","volume":"16","author":"S. Durocher","year":"2012","unstructured":"Durocher, S., Li, P.C., Mondal, D., Ruskey, F., Williams, A.: Cool-lex order and k-ary Catalan structures. J. Discrete Algorithms 16, 287\u2013307 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"9486_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(88)90113-2","volume":"60","author":"J.P. Duval","year":"1988","unstructured":"Duval, J.P.: G\u00e9n\u00e9ration d\u2019une section de classes de conjugasion et arbre des mots de Lyndon de lonueur born\u00e9e. Theor. Comput. Sci. 60, 255\u2013283 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"9486_CR6","doi-asserted-by":"crossref","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 of fixed size with a strong minimal change property. Inf. Process. Lett. 19, 131\u2013133 (1984)","journal-title":"Inf. Process. Lett."},{"key":"9486_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(86)90089-0","volume":"61","author":"H. Fredericksen","year":"1986","unstructured":"Fredericksen, H., Kessler, I.J.: An algorithm for generating necklaces of beads in two colors. Discrete Math. 61, 181\u2013188 (1986)","journal-title":"Discrete Math."},{"issue":"3","key":"9486_CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H. Fredericksen","year":"1978","unstructured":"Fredericksen, H., Maiorana, J.: Necklaces of beads in k colors and kary de Bruijn sequences. Discrete Math. 23(3), 207\u2013210 (1978)","journal-title":"Discrete Math."},{"key":"9486_CR9","unstructured":"Gray, F.: Pulse code communication. US Patent 2,632,058, 1947"},{"issue":"1","key":"9486_CR10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0097-3165(93)90087-O","volume":"61","author":"G. Hurlbert","year":"1995","unstructured":"Hurlbert, G., Isaak, G.: On the de Bruijn torus problem. J. Comb. Theory 61(1), 50\u201362 (1995)","journal-title":"J. Comb. Theory"},{"issue":"2","key":"9486_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.jcta.2003.11.004","volume":"105","author":"R.J. Johnson","year":"2004","unstructured":"Johnson, R.J.: Long cycles in the middle two layers of the discrete cube. J. Comb. Theory, Ser. A 105(2), 255\u2013271 (2004)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"9486_CR12","isbn-type":"print","volume-title":"The Art of Computer Programming, Generating All Tuples and Permutations","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming, Generating All Tuples and Permutations, vol. 4 fascicle 2. Addison-Wesley, Reding (2005). errata (updated 10\/02\/2008) edition. ISBN 0-201-85393-0","ISBN":"https:\/\/id.crossref.org\/isbn\/0201853930"},{"key":"9486_CR13","isbn-type":"print","volume-title":"The Art of Computer Programming, Generating All Combinations and Partitions","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming, Generating All Combinations and Partitions, vol. 4 fascicle 3. Addison-Wesley, Reading (2005). errata (updated 10\/02\/2008) edition. ISBN 0-201-85394-9","ISBN":"https:\/\/id.crossref.org\/isbn\/0201853949"},{"key":"9486_CR14","volume-title":"The Art of Computer Programming. Combinatorial Algorithms","author":"D.E. Knuth","year":"2010","unstructured":"Knuth, D.E.: The Art of Computer Programming. Combinatorial Algorithms, vol. 4, Part 1. Addison-Wesley, Reading (2010)"},{"key":"9486_CR15","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1090\/S0002-9904-1934-05988-3","volume":"40","author":"M.H. Martin","year":"1934","unstructured":"Martin, M.H.: A problem in arrangements. Bull. Am. Math. Soc. 40, 859\u2013864 (1934)","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"9486_CR16","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0196-6774(88)90036-3","volume":"9","author":"F. Ruskey","year":"1988","unstructured":"Ruskey, F.: Adjacent interchange generation of combinations. J. Algorithms 9(2), 162\u2013180 (1988)","journal-title":"J. Algorithms"},{"key":"9486_CR17","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/0196-6774(92)90047-G","volume":"13","author":"F. Ruskey","year":"1992","unstructured":"Ruskey, F., Savage, C., Wang, T.: Generating necklaces. J. Algorithms 13, 414\u2013430 (1992)","journal-title":"J. Algorithms"},{"issue":"1","key":"9486_CR18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.jcta.2011.07.005","volume":"119","author":"F. Ruskey","year":"2012","unstructured":"Ruskey, F., Sawada, J., Williams, A.: Binary bubble languages and cool-lex Gray codes. J. Comb. Theory, Ser. A 119(1), 155\u2013169 (2012)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"2","key":"9486_CR19","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/100808782","volume":"26","author":"F. Ruskey","year":"2012","unstructured":"Ruskey, F., Sawada, J., Williams, A.: De Bruijn sequences for fixed-weight binary strings. SIAM J. Discrete Math. 26(2), 605\u2013617 (2012)","journal-title":"SIAM J. Discrete Math."},{"issue":"17","key":"9486_CR20","doi-asserted-by":"crossref","first-page":"5305","DOI":"10.1016\/j.disc.2007.11.048","volume":"309","author":"F. Ruskey","year":"2009","unstructured":"Ruskey, F., Williams, A.: The coolest way to generate combinations. Discrete Math. 309(17), 5305\u20135320 (2009)","journal-title":"Discrete Math."},{"key":"9486_CR21","first-page":"107","volume":"1","author":"C. Flye Sainte-Marie","year":"1894","unstructured":"Flye Sainte-Marie, C.: Solution to question nr. 48. L\u2019Interm\u00e9diaire Math. 1, 107\u2013110 (1894)","journal-title":"L\u2019Interm\u00e9diaire Math."},{"issue":"2","key":"9486_CR22","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0097-3165(95)90091-8","volume":"70","author":"C. Savage","year":"1995","unstructured":"Savage, C., Winkler, P.: Monotone Gray codes and the middle levels problem. J. Comb. Theory, Ser. A 70(2), 230\u2013248 (1995)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"9486_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-642-19094-0_19","volume-title":"WALCOM 2011: The 5th International Workshop on Algorithms and Computation","author":"J. Sawada","year":"2011","unstructured":"Sawada, J., Stevens, B., Williams, A.: De Bruijn sequences for the binary strings with a maximum density. In: WALCOM 2011: The 5th International Workshop on Algorithms and Computation. Lecture Notes in Computer Science, New Delhi, India, vol. 6552, pp. 182\u2013190. Springer, Berlin (2011)"},{"key":"9486_CR24","volume":"19","author":"J. Sawada","year":"2012","unstructured":"Sawada, J., Williams, A.: Efficient oracles for generating binary bubble languages. Electron. J. Comb. 19, Paper\u00a042 (2012)","journal-title":"Electron. J. Comb."},{"key":"9486_CR25","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A.: A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. Theor. Comput. Sci. (2012, in press). doi: 10.1016\/j.tcs.2012.01.013","DOI":"10.1016\/j.tcs.2012.01.013"},{"key":"9486_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/978-3-642-30347-0_32","volume-title":"FUN \u201912: Proceedings of the Sixth International Conference on Fun with Algorithms","author":"B. Stevens","year":"2012","unstructured":"Stevens, B., Williams, A.: The coolest order of binary strings. In: Kranakis, E., Krizanc, D., Luccio,\u00a0F. (eds.) FUN \u201912: Proceedings of the Sixth International Conference on Fun with Algorithms. Lecture Notes in Computer Science, San Servolo Island, Venice, Italy, vol. 7288, pp. 322\u2013333. Springer, Berlin (2012)"},{"key":"9486_CR27","volume-title":"SODA \u201909: The Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"A. Williams","year":"2009","unstructured":"Williams, A.: Loopless generation of multiset permutations using a constant number of variables by prefix shifts. In: SODA \u201909: The Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, New York, USA (2009)"},{"key":"9486_CR28","unstructured":"Williams, A.: Shift Gray codes. PhD thesis, in Computer Science, University of Victoria (2009)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9486-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9486-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9486-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T22:39:56Z","timestamp":1563316796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9486-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,3]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9486"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9486-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,3]]}}}