{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:25Z","timestamp":1759637905914},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_46","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"521-532","source":"Crossref","is-referenced-by-count":11,"title":["A Framework for Dynamizing Succinct Data Structures"],"prefix":"10.1007","author":[{"given":"Ankur","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kai","family":"Hon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"46_CR1","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., Munro, I., Raman, R., Raman, V., Rao, S.: Representing trees of higher degree. Algorithmica\u00a043(4), 275\u2013292 (2005)","journal-title":"Algorithmica"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: Proceedings of the IEEE Symposium on FOCS, pp. 184\u2013196 (2005)","DOI":"10.1109\/SFCS.2005.69"},{"issue":"4","key":"46_CR3","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed texts. JACM\u00a052(4), 552\u2013581 (2005)","journal-title":"JACM"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Golynski, A., Munro, J.I., Rao, S.S.: Rank\/select operations on large alphabets: a tool for text indexing. In: SODA, pp. 368\u2013373 (2006)","DOI":"10.1145\/1109557.1109599"},{"key":"46_CR5","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: SODA (2003)"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: STOC, vol. 32 (2000)","DOI":"10.1145\/335305.335351"},{"issue":"1","key":"46_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1006\/jagm.2001.1171","volume":"41","author":"T. Hagerup","year":"2001","unstructured":"Hagerup, T., Miltersen, P., Pagh, R.: Deterministic dictionaries. Journal of Algorithms\u00a041(1), 353\u2013363 (2001)","journal-title":"Journal of Algorithms"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Hon, W.K., Sadakane, K., Sung, W.K.: Succinct data structures for searchable partial sums. In: ISAAC, pp. 505\u2013516 (2003)","DOI":"10.1007\/978-3-540-24587-2_52"},{"key":"46_CR9","unstructured":"Jacobson, G.: Succinct static data structures. Technical Report CMU-CS-89-112, Dept. of Computer Science, Carnegie-Mellon University (1989)"},{"key":"46_CR10","unstructured":"Navarro, G., Ferragina, P., Manzini, G., M\u00e4kinen, V.: Succinct representation of sequences and full-text indexes. In: TALG, 2006 (to appear)"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys, 2006 (to appear)","DOI":"10.1145\/1216370.1216372"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Dynamic entropy-compressed sequences and full-text indexes. In: CPM, pp. 306\u2013317 (2006)","DOI":"10.1007\/11780441_28"},{"issue":"4","key":"46_CR13","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1137\/S0097539705447256","volume":"35","author":"M. Patrascu","year":"2006","unstructured":"Patrascu, M., Demaine, E.: Logarithmic lower bounds in the cell-probe model. SIAM Journal on Computing\u00a035(4), 932\u2013963 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Raman, R., Raman, V., Rao, S.: Succinct dynamic data structures. In: WADS, pp. 426\u2013437 (2001)","DOI":"10.1007\/3-540-44634-6_39"},{"key":"46_CR15","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA, pp. 233\u2013242 (2002)"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: SODA, pp. 1230\u20131239 (2006)","DOI":"10.1145\/1109557.1109693"}],"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_46.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_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}