{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:04Z","timestamp":1780783144572,"version":"3.54.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_33","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:00Z","timestamp":1780780500000},"page":"470-485","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["One Sequence to\u00a0Rule Them All: $$\\mathcal {O}(1)$$-Time Parallel Generation of\u00a0Mixed-Radix Gray Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1763-2584","authenticated-orcid":false,"given":"Lucia","family":"Moura","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prangya","family":"Parida","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4336-1773","authenticated-orcid":false,"given":"Brett","family":"Stevens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6816-4368","authenticated-orcid":false,"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"issue":"2","key":"33_CR1","first-page":"7","volume":"1","author":"M Aigner","year":"1999","unstructured":"Aigner, M., Ziegler, G.M.: Proofs from the book. Berlin. Germany 1(2), 7 (1999)","journal-title":"Proofs from the book. Berlin. Germany"},{"issue":"9","key":"33_CR2","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/360336.360343","volume":"19","author":"JR Bitner","year":"1976","unstructured":"Bitner, J.R., Ehrlich, G., Reingold, E.M.: Efficient generation of the binary reflected gray code and its applications. Commun. ACM 19(9), 517\u2013521 (1976)","journal-title":"Commun. ACM"},{"issue":"7","key":"33_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.3390\/a17070311","volume":"17","author":"S Bouyuklieva","year":"2024","unstructured":"Bouyuklieva, S., Bouyukliev, I., Bakoev, V., Pashinska-Gadzheva, M.: Generating $$m$$-ARY gray codes and related algorithms. Algorithms 17(7), 311 (2024)","journal-title":"Algorithms"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Brenner, S., Cardinal, J., McConville, T., Merino, A., M\u00fctze, T.: Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements. Eur. J. Combinatorics 135, 104367 (2026)","DOI":"10.1016\/j.ejc.2026.104367"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/S0019-9958(63)90119-0","volume":"6","author":"M Cohn","year":"1963","unstructured":"Cohn, M.: Affine $$m$$-ARY Gray codes. Inf. Control 6(1), 70\u201378 (1963)","journal-title":"Inf. Control"},{"issue":"3\u20134","key":"33_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1080\/03081089308818261","volume":"35","author":"RC Compton","year":"1993","unstructured":"Compton, R.C., Gill Williamson, S.: Doubly adjacent gray codes for the symmetric group. Linear Multilinear Algebra 35(3\u20134), 237\u2013293 (1993)","journal-title":"Linear Multilinear Algebra"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.61091\/jcmcc126-12","volume":"126","author":"M Cooke","year":"2025","unstructured":"Cooke, M., North, C., Dewar, M., Stevens, B.: A note on Beckett-gray codes and the relationship of Gray codes to data structures. J. Comb. Math. Comb. Comput. 126, 195\u2013200 (2025)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"33_CR8","unstructured":"Duckworth, R.: Tintinnalogia, or, the art of ringing (2010). Project Gutenberg"},{"issue":"3","key":"33_CR9","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":"33_CR10","unstructured":"Figueroa, A.I.M.: Combinatorial generation: greedy approaches and symmetry. Technische Universitaet, Berlin (Germany (2023)"},{"issue":"2","key":"33_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/TEC.1956.5219803","volume":"5","author":"I Flores","year":"1956","unstructured":"Flores, I.: Reflected number systems. IRE Trans. Electron. Comput. 5(2), 79\u201382 (1956)","journal-title":"IRE Trans. Electron. Comput."},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1093\/comjnl\/bxab181","volume":"66","author":"P Ganapathi","year":"2023","unstructured":"Ganapathi, P., Chowdhury, R.: A unified framework to discover permutation generation algorithms. Comput. J. 66(3), 603\u2013614 (2023)","journal-title":"Comput. J."},{"key":"33_CR13","unstructured":"Gray, F.: Pulse code communication. United States Patent Number, p. 2632058 (1953)"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.19086\/da.3659","volume":"8","author":"P Gregor","year":"2018","unstructured":"Gregor, P., M\u00fctze, T., Nummenpalo, J.: A short proof of the middle levels theorem. Discrete Anal. 8, 1\u201312 (2018)","journal-title":"Discrete Anal."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Hartung, E., Hoang, H., M\u00fctze, T., Williams, A.: Combinatorial generation via permutation languages. I. Fundamentals. Trans. Am. Math. Soc. 375(4), 2255\u20132291 (2022)","DOI":"10.1090\/tran\/8199"},{"issue":"2","key":"33_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00453-011-9544-z","volume":"64","author":"AE Holroyd","year":"2012","unstructured":"Holroyd, A.E., Ruskey, F., Williams, A.: Shorthand universal cycles for permutations. Algorithmica 64(2), 215\u2013245 (2012)","journal-title":"Algorithmica"},{"key":"33_CR17","volume-title":"The art of computer programming, volumes 1\u20134B","author":"DE Knuth","year":"2022","unstructured":"Knuth, D.E.: The art of computer programming, volumes 1\u20134B. Combinatorial Algorithms. Addison-Wesley Professional, Boxed Set (2022)"},{"issue":"12","key":"33_CR18","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1016\/0898-1221(89)90052-7","volume":"17","author":"CJ Lin","year":"1989","unstructured":"Lin, C.J.: A parallel algorithm for generating combinations. Comput. Math. Appl. 17(12), 1523\u20131533 (1989)","journal-title":"Comput. Math. Appl."},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Liu, B., Wong, D., Lam, C.T., Im, S.K.: Generating pivot gray codes for spanning trees of complete graphs in constant amortized time. In: Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 833\u2013870. SIAM (2026)","DOI":"10.1137\/1.9781611978971.33"},{"key":"33_CR20","unstructured":"Merino, A., Mutze, T., Williams, A.: All your bases are belong to us: listing all bases of a matroid by greedy exchanges. In: 11th International Conference on Fun with Algorithms (FUN 2022), vol. 226, p. 22. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"4","key":"33_CR21","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1112\/plms\/pdw004","volume":"112","author":"T M\u00fctze","year":"2016","unstructured":"M\u00fctze, T.: Proof of the middle levels conjecture. Proc. Lond. Math. Soc. 112(4), 677\u2013713 (2016)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"1","key":"33_CR22","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00493-023-00070-3","volume":"44","author":"T M\u00fctze","year":"2024","unstructured":"M\u00fctze, T.: A book proof of the middle levels theorem. Combinatorica 44(1), 205\u2013208 (2024)","journal-title":"Combinatorica"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"M\u00fctze, T.: Combinatorial gray codes: an updated survey. Electron. J. combinatorics DS26 (2024)","DOI":"10.37236\/11023"},{"key":"33_CR24","unstructured":"OEIS foundation inc.: the on-line encyclopedia of integer sequences (2026). http:\/\/oeis.org"},{"key":"33_CR25","unstructured":"Parida, P.: Cover-free families on graphs and hypergraphs, University of Ottawa (2026)"},{"key":"33_CR26","unstructured":"Parida, P., Williams, A.: Mixed-radix ruler sequence gray codes (2026). https:\/\/github.com\/ppari017\/Mixed-radix-Ruler-Sequence-Gray-Codes"},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Qiu, Y., Sawada, J., Williams, A.: Maximize the rightmost digit: gray codes for restricted growth strings. In: International Conference and Workshops on Algorithms and Computation, pp. 296\u2013311. Springer (2025)","DOI":"10.1007\/978-981-96-2845-2_19"},{"key":"33_CR28","doi-asserted-by":"crossref","unstructured":"Qiu, Y., Williams, A.: Generating signed permutations by twisting two-sided ribbons. In: Latin American Symposium on Theoretical Informatics, pp. 114\u2013129. Springer (2024)","DOI":"10.1007\/978-3-031-55598-5_8"},{"key":"33_CR29","unstructured":"Qiu, Y.F.: Greedy and speedy: new gray code algorithms for generating signed permutations. Bachelor\u2019s thesis, Williams College (2024)"},{"issue":"10","key":"33_CR30","doi-asserted-by":"publisher","first-page":"694","DOI":"10.2307\/2302451","volume":"45","author":"J Rosenbaum","year":"1938","unstructured":"Rosenbaum, J.: Elementary problem E319. Am. Math. Mon. 45(10), 694\u2013696 (1938)","journal-title":"Am. Math. Mon."},{"key":"33_CR31","unstructured":"Ruskey, F.: Combinatorial generation. Working version (2003). 1j-CSC 425\/520"},{"issue":"4","key":"33_CR32","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial gray codes. SIAM Rev. 39(4), 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"key":"33_CR33","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.tcs.2022.08.024","volume":"933","author":"J Sawada","year":"2022","unstructured":"Sawada, J., Williams, A., Wong, D.: Flip-swap languages in binary reflected Gray code order. Theoret. Comput. Sci. 933, 138\u2013148 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR34","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.endm.2007.07.091","volume":"29","author":"J Sawada","year":"2007","unstructured":"Sawada, J., Wong, D.C.H.: A fast algorithm to generate Beckett-gray codes. Electron. Notes Discrete Math. 29, 571\u2013577 (2007)","journal-title":"Electron. Notes Discrete Math."},{"issue":"2","key":"33_CR35","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/356689.356692","volume":"9","author":"R Sedgewick","year":"1977","unstructured":"Sedgewick, R.: Permutation generation methods. ACM Comput. Surv. (CSUR) 9(2), 137\u2013164 (1977)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"33_CR36","unstructured":"Stibitz, G.: Binary counter. United States Patent Number, p. 2307868 (1943)"},{"key":"33_CR37","doi-asserted-by":"crossref","unstructured":"Walsh, T.: Generating gray codes in $$O(1)$$ worst-case time per word. In: International Conference on Discrete Mathematics and Theoretical Computer Science, pp. 73\u201388. Springer (2003)","DOI":"10.1007\/3-540-45066-1_5"},{"key":"33_CR38","unstructured":"Walsh, T.R.: A simple sequencing and ranking method that works on almost all Gray codes. Dept. Math. Comput. Sci. Universit\u00e9 du Qu\u00e9beca Montr\u00e9al Res. Rep. 243, 53 (1995)"},{"key":"33_CR39","doi-asserted-by":"crossref","unstructured":"Williams, A.: $$O(1)$$-time unsorting by prefix-reversals in a boustrophedon linked list. In: International Conference on Fun with Algorithms, pp. 368\u2013379. Springer (2010)","DOI":"10.1007\/978-3-642-13122-6_35"},{"key":"33_CR40","doi-asserted-by":"crossref","unstructured":"Williams, A.: The greedy gray code algorithm. In: Workshop on Algorithms and Data Structures, pp. 525\u2013536. Springer (2013)","DOI":"10.1007\/978-3-642-40104-6_46"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:07Z","timestamp":1780780507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}