{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:14:13Z","timestamp":1742379253326},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600442"},{"type":"electronic","value":"9783540494126"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60044-2_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:35:31Z","timestamp":1330277731000},"page":"387-394","source":"Crossref","is-referenced-by-count":3,"title":["Dictionary look-up with small errors"],"prefix":"10.1007","author":[{"given":"Andrew C.","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frances F.","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"28_CR1","unstructured":"D. Dolev, Y. Harari, N. Linial, N. Nisan, and M. Pamas, Neighborhood preserving hashing and approximate queries, Proceedings of Fifth ACM Symposium on Discrete Algorithms, 1994."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"D. Dolev, Y. Harari and M. Parnas, Finding the neighborhood of a query in a dictionary, Proceedings of Second Israel Symposium on Theory of Computing and Systems, 1993.","DOI":"10.1109\/ISTCS.1993.253486"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P. Elias","year":"1974","unstructured":"P. Elias, Efficient storage and retrieval by content and address of static files, Journal ACM\n21 (1974), 246\u2013260.","journal-title":"Journal ACM"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. Fredman","year":"1984","unstructured":"M. Fredman, M. Koml\u00f3s, and E. Szemer\u00e9di, Storing a sparse table with O(1) worst case access time, Journal ACM\n31 (1984), 538\u2013544.","journal-title":"Journal ACM"},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/0219067","volume":"19","author":"Z. Galil","year":"1990","unstructured":"Z. Galil and K. Park, An improved algorithm for approximate string matchng, SIAM J. on Computing\n19 (1990), 989\u2013999.","journal-title":"SIAM J. on Computing"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"D. Greene, M. Parnas and F. Yao, Multi-index hashing for information retrieval, Proceedings of 1994 IEEE Symposium on Foundations of Computer Science, November 1994, 722\u2013731.","DOI":"10.1109\/SFCS.1994.365720"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"G. Landau","year":"1988","unstructured":"G. Landau and U. Vishkin, Fast string matching with k differences, J. Comp. Sys. Sci.\n37 (1988), 63\u201378.","journal-title":"J. Comp. Sys. Sci."},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(94)00032-8","volume":"50","author":"U. Manber","year":"1994","unstructured":"U. Manber and S. Wu, An algorithm for approximate membership checking with application to password security, Information Processing Lettters\n50 (1994), 191\u2013197.","journal-title":"Information Processing Lettters"},{"key":"28_CR9","unstructured":"M. Minsky and S. Papert, Perceptrons, MIT Press, 1969."},{"key":"28_CR10","unstructured":"J. Tarhio and E. Ukkonen, Approximate Boyer-Moore string matching, Report A-1990-3, Department of Computer Science, Univ. of Helsinki, March 1990."},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E. Ukkonen","year":"1985","unstructured":"E. Ukkonen, Finding approximate patterns in strings, J. Algorithms\n6 (1985), 132\u2013137.","journal-title":"J. Algorithms"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01769703","volume":"10","author":"E. Ukkonen","year":"1993","unstructured":"E. Ukkonen and D. Wood, Approximate string matching with suffix automata, Algorithmica\n10 (1993), 353\u2013364.","journal-title":"Algorithmica"},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/322261.322274","volume":"28","author":"A. Yao","year":"1981","unstructured":"A. Yao, Should tables be sorted?, Journal ACM\n28 (1981), 615\u2013628.","journal-title":"Journal ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60044-2_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:30:18Z","timestamp":1619573418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60044-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600442","9783540494126"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60044-2_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}