{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:56Z","timestamp":1759637576987},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223412"},{"type":"electronic","value":"9783540278016"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27801-6_12","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:15Z","timestamp":1283727615000},"page":"159-172","source":"Crossref","is-referenced-by-count":10,"title":["A Simple Optimal Representation for Balanced Parentheses"],"prefix":"10.1007","author":[{"given":"Richard F.","family":"Geary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naila","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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.J., 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":"12_CR2","unstructured":"Benoit, D.A., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. TR 2001\/46, Dept. of Maths & CS, University of Leicester (2001)"},{"key":"12_CR3","unstructured":"Centerpoint XML.: \n                  \n                    http:\/\/www.cpointc.com\/XML"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/DCC.2001.917147","volume-title":"Proc. Data Compression Conference (DCC 2001)","author":"J. Cheney","year":"2001","unstructured":"Cheney, J.: Compressing XML with multiplexed hierarchical PPM models. In: Proc. Data Compression Conference (DCC 2001), pp. 163\u2013172. IEEE Computer Society, Los Alamitos (2001)"},{"key":"12_CR5","unstructured":"Chupa, K.: MMath Thesis, University of Waterloo (1997)"},{"key":"12_CR6","unstructured":"Clark, D., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proc. 7th ACM-SIAM SODA, pp. 383\u2013391 (1996)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/spe.4380230305","volume":"23","author":"J.J. Darragh","year":"1993","unstructured":"Darragh, J.J., Cleary, J.G., Witten, I.H.: Bonsai: a compact representation of trees. Software-Practice and Experience\u00a023, 277\u2013291 (1993)","journal-title":"Software-Practice and Experience"},{"key":"12_CR8","unstructured":"Le Hors, P., Le H\u00e9garet, L., Wood, G., Nicol, J., Robie, M., Champion, S.: Byrne. Document Object Model (DOM) Level 2 Core Specification Version 1.0. W3C Recommendation November 13 (2000), \n                  \n                    http:\/\/www.w3.org\/TR\/DOM-Level-2-Core\n                  \n                  \n                 W3C Consortium (2000)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0020-0255(01)00098-6","volume":"135","author":"P. Ferragina","year":"2001","unstructured":"Ferragina, P., Manzini, G.: An experimental study of a compressed index. Information Sciences\u00a0135, 13\u201328 (2001)","journal-title":"Information Sciences"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with O(1) worst case access time. J. ACM\u00a031, 538\u2013544 (1984)","journal-title":"J. ACM"},{"key":"12_CR11","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_CR12","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: When indexing equals compression: Experiments on suffix arrays and trees. In: Proc. 15th ACM-SIAM SODA, pp. 629\u2013638 (2004)"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1171","volume":"41","author":"T. Hagerup","year":"2001","unstructured":"Hagerup, T., Miltersen, P.B., Pagh, R.: deterministic dictionaries. Journal of Algorithms\u00a041(1), 69\u201385 (2001)","journal-title":"Journal of Algorithms"},{"key":"12_CR14","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_CR15","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_CR16","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_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-45061-0_29","volume-title":"Automata, Languages and Programming","author":"I. Munro","year":"2003","unstructured":"Munro, I., Raman, R., Raman, V., Rao, S.S.: Succinct representation of Permutations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 345\u2013356. Springer, Heidelberg (2003)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1151","volume":"39","author":"I. Munro","year":"2001","unstructured":"Munro, I., Raman, V., Rao, S.S.: Space Efficient Suffix Trees. J. of Algorithms\u00a039, 205\u2013222 (2001)","journal-title":"J. of Algorithms"},{"key":"12_CR19","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 SODA, pp. 233\u2013242 (2002)"},{"key":"12_CR20","unstructured":"Sadakane, K.: Succinct representations of lcp information and improvements in the compressed suffix arrays. In: Proc. 13th ACM-SIAM SODA, pp. 225\u2013232 (2002)"},{"key":"12_CR21","unstructured":"UW XML Repository, \n                  \n                    http:\/\/www.cs.washington.edu\/research\/xmldatasets\/"},{"key":"12_CR22","unstructured":"http:\/\/cdsweb.u-strasbg.fr\/doc\/VOTable\/"},{"key":"12_CR23","unstructured":"http:\/\/xml.apache.org\/xindice\/FAQ"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27801-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:51Z","timestamp":1620012411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27801-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223412","9783540278016"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27801-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}