{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T11:25:26Z","timestamp":1777029926171,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540345978","type":"print"},{"value":"9783540345985","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_12","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T04:37:56Z","timestamp":1148013476000},"page":"134-145","source":"Crossref","is-referenced-by-count":28,"title":["Engineering the LOUDS Succinct Tree Representation"],"prefix":"10.1007","author":[{"given":"O\u2019Neil","family":"Delpratt","sequence":"first","affiliation":[]},{"given":"Naila","family":"Rahman","sequence":"additional","affiliation":[]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","volume":"43","author":"D. Benoit","year":"2005","unstructured":"Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica\u00a043, 275\u2013292 (2005)","journal-title":"Algorithmica"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1137\/S0097539702411381","volume":"34","author":"Y.-T. Chiang","year":"2005","unstructured":"Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly spanning trees with applications. SIAM Journal on Computing\u00a034, 924\u2013945 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR3","unstructured":"Clark, D., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proc. 7th ACM-SIAM SODA, pp. 383\u2013391 (1996)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-27801-6_12","volume-title":"Combinatorial Pattern Matching","author":"R.F. Geary","year":"2004","unstructured":"Geary, R.F., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 159\u2013172. Springer, Heidelberg (2004)"},{"key":"12_CR5","unstructured":"Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. In: Proc. 15th ACM-SIAM SODA, pp. 1\u201310 (2004)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"12_CR7","series-title":"Lecture Notes in Artificial Intelligence","first-page":"315","volume-title":"Autonomous Intelligent Systems: Agents and Data Mining","author":"D.K. Kim","year":"2005","unstructured":"Kim, D.K., Na, J.C., Kim, J.E., Park, K.: Efficient implementation of Rank and Select functions for succinct representation. In: Gorodetsky, V., Liu, J., Skormin, V.A. (eds.) AIS-ADM 2005. LNCS (LNAI), vol.\u00a03505, pp. 315\u2013327. Springer, Heidelberg (2005)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 37\u201342. Springer, Heidelberg (1996)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Computing\u00a031, 762\u2013776 (2001)","journal-title":"SIAM J. Computing"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1007\/978-3-540-27836-8_84","volume-title":"Automata, Languages and Programming","author":"J.I. Munro","year":"2004","unstructured":"Munro, J.I., Rao, S.S.: Succinct representations of functions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1006\u20131015. Springer, Heidelberg (2004)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Martin, H.W., Orr, B.J.: A random binary tree generator. In: Proceedings of the 17th ACM Annual Computer Science Conference, pp. 33\u201338 (1989)","DOI":"10.1145\/75427.75429"},{"key":"12_CR12","unstructured":"http:\/\/xml.apache.org\/xindice\/FAQ"},{"key":"12_CR13","unstructured":"Centerpoint XML, \n                    \n                      http:\/\/www.cpointc.com\/XML"},{"key":"12_CR14","unstructured":"UW XML Repository, \n                    \n                      http:\/\/www.cs.washington.edu\/research\/xmldatasets\/"},{"key":"12_CR15","unstructured":"http:\/\/www.w3.org\/TR\/2000\/CR-DOM-Level-2-20000510\/traversal.html"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:10:49Z","timestamp":1619493049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11764298_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}