{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T03:21:56Z","timestamp":1707448916090},"reference-count":22,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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,2]]},"DOI":"10.1016\/s0020-0190(00)00007-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:53:01Z","timestamp":1027623181000},"page":"119-124","source":"Crossref","is-referenced-by-count":14,"title":["An improved heuristic for \u201cUlam\u2013R\u00e9nyi game\u201d"],"prefix":"10.1016","volume":"73","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00007-7_ID003","series-title":"Proc. 23rd Annual ACM Symposium on Theory of Computing, New Orleans, Louisiana","first-page":"486","article-title":"Searching in the presence of linearly bounded errors","author":"Aslam","year":"681991"},{"key":"10.1016\/S0020-0190(00)00007-7_ID004","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1006\/jcta.1996.0036","article-title":"Searching with lies","volume":"74","author":"Aigner","year":"1995","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0020-0190(00)00007-7_ID005","series-title":"Proc. 25th Annual ACM Symposium on the Theory of Computing, San Diego, California","first-page":"130","article-title":"Comparison-based search in the presence of errors","author":"Borgstrom","year":"16181993"},{"key":"10.1016\/S0020-0190(00)00007-7_ID006","series-title":"Error-Correcting Codes","first-page":"61","article-title":"Block coding for the binary symmetric channel with noiseless, delayless feedback","author":"Berlekamp","year":"1968"},{"key":"10.1016\/S0020-0190(00)00007-7_ID007","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0304-3975(99)00044-4","article-title":"Optimal strategies against a liar","volume":"230","author":"Cicalese","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00007-7_ID008","series-title":"Proc. 7th European Symposium on Algorithms (ESA99) Prague","first-page":"257","article-title":"Optimal binary search with two unreliable tests and minimum adaptiveness","volume":"1643","author":"Cicalese","year":"1999"},{"key":"10.1016\/S0020-0190(00)00007-7_ID009","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(91)90031-C","article-title":"Searching with a forbidden lie pattern in responses","volume":"37","author":"Czyzowicz","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00007-7_ID010","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/0097-3165(89)90062-9","article-title":"Ulam's searching game with lies","volume":"52","author":"Czyzowicz","year":"1989","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0020-0190(00)00007-7_ID011","unstructured":"C. Deppe, Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting-codes, Technical Report n. 98-036, University of Bielefeld, Fakult\u00e4t f\u00fcr Mathematik"},{"key":"10.1016\/S0020-0190(00)00007-7_ID012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(90)90002-E","article-title":"Ulam's searching game with two lies","volume":"54","author":"Guzicki","year":"1990","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0020-0190(00)00007-7_ID013","series-title":"Surveys in Combinatorics","first-page":"41","article-title":"Searching with lies","author":"Hill","year":"1995"},{"key":"10.1016\/S0020-0190(00)00007-7_ID014","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(95)00127-X","article-title":"An algorithm for \u201cUlam's Game\u201d and its application to error correcting codes","volume":"56","author":"Lawer","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00007-7_ID015","series-title":"Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, Pennsylvania","first-page":"680","article-title":"On optimal strategies for searching in presence of errors","author":"Muthukrishnan","year":"23251994"},{"key":"10.1016\/S0020-0190(00)00007-7_ID016","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/0196-8858(92)90019-S","article-title":"Ulam's Searching game with three lies","volume":"13","author":"Negro","year":"1992","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0020-0190(00)00007-7_ID017","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(87)90065-3","article-title":"Solution of Ulam's problem on searching with a lie","volume":"44","author":"Pelc","year":"1987","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0020-0190(00)00007-7_ID018","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(86)90133-7","article-title":"Lie patterns in search procedures","volume":"47","author":"Pelc","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00007-7_ID019","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(84)90104-X","article-title":"Coping with known patterns of lies in a search game","volume":"33","author":"Ravikumar","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00007-7_ID020","series-title":"Napl\u00f3 az Inform\u00e1ci\u00f3elm\u00e9letr\u00f6l","author":"R\u00e9nyi","year":"1976"},{"key":"10.1016\/S0020-0190(00)00007-7_ID021","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0022-0000(80)90014-8","article-title":"Coping with errors in binary search procedures","volume":"20","author":"Rivest","year":"1980","journal-title":"J. Comput. System Sci."},{"issue":"5","key":"10.1016\/S0020-0190(00)00007-7_ID022","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0020-0190(98)00166-5","article-title":"Binary search with errors and variable cost queries","volume":"68","author":"Sereno","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00007-7_ID023","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(92)90270-P","article-title":"Ulam's searching game with a fixed number of lies","volume":"95","author":"Spencer","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00007-7_ID024","series-title":"Adventures of a Mathematician","author":"Ulam","year":"1976"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000077?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000077?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T08:24:56Z","timestamp":1556007896000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":22,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0020019000000077"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00007-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}