{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:36:38Z","timestamp":1773329798259,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540620341","type":"print"},{"value":"9783540496311","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:32:27Z","timestamp":1330295547000},"page":"37-42","source":"Crossref","is-referenced-by-count":167,"title":["Tables"],"prefix":"10.1007","author":[{"given":"J. Ian","family":"Munro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"3_CR1","first-page":"72","volume":"855","author":"A. Brodnik","year":"1994","unstructured":"A. Brodnik and J. I. Munro, Membership in Constant Time and Minimum Space, Proc. Algorithms \u2014 ESA '94, LNCS 855 (1994) 72\u201381.","journal-title":"LNCS"},{"key":"3_CR2","unstructured":"D. R. Clark, Compact Pat Trees, manuscript, University of Waterloo (1996)."},{"key":"3_CR3","unstructured":"D. R. Clark and J. I. Munro, Succinct Representation of Trees, in preparation, University of Waterloo (1996)."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R. W. Floyd","year":"1964","unstructured":"R. W. Floyd, Algorithm 245: Treesort 3, Communications of the ACM, 7 (1964) 701.","journal-title":"Communications of the ACM"},{"key":"3_CR5","unstructured":"G. H. Gonnet, R. A. Baeza-Yates and T. Snider, Lexicographic Indices for Text: Inverted Files vs. Pat Trees, Tech. Rpt. OED-91-01, Centre for the New OED, University of Waterloo (1991)."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"G. Jacobson, Space Efficient Static Trees and Graphs, Proc. 30th IEEE Symp. on Foundations of Computer Science, (1989) 549\u2013554.","DOI":"10.1109\/SFCS.1989.63533"},{"key":"3_CR7","unstructured":"G. Jacobson, Succinct Data Structures, Tech. Rpt. CMU-CS-89-112, Carnegie Mellon University (1989)."},{"key":"3_CR8","doi-asserted-by":"crossref","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 (1986) 529\u2013544.","journal-title":"Acta Informatica"},{"issue":"5","key":"3_CR9","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"U. Manber and G. Myers, Suffix Arrays: A New Method for On-Line String Searches, SIAM Journal on Computing, 22(5) (1993) 935\u2013948.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"3_CR10","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D. R. Morrison","year":"1968","unstructured":"D. R. Morrison, Patricia \u2014 Practical Algorithm to Retrieve Information Coded in Alphnumeric, Journal of the ACM, 15(4) (1968) 514\u2013534.","journal-title":"Journal of the ACM"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J. I. Munro","year":"1986","unstructured":"J. I. Munro, An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log 2n) Time, J. Computer and System Sciences, 33, (1986) 66\u201374.","journal-title":"J. Computer and System Sciences"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"J. I. Munro","year":"1980","unstructured":"J. I. Munro and H. Suwanda, Implicit Data Structures for Fast Search and Update, J. Computer and System Sciences, 21, (1980) 236\u2013250.","journal-title":"J. Computer and System Sciences"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"R. C. Read, The Coding of Various Kinds of Unlabelled Trees, In R. C. Read (ed.) Graph Theory and Computing, Academic Press, (1972) 153\u2013182.","DOI":"10.1016\/B978-1-4832-3187-7.50017-9"},{"issue":"1","key":"3_CR14","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1006\/jagm.1993.1031","volume":"15","author":"R. Schaffer","year":"1993","unstructured":"R. Schaffer and R. Sedgewick, The Analysis of Heapsort, Journal of Algorithms, 15(1), (1993) 76\u2013100.","journal-title":"Journal of Algorithms"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear Pattern Match Algorithms, Proc. 14th IEEE Symp. on Switching and Automata Theory, (1973) 1\u201311.","DOI":"10.1109\/SWAT.1973.13"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J. W. J. Williams","year":"1964","unstructured":"J. W. J. Williams, Algorithm 232, Heapsort, Communications of the ACM, 7 (1964) 347\u2013348.","journal-title":"Communications of the ACM"},{"issue":"1","key":"3_CR17","doi-asserted-by":"crossref","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(1), (1980) 63\u201382.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:10:32Z","timestamp":1640949032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}