{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:47Z","timestamp":1761611267745},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_52","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"505-516","source":"Crossref","is-referenced-by-count":19,"title":["Succinct Data Structures for Searchable Partial Sums"],"prefix":"10.1007","author":[{"given":"Wing-Kai","family":"Hon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Beame, P., Fich, F.E.: Optimal Bounds for the Predecessor Problem. In: Proc. ACM STOC, pp. 295\u2013304 (1999)","DOI":"10.1145\/301250.301323"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Dietz, P.F.: Optimal Algorithms for List Indexing and Subset Rank. In: Proceedings of Workshop on Algorithms and Data Structures, pp. 39\u201346 (1989)","DOI":"10.1007\/3-540-51542-9_5"},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Fredman, M.L., Saks, M.E.: The Cell Probe Complexity of Dynamic Data Structures. In: Proc. ACM STOC, pp. 345\u2013354 (1989)","DOI":"10.1145\/73007.73040"},{"key":"52_CR4","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-Order Entropy-Compressed Text Indexes. In: Proc. ACM-SIAM SODA, pp. 841\u2013850 (2003)"},{"key":"52_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0028575","volume-title":"STACS 98","author":"T. Hagerup","year":"1998","unstructured":"Hagerup, T.: Sorting and Searching on the Word RAM. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 366\u2013398. Springer, Heidelberg (1998)"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient Static Trees and Graphs. In: Proc. IEEE FOCS, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct Dynamic Data Structures. In: Proceedings of Workshop on Algorithms and Data Structures, pp. 426\u2013437 (2001)","DOI":"10.1007\/3-540-44634-6_39"},{"key":"52_CR8","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees and Multisets. In: Proc. ACM-SIAM SODA, pp. 233\u2013242 (2002)"},{"issue":"3","key":"52_CR9","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1145\/322261.322274","volume":"28","author":"A.C. Yao","year":"1981","unstructured":"Yao, A.C.: Should Tables Be Sorted? Journal of the ACM\u00a028(3), 615\u2013628 (1981)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:23:33Z","timestamp":1552836213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}