{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:47Z","timestamp":1725664487805},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:04:34Z","timestamp":1330290274000},"page":"581-592","source":"Crossref","is-referenced-by-count":1,"title":["Ranking and unranking trees using regular reductions"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Kelsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"47_CR1","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1974."},{"key":"47_CR2","first-page":"263","volume":"146","author":"G.M. Adel'son-Vel'skii","year":"1962","unstructured":"G.M. Adel'son-Vel'skii and Y.M. Landis, An algorithm for the organization of information, Doklad. Akad. Nauk SSSR, 146 (1962), pp. 263\u2013266; Soviet math. Dokl., 3 (1962), pp. 1259\u20131262.","journal-title":"Doklad. Akad. Nauk SSSR"},{"key":"47_CR3","volume-title":"Principles of combinatorics","author":"C. Berge","year":"1971","unstructured":"C. Berge, Principles of combinatorics, Academic Press, New York, 1971."},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer and E. McCreight, Organization and maintenance of large ordered indexes, Acta Inform. 1 (1972), pp. 173\u2013189.","journal-title":"Acta Inform."},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0196-6774(83)90034-2","volume":"4","author":"U.I. Gupta","year":"1983","unstructured":"U.I. Gupta, D.T. Lee and C.K. Wong, Ranking and unranking of B-trees, Journal of Algorithms 4(1983), pp. 51\u201360.","journal-title":"Journal of Algorithms"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1137\/0211049","volume":"11","author":"U.I. Gupta","year":"1982","unstructured":"U.I. Gupta, D.T. Lee and C.K. Wong, Ranking and unranking of 2\u20133 trees, SIAM J. Comput. 11(1982), pp. 582\u2013590.","journal-title":"SIAM J. Comput."},{"key":"47_CR7","unstructured":"P. Kelsen, Ranking and unranking trees using regular reductions, Technical Report 93-37, Department of Computer Science, University of British Columbia, 1993."},{"key":"47_CR8","volume-title":"The art of computer programming, vol. 3: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth, The art of computer programming, vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973."},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/0215073","volume":"15","author":"L. Li","year":"1986","unstructured":"L. Li, Ranking and unranking of AVL-trees, SIAM J. Comput. 15 (1986), pp. 1025\u20131035.","journal-title":"SIAM J. Comput."},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/BF00288468","volume":"23","author":"C.C Lee","year":"1986","unstructured":"C.C Lee, D.T. Lee and C.K. Wong, Generating binary trees of bounded height, Acta Informatica 23, 529\u2013544 (1986).","journal-title":"Acta Informatica"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1137\/0206055","volume":"6","author":"F. Ruskey","year":"1977","unstructured":"F. Ruskey and T.C. Hu, Generating binary trees lexicographically, SIAM J. Comput. 6 (1977), pp. 745\u2013758.","journal-title":"SIAM J. Comput."},{"key":"47_CR12","first-page":"53","volume":"41","author":"F. Ruskey","year":"1984","unstructured":"F. Ruskey and D. Roelants van Baronaigien, Fast recursive algorithms for generating combinatorial objects, Congressus Numerantium, vol. 41 (1984), pp. 53\u201362.","journal-title":"Congressus Numerantium"},{"key":"47_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0001-8708(77)90059-7","volume":"24","author":"H. Wilf","year":"1977","unstructured":"H. Wilf, A unified setting for sequencing, ranking and selection algorithms for combinatorial objects, Advances in Mathematics, 24 (1977), pp.281\u2013291.","journal-title":"Advances in Mathematics"},{"key":"47_CR14","volume-title":"Lecture Notes in Mathematics, 579","author":"S.G. Williamson","year":"1976","unstructured":"S.G. Williamson, On the ordering, ranking and random generation of basic combinatorial sets, Lecture Notes in Mathematics, 579, Springer-Verlag, Berlin, 1976."},{"key":"47_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S. Zaks","year":"1980","unstructured":"S. Zaks, Lexicographic generation of ordered trees, Theoretical Computer Science 10 (1980), pp, 63\u201382.","journal-title":"Theoretical Computer Science"},{"key":"47_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0208006","volume":"8","author":"S. Zaks","year":"1979","unstructured":"S. Zaks, Generating trees and other combinatorial objects lexicographically, SIAM J. Comput. 8 (1979), pp. 73\u201381.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:28:12Z","timestamp":1619573292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}