{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:20Z","timestamp":1759335920359},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_33","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:46:45Z","timestamp":1151477205000},"page":"370-381","source":"Crossref","is-referenced-by-count":11,"title":["Optimal Lower Bounds for Rank and Select Indexes"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Golynski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"David, R.: Clark. Compact Pat Trees. PhD thesis, University of Waterloo (1996)","key":"33_CR1"},{"unstructured":"Guy Jacobson. Succinct Static Data Structures. PhD thesis, Carnegie Mellon University (January 1989)","key":"33_CR2"},{"unstructured":"Miltersen, P.B.: Lower bounds on the size of selection and rank indexes. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 11\u201312 (2005)","key":"33_CR3"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-49382-2_17","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"J.I. Munro","year":"1998","unstructured":"Munro, J.I., Raman, V., Rao, S.S.: Space efficient suffix trees. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 186\u2013196. Springer, Heidelberg (1998)"},{"issue":"2","key":"33_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1151","volume":"39","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V., Rao, S.S.: Space efficient suffix trees. Journal of Algorithms\u00a039(2), 205\u2013222 (2001)","journal-title":"Journal of Algorithms"},{"unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 233\u2013242 (2002)","key":"33_CR6"},{"unstructured":"Widmayer, P.: Personal communication (2006)","key":"33_CR7"}],"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\/11786986_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:32:18Z","timestamp":1558294338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11786986_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}