{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:48Z","timestamp":1759637928652,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030850876"},{"type":"electronic","value":"9783030850883"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85088-3_15","type":"book-chapter","created":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:03:24Z","timestamp":1630883004000},"page":"172-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order"],"prefix":"10.1007","author":[{"given":"Joe","family":"Sawada","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14764-7","volume-title":"Matters Computational: Ideas, Algorithms, Source Code","author":"J Arndt","year":"2011","unstructured":"Arndt, J.: Matters Computational: Ideas, Algorithms, Source Code. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-14764-7"},{"issue":"8","key":"15_CR2","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00236-004-0139-x","volume":"40","author":"S Bacchelli","year":"2004","unstructured":"Bacchelli, S., Barcucci, E., Grazzini, E., Pergola, E.: Exhaustive generation of combinatorial objects by ECO. Acta Informatica 40(8), 585\u2013602 (2004)","journal-title":"Acta Informatica"},{"issue":"4\/5","key":"15_CR3","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/s00236-004-0139-x","volume":"10","author":"KS Booth","year":"1980","unstructured":"Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett. 10(4\/5), 240\u2013242 (1980). https:\/\/doi.org\/10.1007\/s00236-004-0139-x","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"15_CR4","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 parenthesis strings. Inf. Process. Lett. 68(5), 255\u2013259 (1998)","journal-title":"Inf. Process. Lett."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Lewenstein, M.: Clustered integer 3SUM via additive combinatorics. In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, STOC 2015, pp. 31\u201340, New York, NY, USA (2015)","DOI":"10.1145\/2746539.2746568"},{"key":"15_CR6","unstructured":"COS++. The Combinatorial Object Server. http:\/\/combos.org\/brgc"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"JP Duval","year":"1983","unstructured":"Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms 4(4), 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"issue":"3","key":"15_CR8","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(3), 500\u2013513 (1973)","journal-title":"J. ACM"},{"key":"15_CR9","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"R Graham","year":"1994","unstructured":"Graham, R., Knuth, D., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Longman Publishing Co., Inc., Boston (1994)"},{"key":"15_CR10","unstructured":"Gray, T.: Pulse code communication (1953). US Patent 2,632,058"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Hartung, E., Hoang, H.P., M\u00fctze, T., Williams, A.: Combinatorial generation via permutation languages. In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, pp. 1214\u20131225, USA (2020)","DOI":"10.1137\/1.9781611975994.74"},{"key":"15_CR12","unstructured":"Knuth, D.: The Art of Computer Programming. Volume 4, fascicule 2, Generating all tuples and permutations. The Art of Computer Programming. Addison-Wesley, Upper Saddle River (N.J.), 2005. Autre tirage (2010)"},{"issue":"5","key":"15_CR13","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ipl.2008.11.007","volume":"109","author":"Y Li","year":"2009","unstructured":"Li, Y., Sawada, J.: Gray codes for reflectable languages. Inf. Process. Lett. 109(5), 296\u2013300 (2009)","journal-title":"Inf. Process. Lett."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"M\u00fctze, T.: Proof of the middle levels conjecture. In: Proceedings of the London Mathematical Society, vol. 112, pp. 677\u2013713 (2016)","DOI":"10.1112\/plms\/pdw004"},{"key":"15_CR15","unstructured":"Ruskey, F.: Combinatorial Generation. Working version (1j-CSC 425\/520) edition (2003)"},{"issue":"1","key":"15_CR16","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(1), 68\u201384 (1990)","journal-title":"J. Algorithms"},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","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 order. J. Comb. Theory Ser. A 119(1), 155\u2013169 (2012)","journal-title":"J. Comb. Theory Ser. A"},{"key":"15_CR18","unstructured":"Ruskey, F., Williams, A.: Generating balanced parentheses and binary trees by prefix shifts. In: Proceedings of the Fourteenth Symposium on Computing: The Australasian Theory, CATS 2008, vol.77 pp. 107\u2013115, Darlinghurst, Australia (2008)"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2012.01.013","volume":"502","author":"J Sawada","year":"2013","unstructured":"Sawada, J., Williams, A.: A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. Theor. Comput. Sci. 502, 46\u201354 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jda.2017.10.002","volume":"46\u201347","author":"J Sawada","year":"2017","unstructured":"Sawada, J., Williams, A., Wong, D.: Necklaces and Lyndon words in colexicographic and reflected Gray code order. J. Discrete Algorithms 46\u201347, 25\u201335 (2017)","journal-title":"J. Discrete Algorithms"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-46632-0_25","volume-title":"Algorithms and Computation","author":"T Takaoka","year":"1999","unstructured":"Takaoka, T.: An O(1) time algorithm for generating multiset permutations. In: ISAAC 1999. LNCS, vol. 1741, pp. 237\u2013246. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46632-0_25"},{"issue":"3","key":"15_CR22","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ipl.2007.10.011","volume":"106","author":"V Vajnovszki","year":"2008","unstructured":"Vajnovszki, V.: More restrictive Gray codes for necklaces and Lyndon words. Inf. Process. Lett. 106(3), 96\u201399 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"15_CR23","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.jda.2005.07.003","volume":"4","author":"V Vajnovszki","year":"2006","unstructured":"Vajnovszki, V., Walsh, T.: A loop-free two-close Gray-code algorithm for listing $$k$$-ary Dyck words. J. Discrete Algorithms 4(4), 633\u2013648 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45066-1_5","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"T Walsh","year":"2003","unstructured":"Walsh, T.: Generating Gray codes in O(1) worst-case time per word. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 73\u201388. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45066-1_5"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0001-8708(77)90059-7","volume":"24","author":"HS Wilf","year":"1977","unstructured":"Wilf, H.S.: A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects. Adv. Math. 24, 281\u2013291 (1977)","journal-title":"Adv. Math."},{"key":"15_CR26","volume-title":"Combinatorial Algorithms: for Computers and Calculators","author":"HS Wilf","year":"1978","unstructured":"Wilf, H.S., Nijenhuis, A.: Combinatorial Algorithms: for Computers and Calculators. Academic Press, New York (1978)"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Williams, A.: The greedy Gray code algorithm. In: 13th International Symposium, WADS 2013, London, ON, Canada, 12\u201314 August 2013, Proceedings, pp. 525\u2013536 (2013)","DOI":"10.1007\/978-3-642-40104-6_46"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85088-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:05:11Z","timestamp":1630883111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85088-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850876","9783030850883"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85088-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2021.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited papers are also included","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}