{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:51Z","timestamp":1759637991934},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424932"},{"type":"electronic","value":"9783540446767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44676-1_24","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T16:43:15Z","timestamp":1179506595000},"page":"290-299","source":"Crossref","is-referenced-by-count":19,"title":["Explicit Deterministic Constructions for Membership in the Bitprobe Model"],"prefix":"10.1007","author":[{"given":"Jaikumar","family":"Radhakrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Srinivasa Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"issue":"5","key":"24_CR1","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1137\/S0097539795294165","volume":"28","author":"A. Brodnik","year":"1999","unstructured":"A. Brodnik and J. I. Munro, \u201cMembership in constant time and almost minimum space\u201d, SIAM Journal on Computing, 28(5), 1628\u20131640 (1999).","journal-title":"SIAM Journal on Computing"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"H. Buhrman, P. B. Miltersen, J. Radhakrishnan and S. Venkatesh, \u201cAre Bitvectors Optimal?\u201d, Proceedings of Symposium on Theory of Computing (2000) 449\u2013458.","DOI":"10.1145\/335305.335357"},{"key":"24_CR3","unstructured":"E. D. Demaine, J. I. Munro, V. Raman and S. S. Rao, \u201cBeating Bitvectors with Oblivious Bitprobes\u201d, I.M.Sc. Technical Report (2001)."},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"M. L. Fredman, J. Koml\u00f3s and E. Szemer\u00e9di, \u201cStoring a sparse table with O(1) access time\u201d, Journal of the Association for Computing Machinery, 31 (1984) 538\u2013544.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"24_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/3-540-48523-6_56","volume-title":"Proceedings of the International Colloquium on Automata, Languages and Programming","author":"R. Pagh","year":"1999","unstructured":"Rasmus Pagh, \u201cLow redundancy in dictionaries with O(1) worst case lookup time\u201d, Proceedings of the International Colloquium on Automata, Languages and Programming, LNCS\n                           1644 (1999) 595\u2013604."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Rasmus Pagh, \u201cOn the Cell Probe Complexity of Membership and Perfect Hashing\u201d, Proceedings of Symposium on Theory of Computing (2001).","DOI":"10.1145\/380752.380836"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44676-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T19:29:28Z","timestamp":1550345368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44676-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424932","9783540446767"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44676-1_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}