{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:29:32Z","timestamp":1761611372217,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_1","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Construction of Succinct Trees"],"prefix":"10.1007","author":[{"given":"Leo","family":"Ferres","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Fuentes-Sep\u00falveda","sequence":"additional","affiliation":[]},{"given":"Meng","family":"He","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., C\u00e1novas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: ALENEX, pp. 84\u201397. SIAM Press, Austin (2010)","DOI":"10.1137\/1.9781611972900.9"},{"key":"1_CR2","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. 1663, pp. 169\u2013180. Springer, Heidelberg (1999)"},{"key":"1_CR3","unstructured":"Bingmann, T.: malloc\\_count - tools for runtime memory usage analysis and profiling, January 17, 2015"},{"issue":"5","key":"1_CR4","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"RD Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720\u2013748 (1999)","journal-title":"J. ACM"},{"key":"1_CR5","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: SODA, pp. 383\u2013391 (1996)"},{"key":"1_CR6","unstructured":"Claude, F.: A compressed data structure library, January 17, 2015"},{"key":"1_CR7","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, chapter. Multithreaded Algorithms, third edn., pp. 772\u2013812. The MIT Press (2009)"},{"key":"1_CR8","unstructured":"Drepper, U.: What every programmer should know about memory (2007)"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s00453-012-9664-0","volume":"68","author":"A Farzan","year":"2014","unstructured":"Farzan, A., Munro, J.I.: A uniform paradigm to succinctly encode various families of trees. Algorithmica 68(1), 16\u201340 (2014)","journal-title":"Algorithmica"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-319-07959-2_13","volume-title":"Experimental Algorithms","author":"J Fuentes-Sep\u00falveda","year":"2014","unstructured":"Fuentes-Sep\u00falveda, J., Elejalde, E., Ferres, L., Seco, D.: Efficient Wavelet tree construction and querying for multicore architectures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 150\u2013161. Springer, Heidelberg (2014)"},{"key":"1_CR11","unstructured":"Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. In: SODA, pp. 1\u201310 (2004)"},{"key":"1_CR12","unstructured":"Gog, S.: Succinct data structure library 2.0, January 17, 2015"},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/2344422.2344432","volume":"8","author":"M He","year":"2012","unstructured":"He, M., Munro, J.I., Satti, S.R.: Succinct ordinal trees based on tree covering. ACM Trans. Algorithms 8(4), 42 (2012)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/jpdc.2000.1678","volume":"61","author":"DR Helman","year":"2001","unstructured":"Helman, D.R., J\u00e1J\u00e1, J.: Prefix computations on symmetric multiprocessors. J. Par. Dist. Comput. 61(2), 265\u2013278 (2001)","journal-title":"J. Par. Dist. Comput."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: FOCS, pp. 549\u2013554 (1989)","DOI":"10.1007\/978-1-4612-3694-8_36"},{"key":"1_CR16","unstructured":"Jansson, J., Sadakane, K., Sung, W.K.: Ultra-succinct representation of ordered trees. In: SODA (2007)"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/1367064.1367068","volume":"4","author":"HI Lu","year":"2008","unstructured":"Lu, H.I., Yeh, C.C.: Balanced parentheses strike back. ACM Trans. Algorithms 4, 28:1\u201328:13 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. In: FOCS, pp. 118\u2013126 (1997)","DOI":"10.1109\/SFCS.1997.646100"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","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":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-40273-9_20","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","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.) Ianfest-66. LNCS, vol. 8066, pp. 319\u2013332. Springer, Heidelberg (2013)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Shun, J.: Parallel wavelet tree construction. CoRR abs\/1407.8142 (2014)","DOI":"10.1109\/DCC.2015.7"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:06:14Z","timestamp":1748459174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}