{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T04:09:23Z","timestamp":1794542963143,"version":"4.9.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319596044","type":"print"},{"value":"9783319596051","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59605-1_20","type":"book-chapter","created":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T11:06:26Z","timestamp":1495451186000},"page":"221-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order"],"prefix":"10.1007","author":[{"given":"Kung-Jui","family":"Pai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ro-Yu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,23]]},"reference":[{"key":"20_CR1","unstructured":"Adamchuk, A.: A014138. The On-Line Encyclopedia of Integer Sequences (2006). http:\/\/oeis.org\/A014138"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jalgor.2004.01.002","volume":"54","author":"JM Boyer","year":"2005","unstructured":"Boyer, J.M.: Simple constant amortized time generation of fixed length numeric partitions. J. Algorithms 54, 31\u201339 (2005)","journal-title":"J. Algorithms"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(02)00481-7","volume":"86","author":"S Effler","year":"2003","unstructured":"Effler, S., Ruskey, F.: A CAT algorithm for generating permutations with a fixed number of inversions. Inform. Process. Lett. 86, 107\u2013112 (2003)","journal-title":"Inform. Process. Lett."},{"key":"20_CR4","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, 500\u2013513 (1973)","journal-title":"J. ACM"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.tcs.2004.06.018","volume":"326","author":"A Gibbons","year":"2004","unstructured":"Gibbons, A., Sant, P.: Rotation sequences and edge-colouring of binary tree pairs. Theor. Comput. Sci. 326, 409\u2013418 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s004540010017","volume":"24","author":"L Guibas","year":"2000","unstructured":"Guibas, L., Hershberger, J., Suri, S.: Morphing simple polygons. Discret. Comput. Geometry 24, 1\u201334 (2000)","journal-title":"Discret. Comput. Geometry"},{"key":"20_CR7","unstructured":"Hershberger, J., Suri, S.: Morphing binary trees. In: Proceedings of the ACM-SIAM Sixth Annual Symposium on Discrete Algorithms (SODA), pp. 396\u2013404 (1995)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Kensler, A.: Tree rotations for improving bounding volume hierarchies. In: IEEE Symposium on Interactive Ray Tracing, pp. 73\u201376. IEEE Computer Society, Washington (2008)","DOI":"10.1109\/RT.2008.4634624"},{"key":"20_CR9","series-title":"Fascicle 4A - Generating All Trees","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fascicle 4A - Generating All Trees, vol. 4. Addison-Wesley, Boston (2005)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1006\/jagm.1993.1045","volume":"15","author":"JM Lucas","year":"1993","unstructured":"Lucas, J.M., van Baronaigien, D.R., Ruskey, F.: On rotations and the generation of binary trees. J. Algorithms 15, 343\u2013366 (1993)","journal-title":"J. Algorithms"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1093\/comjnl\/34.5.438","volume":"34","author":"E M\u00e4kinen","year":"1991","unstructured":"M\u00e4kinen, E.: A survey on binary tree codings. Comput. J. 34, 438\u2013443 (1991)","journal-title":"Comput. J."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-319-48749-6_37","volume-title":"Combinatorial Optimization and Applications","author":"K-J Pai","year":"2016","unstructured":"Pai, K.-J., Wu, R.-Y., Chang, J.-M., Chang, S.-C.: Amortized efficiency of ranking and unranking left-child sequences in lexicographic order. In: Chan, T.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 505\u2013518. Springer, Cham (2016). doi:10.1007\/978-3-319-48749-6_37"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1093\/comjnl\/29.2.171","volume":"29","author":"J Pallo","year":"1986","unstructured":"Pallo, J.: Enumerating, ranking and unranking binary trees. Comput. J. 29, 171\u2013175 (1986)","journal-title":"Comput. J."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0196-6774(85)90040-9","volume":"6","author":"A Proskurowski","year":"1985","unstructured":"Proskurowski, A., Ruskey, F.: Binary tree Gray codes. J. Algorithms 6, 225\u2013238 (1985)","journal-title":"J. Algorithms"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0020-0190(91)90178-K","volume":"39","author":"DR van Baronaigien","year":"1991","unstructured":"van Baronaigien, D.R.: A loopless algorithm for generating binary tree sequences. Inform. Process. Lett. 39, 189\u2013194 (1991)","journal-title":"Inform. Process. Lett."},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1137\/0206055","volume":"6","author":"F Ruskey","year":"1977","unstructured":"Ruskey, F., Hu, T.C.: Generating binary trees lexicographically. SIAM J. Comput. 6, 745\u2013758 (1977)","journal-title":"SIAM J. Comput."},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"CD Savage","year":"1997","unstructured":"Savage, C.D.: A survey of combinatorial Gray codes. SIAM Rev. 39, 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1137\/S0097539700377037","volume":"31","author":"J Sawada","year":"2001","unstructured":"Sawada, J.: Generating bracelets in constant amortized time. SIAM Comput. 31, 259\u2013268 (2001)","journal-title":"SIAM Comput."},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0020-0190(98)00155-0","volume":"68","author":"V Vajnovszki","year":"1998","unstructured":"Vajnovszki, V.: On the loopless generation of binary tree sequences. Inform. Process. Lett. 68, 113\u2013117 (1998)","journal-title":"Inform. Process. Lett."},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2014.07.030","volume":"556","author":"R-Y Wu","year":"2014","unstructured":"Wu, R.-Y., Chang, J.-M., Chan, H.-C., Pai, K.-J.: A loopless algorithm for generating multiple binary tree sequences simultaneously. Theoret. Comput. Sci. 556, 25\u201333 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.tcs.2006.01.022","volume":"355","author":"R-Y Wu","year":"2006","unstructured":"Wu, R.-Y., Chang, J.-M., Wang, Y.-L.: A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations. Theoret. Comput. Sci. 355, 303\u2013314 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S Zaks","year":"1980","unstructured":"Zaks, S.: Lexicographic generation of ordered trees. Theoret. Comput. Sci. 10, 63\u201382 (1980)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0208006","volume":"8","author":"S Zaks","year":"1979","unstructured":"Zaks, S., Richards, D.: Generating trees and other combinatorial objects lexicographically. SIAM J. Comput. 8, 73\u201381 (1979)","journal-title":"SIAM J. Comput."},{"key":"20_CR24","unstructured":"Zumkeller, R.: A014138. The On-Line Encyclopedia of Integer Sequences (2010). http:\/\/oeis.org\/A014138"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59605-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:26:56Z","timestamp":1710329216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59605-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596044","9783319596051"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59605-1_20","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-59605-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/faw2017.uestc.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}