{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:11:54Z","timestamp":1725869514313},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_37","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"505-518","source":"Crossref","is-referenced-by-count":1,"title":["Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order"],"prefix":"10.1007","author":[{"given":"Kung-Jui","family":"Pai","sequence":"first","affiliation":[]},{"given":"Ro-Yu","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Shun-Chieh","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","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. Inf. Process. Lett. 86, 107\u2013112 (2003)","journal-title":"Inf. Process. Lett."},{"key":"37_CR2","doi-asserted-by":"crossref","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":"37_CR3","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1093\/comjnl\/30.6.569","volume":"30","author":"MC Er","year":"1987","unstructured":"Er, M.C.: Lexicographic listing and ranking $$t$$ -ary trees. Comput. J. 30, 569\u2013572 (1987)","journal-title":"Comput. J."},{"key":"37_CR4","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/j.tcs.2007.07.041","volume":"387","author":"A Golynski","year":"2007","unstructured":"Golynski, A.: Optimal lower bounds for rank and select indexes. Theor. Comput. Sci. 387, 348\u2013359 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR5","volume-title":"The Art of Computer Programming: Fascicle 4A - Generating All Trees","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":"37_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/1150334.1150335","volume":"2","author":"JF Korsh","year":"2006","unstructured":"Korsh, J.F., LaFollette, P.: A loopless Gray code for rooted trees. ACM Trans. Algorithms 2, 135\u2013152 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1006\/jagm.1993.1045","volume":"15","author":"JM Lucas","year":"1993","unstructured":"Lucas, J.M., van Baronaigien, R., Ruskey, F.: On rotations and the generation. J. Algorithms 15, 343\u2013366 (1993)","journal-title":"J. Algorithms"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01934181","volume":"27","author":"E M\u00e4kinen","year":"1987","unstructured":"M\u00e4kinen, E.: Left distance binary tree representations. BIT 27, 163\u2013169 (1987)","journal-title":"BIT"},{"key":"37_CR9","doi-asserted-by":"crossref","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":"37_CR10","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.tcs.2007.07.013","volume":"387","author":"V M\u00e4kinen","year":"2007","unstructured":"M\u00e4kinen, V., Navarro, G.: Rank and select revisited and extended. Theor. Comput. Sci. 387, 332\u2013347 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR11","doi-asserted-by":"crossref","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":"37_CR12","doi-asserted-by":"crossref","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":"37_CR13","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/0207034","volume":"7","author":"F Ruskey","year":"1978","unstructured":"Ruskey, F.: Generating $$t$$ -ary trees lexicographically. SIAM J. Comput. 7, 424\u2013439 (1978)","journal-title":"SIAM J. Comput."},{"key":"37_CR14","doi-asserted-by":"crossref","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":"37_CR15","doi-asserted-by":"crossref","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":"37_CR16","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1137\/0207039","volume":"7","author":"AE Trojanowaki","year":"1978","unstructured":"Trojanowaki, A.E.: Ranking and listing algorithms for $$k$$ -ary trees. SIAM J. Comput. 7, 492\u2013509 (1978)","journal-title":"SIAM J. Comput."},{"key":"37_CR17","doi-asserted-by":"crossref","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. Inf. Process. Lett. 68, 113\u2013117 (1998)","journal-title":"Inf. Process. Lett."},{"key":"37_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(91)90178-K","volume":"39","author":"DR Baronaigien van","year":"1991","unstructured":"van Baronaigien, D.R.: A loopless algorithm for generating binary tree sequences. Inf. Process. Lett. 39, 189\u2013194 (1991)","journal-title":"Inf. Process. Lett."},{"key":"37_CR19","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 556, 25\u201333 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR20","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1016\/j.mcm.2010.12.019","volume":"53","author":"R-Y Wu","year":"2011","unstructured":"Wu, R.-Y., Chang, J.-M., Chang, C.-H.: Ranking and unranking of non-regular trees with a prescribed branching sequence. Math. Comput. Model 53, 1331\u20131335 (2011)","journal-title":"Math. Comput. Model"},{"key":"37_CR21","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1587\/transfun.E96.A.1059","volume":"E96\u2013A","author":"R-Y Wu","year":"2013","unstructured":"Wu, R.-Y., Chang, J.-M., Chen, A.-H., Ko, M.-T.: Ranking and unranking of non-regular trees in Gray-code order. IEICE Trans. Fund. E96\u2013A, 1059\u20131065 (2013)","journal-title":"IEICE Trans. Fund."},{"key":"37_CR22","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1093\/comjnl\/bxs143","volume":"56","author":"R-Y Wu","year":"2013","unstructured":"Wu, R.-Y., Chang, J.-M., Chen, A.-H., Liu, C.-L.: Ranking and unranking $$t$$ -ary trees in a Gray-code order. Comput. J. 56, 1388\u20131395 (2013)","journal-title":"Comput. J."},{"key":"37_CR23","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 355, 303\u2013314 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR24","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1093\/comjnl\/bxp015","volume":"53","author":"R-Y Wu","year":"2010","unstructured":"Wu, R.-Y., Chang, J.-M., Wang, Y.-L.: Loopless generation of non-regular trees with a prescribed branching sequence. Comput. J. 53, 661\u2013666 (2010)","journal-title":"Comput. J."},{"key":"37_CR25","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1587\/transinf.E94.D.226","volume":"E94\u2013D","author":"R-Y Wu","year":"2011","unstructured":"Wu, R.-Y., Chang, J.-M., Wang, Y.-L.: Ranking and unranking of $$t$$ -ary trees using RD-sequences. IEICE Trans. Inf. Syst. E94\u2013D, 226\u2013232 (2011)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"37_CR26","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0020-0190(00)00139-3","volume":"76","author":"L Xiang","year":"2000","unstructured":"Xiang, L., Ushijima, K., Tang, C.: Efficient loopless generation of Gray codes for $$k$$ -ary trees. Inf. Process. Lett. 76, 169\u2013174 (2000)","journal-title":"Inf. Process. Lett."},{"key":"37_CR27","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 10, 63\u201382 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR28","doi-asserted-by":"crossref","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."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:24:37Z","timestamp":1498343077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}