{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:44:31Z","timestamp":1766065471873},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0020-0190(00)00079-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:02:11Z","timestamp":1027598531000},"page":"57-59","source":"Crossref","is-referenced-by-count":21,"title":["Improved bounds for dictionary look-up with one error"],"prefix":"10.1016","volume":"75","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Venkatesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00079-X_ID006","series-title":"Proc. 7th Combinatorial Pattern Matching","first-page":"65","article-title":"Approximate dictionary queries","volume":"Vol. 1075","author":"Brodal","year":"1996"},{"key":"10.1016\/S0020-0190(00)00079-X_ID007","series-title":"13th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"569","article-title":"Universal hashing and k -wise independent random variables via integer arithmetic without primes","volume":"Vol. 1046","author":"Dietzfelbinger","year":"1996"},{"key":"10.1016\/S0020-0190(00)00079-X_ID008","series-title":"Proc. 5th ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"251","article-title":"Neighborhood preserving hashing and approximate queries","author":"Dolev","year":"1994"},{"key":"10.1016\/S0020-0190(00)00079-X_ID009","series-title":"Proc. 2nd Israel Symposium on Theory of Computing and Systems","first-page":"33","article-title":"Finding the neighborhood of a query in a dictionary","author":"Dolev","year":"1993"},{"issue":"3","key":"10.1016\/S0020-0190(00)00079-X_ID010","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","article-title":"Storing a sparse table with \u00d8(1) worst case access time","volume":"Vol. 31","author":"Fredman","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00079-X_ID011","series-title":"Proc. 35th Annual Symposium on Foundations of Computer Science","first-page":"722","article-title":"Multi-index hashing for information retrieval","author":"Greene","year":"1994"},{"issue":"1","key":"10.1016\/S0020-0190(00)00079-X_ID012","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0020-0190(86)90041-4","article-title":"Two results on tables","volume":"Vol. 22","author":"Jacobs","year":"1986","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/S0020-0190(00)00079-X_ID013","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(94)00032-8","article-title":"An algorithm for approximate membership checking with application to password security","volume":"Vol. 50","author":"Manber","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00079-X_ID014","series-title":"Perceptrons","author":"Minsky","year":"1969"},{"issue":"5","key":"10.1016\/S0020-0190(00)00079-X_ID015","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1137\/0219054","article-title":"The spatial complexity of oblivious k -probe hash functions","volume":"Vol. 19","author":"Schmidt","year":"1990","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0020-0190(00)00079-X_ID016","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/322261.322274","article-title":"Should tables be sorted?","volume":"Vol. 28","author":"Yao","year":"1981","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0020-0190(00)00079-X_ID017","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1006\/jagm.1997.0875","article-title":"Dictionary look-up with one error","volume":"Vol. 25","author":"Yao","year":"1997","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900000079X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900000079X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T09:28:50Z","timestamp":1556270930000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900000079X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S002001900000079X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00079-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}