{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:16:50Z","timestamp":1749010610204,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388502"},{"type":"electronic","value":"9783319388519"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_8","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T15:33:54Z","timestamp":1464708834000},"page":"105-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Practical Dynamic Entropy-Compressed Bitvectors with Applications"],"prefix":"10.1007","author":[{"given":"Joshimar","family":"Cordova","sequence":"first","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., C\u00e1novas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Proceedings of the 12th ALENEX, pp. 84\u201397 (2010)","DOI":"10.1137\/1.9781611972900.9"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Brisaboa, N., de Bernardo, G., Navarro, G.: Compressed dynamic binary relations. In: Proceedings of the 22nd DCC, pp. 52\u201361 (2012)","DOI":"10.1109\/DCC.2012.13"},{"key":"8_CR3","unstructured":"Clark, D.: Compact PAT Trees. Ph.D. thesis, Univ. Waterloo, Canada (1996)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-12476-1_5","volume-title":"Algorithms and Applications","author":"F Claude","year":"2010","unstructured":"Claude, F., Navarro, G.: Extended compact web graph representations. In: Elomaa, T., Mannila, H., Orponen, P. (eds.) Ukkonen Festschrift 2010. LNCS, vol. 6060, pp. 77\u201391. Springer, Heidelberg (2010)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.is.2014.06.002","volume":"47","author":"F Claude","year":"2015","unstructured":"Claude, F., Navarro, G., Ord\u00f3\u00f1ez, A.: The wavelet matrix: an efficient wavelet tree for large alphabets. Inf. Syst. 47, 15\u201332 (2015)","journal-title":"Inf. Syst."},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theor. 21(2), 194\u2013203 (1975)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Ferrada, H., Navarro, G.: Improved range minimum queries. In: Proceedings of the 26th DCC, pp. 516\u2013525 (2016)","DOI":"10.1109\/DCC.2016.42"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fredman, M., Saks, M.: The cell probe complexity of dynamic data structures. In: Proceedings of the 21st STOC, pp. 345\u2013354 (1989)","DOI":"10.1145\/73007.73040"},{"key":"8_CR9","unstructured":"Gerlang, W.: Dynamic FM-Index for a Collection of Texts with Application to Space-efficient Construction of the Compressed Suffix Array. Master\u2019s thesis, Univ. Bielefeld, Germany (2007)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","volume-title":"Experimental Algorithms","author":"S Gog","year":"2014","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 326\u2013337. Springer, Heidelberg (2014)"},{"key":"8_CR11","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the 14th SODA, pp. 841\u2013850 (2003)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of the 30th FOCS, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-642-31594-7_43","volume-title":"Automata, Languages, and Programming","author":"J Jansson","year":"2012","unstructured":"Jansson, J., Sadakane, K., Sung, W.-K.: CRAM: Compressed Random Access Memory. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 510\u2013521. Springer, Heidelberg (2012)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-30850-5_20","volume-title":"Experimental Algorithms","author":"S Joannou","year":"2012","unstructured":"Joannou, S., Raman, R.: Dynamizing succinct tree representations. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 224\u2013235. Springer, Heidelberg (2012)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-24583-1_18","volume-title":"String Processing and Information Retrieval","author":"J K\u00e4rkk\u00e4inen","year":"2011","unstructured":"K\u00e4rkk\u00e4inen, J., Puglisi, S.J.: Fixed block compression boosting in FM-indexes. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol. 7024, pp. 174\u2013184. Springer, Heidelberg (2011)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Klitzke, P., Nicholson, P.K.: A general framework for dynamic succinct and compressed data structures. In: Proceedings of the 18th ALENEX, pp. 160\u2013173 (2016)","DOI":"10.1137\/1.9781611974317.14"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/1367064.1367072","volume":"4","author":"V M\u00e4kinen","year":"2008","unstructured":"M\u00e4kinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. ACM Trans. Algorithms 4(3), 32\u201338 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"JI Munro","year":"1986","unstructured":"Munro, J.I.: An implicit data structure supporting insertion, deletion, and search in o(log2 n) time. J. Comput. Syst. Sci. 33(1), 66\u201374 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2013.07.004","volume":"25","author":"G Navarro","year":"2014","unstructured":"Navarro, G.: Wavelet trees for all. J. Discrete Algorithms 25, 2\u201320 (2014)","journal-title":"J. Discrete Algorithms"},{"issue":"5","key":"8_CR20","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1137\/130908245","volume":"43","author":"G Navarro","year":"2014","unstructured":"Navarro, G., Nekrich, Y.: Optimal dynamic sequence representations. SIAM J. Comput. 43(5), 1781\u20131806 (2014)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"8_CR21","doi-asserted-by":"publisher","first-page":"16","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 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"8_CR22","unstructured":"Okanohara, D.: Dynamic succinct vector library. https:\/\/code.google.com\/archive\/p\/ds-vector\/ . Accessed 30 Jan 2016"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44634-6_39","volume-title":"Algorithms and Data Structures","author":"R Raman","year":"2001","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct dynamic data structures. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, p. 426. Springer, Heidelberg (2001)"},{"issue":"4","key":"8_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R Raman","year":"2007","unstructured":"Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), 43 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"8_CR25","unstructured":"Salson, M.: Dynamic fm-index library. http:\/\/dfmi.sourceforge.net\/ . Accessed 30 Jan 2016"},{"key":"8_CR26","unstructured":"Smirnov, V.: Memoria library. https:\/\/bitbucket.org\/vsmirnov\/memoria\/ . Accessed 30 Jan 2016"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T20:05:43Z","timestamp":1748981143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}