{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:12:26Z","timestamp":1758823946369,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662792"},{"type":"electronic","value":"9783540484479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48447-7_18","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:42:14Z","timestamp":1194990134000},"page":"169-180","source":"Crossref","is-referenced-by-count":10,"title":["Representing Trees of Higher Degree"],"prefix":"10.1007","author":[{"given":"David","family":"Benoit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Ian Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"18_CR1","unstructured":"David Benoit. Compact Tree Representations. MMath thesis, U. Waterloo, 1998."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Andrej Brodnik and J. Ian Munro. Membership in constant time and almost minimum space. SIAM J. Computing, to appear.","DOI":"10.1137\/S0097539795294165"},{"key":"18_CR3","unstructured":"David Clark. Compact Pat Trees. PhD thesis, U. Waterloo, 1996."},{"key":"18_CR4","unstructured":"David R. Clark and J. Ian Munro. Efficient suffix trees on secondary storage. In Proc. ACM-SIAM Symposium on Discrete Algorithms, 383\u2013391, 1996."},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/spe.4380230305","volume":"23","author":"J. J. Darragh","year":"1993","unstructured":"John J. Darragh, John G. Cleary, and Ian H. Whitten. Bonsai: a compact representation of trees. Software|Practice and Experience, 23(3):277\u2013291, March 1993.","journal-title":"Software|Practice and Experience"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0222001","volume":"22","author":"A. Fiat","year":"1993","unstructured":"A. Fiat and M. Naor. Implicit O(1) probe search. SIAM J. Computing, 22(1):1\u201310, January 1993.","journal-title":"SIAM J. Computing"},{"issue":"4","key":"18_CR7","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1145\/146585.146591","volume":"39","author":"A. Fiat","year":"1992","unstructured":"A. Fiat, M. Naor, J. P. Schmidt, and A. Siegel. Nonoblivious hashing. J. ACM, 39(4):764\u2013782, April 1992.","journal-title":"J. ACM"},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"Michael L. Fredman, J\u00e1nos Koml\u00f3s, and Endre Szemer\u00e9di. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538\u2013544, July 1984.","journal-title":"J. ACM"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M. L. Fredman","year":"1993","unstructured":"Michael L. Fredman and Dan E. Willard. Surpassing the information theoretic bound with fusion trees. J. Computer and System Sciences, 47(3):424\u2013436, 1993.","journal-title":"J. Computer and System Sciences"},{"key":"18_CR10","unstructured":"G. H. Gonnet, R.A. Baeza-Yates, and T. Snider. New indicies for text: PAT trees and PAT arrays. In Information Retrieval: Data Structures & Algorithms, 66\u201382, Prentice Hall, 1992."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Guy Jacobson. Space-efficient static trees and graphs. In Proc. 30th Annual Symposium on Foundations of Computer Science, 549\u2013554, 1989.","DOI":"10.1109\/SFCS.1989.63533"},{"key":"18_CR12","unstructured":"Guy Jacobson. Succinct Static Data Structures. PhD thesis, CMU, 1989."},{"issue":"5","key":"18_CR13","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Udi Manber and Gene Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Computing, 22(5):935\u2013948, 1993.","journal-title":"SIAM J. Computing"},{"key":"18_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Proc. 16th Conf. on the Foundations of Software Technology and Theoretical Computer Science","author":"J. Munro Ian","year":"1996","unstructured":"J. Ian Munro. Tables. In Proc. 16th Conf. on the Foundations of Software Technology and Theoretical Computer Science, LNCS vol. 1180, 37\u201342, Springer, 1996."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In Proc. 38th Annual Symposium on Foundations of Computer Science, 118\u2013126, 1997.","DOI":"10.1109\/SFCS.1997.646100"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48447-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:29:25Z","timestamp":1737534565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48447-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662792","9783540484479"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48447-7_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}