{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:35:45Z","timestamp":1725561345527},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_54","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"527-536","source":"Crossref","is-referenced-by-count":6,"title":["Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests"],"prefix":"10.1007","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[]},{"given":"Christian","family":"Deppe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcta.1996.0036","volume":"74","author":"M. Aigner","year":"1995","unstructured":"Aigner, M.: Searching with lies. J. Comb. Theory, Ser. A\u00a074, 43\u201356 (1995)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"54_CR2","first-page":"61","volume-title":"Error-correcting Codes","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Block coding for the binary symmetric channel with noiseless, delayless feedback. In: Mann, H.B. (ed.) Error-correcting Codes, pp. 61\u201388. Wiley, New York (1968)"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(99)00044-4","volume":"230","author":"F. Cicalese","year":"2000","unstructured":"Cicalese, F., Vaccaro, U.: Optimal strategies against a liar. Theoretical Computer Science\u00a0230, 167\u2013193 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"54_CR4","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/S0304-3975(01)00116-5","volume":"270","author":"F. Cicalese","year":"2001","unstructured":"Cicalese, F., Mundici, D., Vaccaro, U.: Least adaptive optimal search with unreliable tests. Theoretical Computer Science\u00a0270(1-2), 877\u2013893 (2001)","journal-title":"Theoretical Computer Science"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0097-3165(89)90062-9","volume":"52","author":"J. Czyzowicz","year":"1989","unstructured":"Czyzowicz, J., Mundici, D., Pelc, A.: Ulam\u2019s searching game with lies. J. Comb. Theo., Ser. A\u00a052, 62\u201376 (1989)","journal-title":"J. Comb. Theo., Ser. A"},{"issue":"1-3","key":"54_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0012-365X(00)00109-6","volume":"224","author":"C. Deppe","year":"2000","unstructured":"Deppe, C.: Solution of Ulam\u2019s searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes. Discrete Math.\u00a0224(1-3), 79\u201398 (2000)","journal-title":"Discrete Math."},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(90)90002-E","volume":"54","author":"W. Guzicki","year":"1990","unstructured":"Guzicki, W.: Ulam\u2019s Searching Game with Two Lies. J. Combin. Theory Ser. A\u00a054, 1\u201319 (1990)","journal-title":"J. Combin. Theory Ser. A"},{"key":"54_CR8","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"54_CR9","first-page":"301","volume":"37","author":"Malinowski","year":"1994","unstructured":"Malinowski: K-ary searching with a lie. Ars Combinatoria\u00a037, 301\u2013308 (1994)","journal-title":"Ars Combinatoria"},{"key":"54_CR10","unstructured":"Muthukrishnan, S.: On optimal strategies for searching in presence of errors. In: Proc. of the 5th ACM-SIAM SODA, pp. 680\u2013689 (1994)"},{"key":"54_CR11","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/0196-8858(92)90019-S","volume":"13","author":"A. Negro","year":"1992","unstructured":"Negro, A., Sereno, M.: Ulam\u2019s searching game with three lies. Adv. in Appl. Math.\u00a013, 404\u2013428 (1992)","journal-title":"Adv. in Appl. Math."},{"key":"54_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0097-3165(87)90065-3","volume":"44","author":"A. Pelc","year":"1987","unstructured":"Pelc, A.: Solution of Ulam\u2019s problem on searching with a lie. J. Combin. Theory, Ser. A\u00a044, 129\u2013142 (1987)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"54_CR13","unstructured":"Pelc, A.: Search games with errors \u2013 Fifty years of coping with liars (2000) (preprint)"},{"key":"54_CR14","unstructured":"R\u00e9nyi, A.: Napl\u00f3 az inform\u00e1ci\u00f3elm\u00e9letr\u0151l, Gondolat, Budapest (1976); (English translation: A Diary on Information Theory, J.Wiley and Sons, New York, 1984)"},{"key":"54_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(92)90270-P","volume":"95","author":"J. Spencer","year":"1992","unstructured":"Spencer, J.: Ulam\u2019s searching game with a fixed number of lies. Theoretical Comp. Sci.\u00a095, 307\u2013321 (1992)","journal-title":"Theoretical Comp. Sci."},{"key":"54_CR16","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0124010","volume":"24","author":"A. Tiet\u00e4v\u00e4inen","year":"1973","unstructured":"Tiet\u00e4v\u00e4inen, A.: On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math.\u00a024, 88\u201396 (1973)","journal-title":"SIAM J. Appl. Math."},{"key":"54_CR17","doi-asserted-by":"crossref","unstructured":"Ulam, S.M.: Adventures of a Mathematician, Scribner\u2019s, New York (1976)","DOI":"10.1063\/1.3024514"},{"key":"54_CR18","first-page":"123","volume":"2","author":"V.A. Zinoviev","year":"1973","unstructured":"Zinoviev, V.A., Leontiev, V.K.: The non-existence of perfect codes over Galois fields. Probl. Contr. Inform. Theory\u00a02, 123\u2013132 (1973)","journal-title":"Probl. Contr. Inform. Theory"},{"issue":"2","key":"54_CR19","first-page":"95","volume":"29","author":"V.A. Zinoviev","year":"1993","unstructured":"Zinoviev, V.A., Katsman, G.L.: Universal Code Families. Information Theory and Coding Theory\u00a029(2), 95\u2013100 (1993)","journal-title":"Information Theory and Coding Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:55:40Z","timestamp":1559346940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}