{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:00:58Z","timestamp":1743134458013,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031555978"},{"type":"electronic","value":"9783031555985"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-55598-5_8","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T18:01:53Z","timestamp":1709661713000},"page":"114-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generating Signed Permutations by\u00a0Twisting Two-Sided Ribbons"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Qiu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6816-4368","authenticated-orcid":false,"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s00453-022-01022-x","volume":"85","author":"B Cameron","year":"2023","unstructured":"Cameron, B., Sawada, J., Therese, W., Williams, A.: Hamiltonicity of k-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality. Algorithmica 85(3), 717\u2013744 (2023)","journal-title":"Algorithmica"},{"issue":"3\u20134","key":"8_CR2","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"},{"issue":"5","key":"8_CR3","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/71.159045","volume":"3","author":"PF Corbett","year":"1992","unstructured":"Corbett, P.F.: Rotator graphs: an efficient topology for point-to-point multiprocessor networks. IEEE Trans. Parallel Distrib. Syst. 3(5), 622\u2013626 (1992)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"8_CR4","volume-title":"Interconnection Networks","author":"J Duato","year":"2003","unstructured":"Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks. Morgan Kaufmann, Burlington (2003)"},{"key":"8_CR5","unstructured":"Duckworth, R., Stedman, F.: Tintinnalogia: Or, The Art of Ringing. London (1668)"},{"issue":"3","key":"8_CR6","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":"8_CR7","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of Genome Rearrangements","author":"G Fertin","year":"2009","unstructured":"Fertin, G., Labarre, A., Rusu, I., Vialette, S., Tannier, E.: Combinatorics of Genome Rearrangements. MIT Press, Cambridge (2009)"},{"issue":"3","key":"8_CR8","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."},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1038\/scientificamerican0872-106","volume":"227","author":"M Gardner","year":"1972","unstructured":"Gardner, M.: Curious properties of the Gray code and how it can be used to solve puzzles. Sci. Am. 227(2), 106 (1972)","journal-title":"Sci. Am."},{"key":"8_CR10","unstructured":"Gray, F.: Pulse code communication. United States Patent Number 2632058 (1953)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC 1995), pp. 178\u2013189. ACM (1995)","DOI":"10.1145\/225058.225112"},{"key":"8_CR12","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(04), 2255\u20132291 (2022)","DOI":"10.1090\/tran\/8199"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1038\/scientificamerican0872-76","volume":"227","author":"F Heath","year":"1972","unstructured":"Heath, F.: Origins of the binary code. Sci. Am. 227(2), 76\u201383 (1972)","journal-title":"Sci. Am."},{"key":"8_CR14","unstructured":"Hindenburg, C.F.: Sammlung combinatorisch-analytischer Abhandlungen, vol. 1. ben Gerhard Fleischer dem Jungern (1796)"},{"key":"8_CR15","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, 215\u2013245 (2012)","journal-title":"Algorithmica"},{"issue":"83","key":"8_CR16","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1090\/S0025-5718-1963-0159764-2","volume":"17","author":"SM Johnson","year":"1963","unstructured":"Johnson, S.M.: Generation of permutations by adjacent transposition. Math. Comput. 17(83), 282\u2013285 (1963)","journal-title":"Math. Comput."},{"key":"8_CR17","unstructured":"Knuth, D.E.: Art of Computer Programming, Volume 4, Fascicle 4, The: Generating All Trees-History of Combinatorial Generation. Addison-Wesley, Boston (2013)"},{"issue":"103","key":"8_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.2298\/PIM1103037K","volume":"89","author":"J Korsh","year":"2011","unstructured":"Korsh, J., LaFollette, P., Lipschutz, S.: A loopless implementation of a Gray code for signed permutations. Publications de l\u2019Institut Mathematique 89(103), 37\u201347 (2011)","journal-title":"Publications de l\u2019Institut Mathematique"},{"key":"8_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-031-43980-3_26","volume-title":"String Processing and Information Retrieval","author":"Z Liptak","year":"2023","unstructured":"Liptak, Z., Masillo, F., Navarro, G., Williams, A.: Constant time and space updates for the sigma-tau problem. In: Nardini, F.M., Pisanti, N., Venturini, R. (eds.) SPIRE 2023. LNCS, vol. 14240, pp. 323\u2013330. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43980-3_26"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Merino, A., Mutze, T.: Traversing combinatorial 0\/1-polytopes via optimization. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1282\u20131291 (2023)","DOI":"10.1109\/FOCS57990.2023.00076"},{"key":"8_CR21","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)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"M\u00fctze, T.: Combinatorial Gray codes-an updated survey. arXiv preprint arXiv:2202.01280 (2022)","DOI":"10.37236\/11023"},{"key":"8_CR23","unstructured":"OEIS Foundation Inc.: The On-Line Encyclopedia of Integer Sequences (2023). http:\/\/oeis.org"},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1093\/comjnl\/13.2.152","volume":"13","author":"R Ord-Smith","year":"1970","unstructured":"Ord-Smith, R.: Generation of permutation sequences: part 1. Comput. J. 13(2), 152\u2013155 (1970)","journal-title":"Comput. J."},{"key":"8_CR25","unstructured":"Qiu, Y.F.: Greedy and speedy: new iterative gray code algorithms. Bachelor\u2019s thesis, Williams College (2024)"},{"key":"8_CR26","unstructured":"Ruskey, F.: Combinatorial generation. Preliminary working draft. University of Victoria, Victoria, BC, Canada 11, 20 (2003)"},{"issue":"4","key":"8_CR27","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":"8_CR28","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.dam.2016.02.005","volume":"210","author":"J Sawada","year":"2016","unstructured":"Sawada, J., Williams, A.: Greedy flipping of pancakes and burnt pancakes. Discret. Appl. Math. 210, 61\u201374 (2016)","journal-title":"Discret. Appl. Math."},{"key":"8_CR29","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2015.09.007","volume":"609","author":"J Sawada","year":"2016","unstructured":"Sawada, J., Williams, A.: Successor rules for flipping pancakes and burnt pancakes. Theoret. Comput. Sci. 609, 60\u201375 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"8_CR30","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":"8_CR31","unstructured":"Steinhaus, H.: One hundred problems in elementary mathematics. Courier Corporation (1979)"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Stigler, S.M.: Stigler\u2019s law of eponymy. Trans. New York Acad. Sci. 39(1 Series II), 147\u2013157 (1980)","DOI":"10.1111\/j.2164-0947.1980.tb02775.x"},{"key":"8_CR33","unstructured":"Suzuki, Y., Sawada, N., Kaneko, K.: Hamiltonian cycles and paths in burnt pancake graphs. In: Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, pp. 85\u201390 (2005)"},{"issue":"8","key":"8_CR34","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1145\/368637.368660","volume":"5","author":"HF Trotter","year":"1962","unstructured":"Trotter, H.F.: Algorithm 115: perm. Commun. ACM 5(8), 434\u2013435 (1962)","journal-title":"Commun. ACM"},{"key":"8_CR35","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-13122-6_35","volume-title":"Fun with Algorithms","author":"A Williams","year":"2010","unstructured":"Williams, A.: $$O(1)$$-time unsorting by prefix-reversals in a boustrophedon linked list. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol. 6099, pp. 368\u2013379. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13122-6_35"},{"key":"8_CR36","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-40104-6_46","volume-title":"Algorithms and Data Structures","author":"A Williams","year":"2013","unstructured":"Williams, A.: The greedy Gray code algorithm. In: Dehne, F., Solis-Oba, R., Sack, J.R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 525\u2013536. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_46"},{"key":"8_CR37","unstructured":"Williams, A.: Signed-plain-changes (2024). https:\/\/gitlab.com\/combinatronics\/signed-plain-changes"},{"issue":"2","key":"8_CR38","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BF01937486","volume":"24","author":"S Zaks","year":"1984","unstructured":"Zaks, S.: A new algorithm for generation of permutations. BIT Numer. Math. 24(2), 196\u2013204 (1984)","journal-title":"BIT Numer. Math."}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55598-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T18:02:45Z","timestamp":1709661765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55598-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031555978","9783031555985"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55598-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"92","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":"44","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":"0","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":"48% - 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.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}