{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:54Z","timestamp":1759637694562},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447765"},{"type":"electronic","value":"9783662447772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44777-2_52","type":"book-chapter","created":{"date-parts":[[2014,8,16]],"date-time":"2014-08-16T10:43:15Z","timestamp":1408185795000},"page":"630-641","source":"Crossref","is-referenced-by-count":15,"title":["Improved Explicit Data Structures in the Bitprobe Model"],"prefix":"10.1007","author":[{"given":"Moshe","family":"Lewenstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick K.","family":"Nicholson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Feige, U.: On the power of two, three and four probes. In: Proc. of the 20th Annual Symposium on Discrete Algorithms (SODA), pp. 346\u2013354. SIAM (2009)","DOI":"10.1137\/1.9781611973068.39"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Brodal, G., Rauhe, T.: Optimal static range reporting in one dimension. In: Proc. of the 33rd Annual Symposium on Theory of Computing (STOC), pp. 476\u2013482. ACM (2001)","DOI":"10.1145\/380752.380842"},{"issue":"5","key":"52_CR3","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1137\/S0097539795294165","volume":"28","author":"A. Brodnik","year":"1999","unstructured":"Brodnik, A., Munro, J.I.: Membership in constant time and almost-minimum space. SIAM Journal on Computing\u00a028(5), 1627\u20131640 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"52_CR4","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1137\/S0097539702405292","volume":"31","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., Miltersen, P., Radhakrishnan, J., Venkatesh, S.: Are bitvectors optimal? SIAM Journal on Computing\u00a031(6), 1723\u20131744 (2002)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"52_CR5","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with 0(1) worst case access time. Journal of the ACM (JACM)\u00a031(3), 538\u2013544 (1984)","journal-title":"Journal of the ACM (JACM)"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Nicholson, P.K.: Space Efficient Data Structures in the Word-RAM and Bitprobe Models. Ph.D. thesis, University of Waterloo (2013)","DOI":"10.1007\/978-3-642-40273-9_19"},{"key":"52_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-40273-9_19","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","author":"P.K. Nicholson","year":"2013","unstructured":"Nicholson, P.K., Raman, V., Rao, S.: Data structures in the bitprobe model. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Ianfest-66. LNCS, vol.\u00a08066, pp. 303\u2013318. Springer, Heidelberg (2013)"},{"issue":"2","key":"52_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1137\/S0097539700369909","volume":"31","author":"R. Pagh","year":"2001","unstructured":"Pagh, R.: Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing\u00a031(2), 353\u2013363 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M.: Succincter. In: Proc. of the 49th Annual Symposium on Foundations of Computer Science, pp. 305\u2013313. IEEE (2008)","DOI":"10.1109\/FOCS.2008.83"},{"key":"52_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-44676-1_24","volume-title":"Algorithms - ESA 2001","author":"J. Radhakrishnan","year":"2001","unstructured":"Radhakrishnan, J., Raman, V., Rao, S.S.: Explicit deterministic constructions for membership in the bitprobe model. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 290\u2013299. Springer, Heidelberg (2001)"},{"key":"52_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-15781-3_14","volume-title":"Algorithms \u2013 ESA 2010","author":"J. Radhakrishnan","year":"2010","unstructured":"Radhakrishnan, J., Shah, S., Shannigrahi, S.: Data structures for storing small sets in the bitprobe model. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 159\u2013170. Springer, Heidelberg (2010)"},{"issue":"6","key":"52_CR12","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1137\/090766619","volume":"41","author":"E. Viola","year":"2012","unstructured":"Viola, E.: Bit-probe lower bounds for succinct data structures. SIAM Journal on Computing\u00a041(6), 1593\u20131604 (2012)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44777-2_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:05:34Z","timestamp":1558973134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44777-2_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447765","9783662447772"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44777-2_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}