{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:57Z","timestamp":1725490437553},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_45","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"509-520","source":"Crossref","is-referenced-by-count":14,"title":["Succinct Ordinal Trees Based on Tree Covering"],"prefix":"10.1007","author":[{"given":"Meng","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Srinivasa","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","unstructured":"Barbay, J., Rao, S.: Succinct encoding for XPath location steps. Technical Report CS-2006-10, University of Waterloo, Ontario, Canada (2006)"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Proc. 7th Latin American Theoretical Informatics Symp., pp. 88\u201394 (2000)","DOI":"10.1007\/10719839_9"},{"issue":"4","key":"45_CR3","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(4), 275\u2013292 (2005)","journal-title":"Algorithmica"},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-48447-7_18","volume-title":"Algorithms and Data Structures","author":"D. Benoit","year":"1999","unstructured":"Benoit, D., Demaine, E.D., Munro, J.I., Raman, V.: Representing trees of higher degree. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 169\u2013180. Springer, Heidelberg (1999)"},{"key":"45_CR5","unstructured":"Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: Proc. 12th ACM-SIAM Symp. Discrete Algorithms, pp. 506\u2013515 (2001)"},{"key":"45_CR6","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proc. 7th ACM-SIAM Symp. Discrete Algorithms, pp. 383\u2013391 (1996)"},{"issue":"4","key":"45_CR7","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/1198513.1198516","volume":"2","author":"R.F. Geary","year":"2006","unstructured":"Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. ACM Trans. Algorithms\u00a02(4), 510\u2013534 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th IEEE Symp. Found. Comput. Sci., pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"45_CR9","unstructured":"Jansson, J., Sadakane, K., Sung, W.-K.: Ultra-succinct representation of ordered trees. In: Proc. 18th ACM-SIAM Symp. Discrete Algorithms, pp. 575\u2013584 (2007)"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Lu, H.-I., Yeh, C.-C.: Balanced parentheses strike back. Accepted to ACM Trans. Algorithms (2007)","DOI":"10.1145\/1367064.1367068"},{"issue":"3","key":"45_CR11","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. Comput.\u00a031(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"45_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1151","volume":"39","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V., Rao, S.S.: Space efficient suffix trees. J. Algorithms\u00a039(2), 205\u2013222 (2001)","journal-title":"J. Algorithms"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Rao, S.S.: Succinct representations of functions. In: Proc. 31st Int. Colloquium Automata, Languages and Programming, pp. 1006\u20131015 (2004)","DOI":"10.1007\/978-3-540-27836-8_84"},{"key":"45_CR14","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th ACM-SIAM Symp. Discrete Algorithms, pp. 233\u2013242 (2002)"},{"key":"45_CR15","unstructured":"Sadakane, K.: Succinct representations of lcp information and improvements in the compressed suffix arrays. In: Proc. 13th ACM-SIAM Symp. Discrete Algorithms, pp. 225\u2013232 (2002)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:11:12Z","timestamp":1619518272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}