{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T01:46:00Z","timestamp":1767923160526,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T00:00:00Z","timestamp":1489968000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11786-017-0294-4","type":"journal-article","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T03:53:25Z","timestamp":1489982005000},"page":"177-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On Succinct Representations of Binary Trees"],"prefix":"10.1007","volume":"11","author":[{"given":"Pooya","family":"Davoodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,20]]},"reference":[{"issue":"1","key":"294_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"MI Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1), 53\u201386 (2004)","journal-title":"J. Discrete Algorithms"},{"key":"294_CR2","first-page":"84","volume-title":"ALENEX","author":"D Arroyuelo","year":"2010","unstructured":"Arroyuelo, D., C\u00e1novas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Blelloch, G.E., Halperin, D. (eds.) ALENEX, pp. 84\u201397. SIAM, New Delhi (2010)"},{"issue":"4","key":"294_CR3","doi-asserted-by":"crossref","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 43(4), 275\u2013292 (2005)","journal-title":"Algorithmica"},{"key":"294_CR4","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s11786-007-0024-4","volume":"1","author":"G Chen","year":"2008","unstructured":"Chen, G., Puglisi, S.J., Smyth, W.F.: Lempel-Ziv factorization using less time and space. Math. Comput. Sci. 1, 605\u2013623 (2008)","journal-title":"Math. Comput. Sci."},{"key":"294_CR5","doi-asserted-by":"crossref","first-page":"20130131","DOI":"10.1098\/rsta.2013.0131","volume":"372","author":"P Davoodi","year":"2014","unstructured":"Davoodi, P., Navarro, G., Raman, R., Satti, S.R.: Encoding range minima and range top-2 queries. Philos. Trans. R. Soc. A 372, 20130131 (2014)","journal-title":"Philos. Trans. R. Soc. A"},{"key":"294_CR6","doi-asserted-by":"crossref","unstructured":"Farzan, A., Munro, J. I.: A uniform approach towards succinct representation of trees. In: Proceedings 11th Scandinavian Workshop on Algorithm Theory, pp. 173\u2013184. Springer-Verlag (2008)","DOI":"10.1007\/978-3-540-69903-3_17"},{"key":"294_CR7","doi-asserted-by":"crossref","unstructured":"Farzan, A., Raman, R., Rao, S.S.: Universal succinct representations of trees? In: Proceedings 36th International Colloquium on Automata, Languages and Programming, pp. 451\u2013462. Springer (2009)","DOI":"10.1007\/978-3-642-02927-1_38"},{"issue":"2","key":"294_CR8","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"key":"294_CR9","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proceedings 16th Annual ACM Symposium on Theory of computing, pp. 135\u2013143. ACM Press (1984)","DOI":"10.1145\/800057.808675"},{"issue":"3","key":"294_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.tcs.2006.09.014","volume":"368","author":"RF Geary","year":"2006","unstructured":"Geary, R.F., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368(3), 231\u2013246 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"294_CR11","unstructured":"Georgiadis, L., Tarjan, R.E.: Finding dominators revisited: extended abstract. In Proceedings 15th Annual ACM-SIAM Symposium on Discrete algorithms, pp. 869\u2013878. SIAM (2004)"},{"key":"294_CR12","doi-asserted-by":"crossref","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: Plug and play with succinct data structures. CoRR, abs\/1311.1249, (2013)","DOI":"10.1007\/978-3-319-07959-2_28"},{"key":"294_CR13","first-page":"5","volume-title":"SEA, volume 7933 of Lecture Notes in Computer Science","author":"R Grossi","year":"2013","unstructured":"Grossi, R., Ottaviano, G.: Design of practical succinct data structures for large data collections. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA, volume 7933 of Lecture Notes in Computer Science, pp. 5\u201317. Springer, Berlin (2013)"},{"key":"294_CR14","unstructured":"Iliopoulos, C.S., Crochemore, M., Kubica, M., Rahman, M.S., Walen, T.: Improved algorithms for the range next value problem and applications. In: Proceedings 25th International Symposium on Theoretical Aspects of Computer Science, Volume\u00a01 of Leibniz International Proceedings in Informatics, pp. 205\u2013216. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2008)"},{"key":"294_CR15","unstructured":"Jacobson, G.: Succinct Static Data Structures. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1989)"},{"issue":"3","key":"294_CR16","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"JI Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comput."},{"key":"294_CR17","unstructured":"Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proceedings 13th Annual ACM-SIAM Symposium on Discrete algorithms, pp. 657\u2013666. SIAM (2002)"},{"issue":"3","key":"294_CR18","doi-asserted-by":"crossref","first-page":"16:1","DOI":"10.1145\/2601073","volume":"10","author":"G Navarro","year":"2014","unstructured":"Navarro, G., Sadakane, K.: Fully functional static and dynamic succinct trees. ACM Trans. Algorithms 10(3), 16:1\u201316:39 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"294_CR19","doi-asserted-by":"crossref","unstructured":"Patrascu, M.: Succincter. In: FOCS, pp. 305\u2013313. IEEE Computer Society (2008)","DOI":"10.1109\/FOCS.2008.83"},{"key":"294_CR20","first-page":"319","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms, Volume 8066 of Lecture Notes in Computer Science","author":"R Raman","year":"2013","unstructured":"Raman, R., Rao, S.S.: Succinct representations of ordinal trees. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms, Volume 8066 of Lecture Notes in Computer Science, pp. 319\u2013332. Springer, Berlin (2013)"},{"issue":"4","key":"294_CR21","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theory Comput. Syst. 41(4), 589\u2013607 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"294_CR22","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.jda.2006.03.011","volume":"5","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms 5(1), 12\u201322 (2007)","journal-title":"J. Discrete Algorithms"},{"issue":"9","key":"294_CR23","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.ipl.2008.12.006","volume":"109","author":"S Saxena","year":"2009","unstructured":"Saxena, S.: Dominance made simple. Inf. Process. Lett. 109(9), 419\u2013421 (2009)","journal-title":"Inf. Process. Lett."},{"key":"294_CR24","doi-asserted-by":"crossref","unstructured":"V\u00e4lim\u00e4ki, N., M\u00e4kinen, V.: Space-efficient algorithms for document retrieval. In: Proceedings 18th Annual Symposium on Combinatorial Pattern Matching, volume 4580 of LNCS, pp. 205\u2013215. Springer-Verlag (2007)","DOI":"10.1007\/978-3-540-73437-6_22"},{"issue":"4","key":"294_CR25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Commun. ACM 23(4), 229\u2013239 (1980)","journal-title":"Commun. ACM"},{"key":"294_CR26","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S Zaks","year":"1980","unstructured":"Zaks, S.: Lexicographic generation of ordered trees. Theor. Comput. Sci. 10, 63\u201382 (1980)","journal-title":"Theor. Comput. Sci."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-017-0294-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-017-0294-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-017-0294-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T23:32:45Z","timestamp":1568935965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-017-0294-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,20]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["294"],"URL":"https:\/\/doi.org\/10.1007\/s11786-017-0294-4","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,20]]}}}