{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:58:12Z","timestamp":1766066292993},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_15","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"151-163","source":"Crossref","is-referenced-by-count":17,"title":["Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences"],"prefix":"10.1007","author":[{"given":"Dong","family":"Zhou","sequence":"first","affiliation":[]},{"given":"David G.","family":"Andersen","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaminsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Clark, D.R.: Compact pat trees. PhD thesis, Waterloo, Ont., Canada, Canada (1998)"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P. Elias","year":"1974","unstructured":"Elias, P.: Efficient Storage and Retrieval by Content and Address of Static Files. J. ACM\u00a021(2), 246\u2013260 (1974)","journal-title":"J. ACM"},{"key":"15_CR3","unstructured":"Fano, R.M.: On the number of bits required to implement an associative memory. Memorandum 61, Computer Structures Group, Project MAC (1971)"},{"key":"15_CR4","unstructured":"Gog, S.: \n                    \n                      https:\/\/github.com\/simongog\/sdsl"},{"key":"15_CR5","unstructured":"Gonz\u00e1lez, R., Grabowski, S., M\u00e4kinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA 2005), pp. 27\u201338 (2005)"},{"key":"15_CR6","first-page":"549","volume-title":"Proc. Symposium on Foundations of Computer Science, SFCS 1989","author":"G. Jacobson","year":"1989","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. Symposium on Foundations of Computer Science, SFCS 1989, pp. 549\u2013554. IEEE Computer Society, Washington, DC (1989)"},{"key":"15_CR7","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fascicle: Bitwise Tricks & Techniques; Binary Decision Diagrams, vol.\u00a04. Addison-Wesley Professional (2009)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-33074-2_19","volume-title":"Advances in Databases and Information Systems","author":"S. Ladra","year":"2012","unstructured":"Ladra, S., Pedreira, O., Duato, J., Brisaboa, N.R.: Exploiting SIMD instructions in current processors to improve classical string algorithms. In: Morzy, T., H\u00e4rder, T., Wrembel, R. (eds.) ADBIS 2012. LNCS, vol.\u00a07503, pp. 254\u2013267. Springer, Heidelberg (2012)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-30850-5_26","volume-title":"Experimental Algorithms","author":"G. Navarro","year":"2012","unstructured":"Navarro, G., Providel, E.: Fast, Small, Simple Rank\/Select on Bitmaps. In: Klasing, R. (ed.) SEA 2012. LNCS, vol.\u00a07276, pp. 295\u2013306. Springer, Heidelberg (2012)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-68552-4_12","volume-title":"Experimental Algorithms","author":"S. Vigna","year":"2008","unstructured":"Vigna, S.: Broadword implementation of rank\/select queries. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 154\u2013168. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:30:29Z","timestamp":1557703829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}