{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:28Z","timestamp":1759638628400},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,6,27]],"date-time":"2013-06-27T00:00:00Z","timestamp":1372291200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s00224-013-9487-7","type":"journal-article","created":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T06:41:41Z","timestamp":1372228901000},"page":"578-594","source":"Crossref","is-referenced-by-count":2,"title":["Perfect Strategies for the Ulam-R\u00e9nyi Game with Multi-interval Questions"],"prefix":"10.1007","volume":"54","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,27]]},"reference":[{"issue":"4","key":"9487_CR1","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1109\/TIT.2009.2013014","volume":"55","author":"R. Ahlswede","year":"2009","unstructured":"Ahlswede, R., Cicalese, F., Deppe, C., Vaccaro, U.: Two batch search with lie cost. IEEE Trans. Inf. Theory 55(4), 1433\u20131439 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9487_CR2","first-page":"486","volume-title":"Proc. of 23rd Annual ACM Symposium on Theory of Computing (STOC)","author":"J. Aslam","year":"1991","unstructured":"Aslam, J., Dhagat, A.: Searching in the presence of linearly bounded errors. In: Proc. of 23rd Annual ACM Symposium on Theory of Computing (STOC), pp. 486\u2013493 (1991)"},{"key":"9487_CR3","first-page":"24","volume-title":"Proc. of 4th Italian Conf. on Theoretical Computer Science","author":"V. Auletta","year":"1992","unstructured":"Auletta, V., Negro, A., Parlati, G.: Some results on searching with lies. In: Proc. of 4th Italian Conf. on Theoretical Computer Science, pp. 24\u201337 (1992)"},{"key":"9487_CR4","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\u201368. Wiley, New York (1968)"},{"issue":"3","key":"9487_CR5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D.P., Haussler, D., Schapire, R., Warmuth, M.K.: How to use expert advice. J. ACM 44(3), 427\u2013485 (1997)","journal-title":"J. ACM"},{"key":"9487_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-30347-0_10","volume-title":"Proc. of the 6th Intl. Conference Fun with Algorithms (FUN 2012)","author":"F. Cicalese","year":"2012","unstructured":"Cicalese, F.: The Multi-Interval Ulam-R\u00e9nyi game. In: Proc. of the 6th Intl. Conference Fun with Algorithms (FUN 2012). Lecture Notes in Computer Science, vol. 7288, pp. 69\u201380 (2012)"},{"key":"9487_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/aama.2000.0688","volume":"25","author":"F. Cicalese","year":"2000","unstructured":"Cicalese, F., Mundici, D.: Perfect 2-fault tolerant search with minimum adaptiveness. Adv. Appl. Math. 25, 65\u2013101 (2000)","journal-title":"Adv. Appl. Math."},{"key":"9487_CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-88-470-2107-5_10","volume-title":"Algebraic Combinatorics and Computer Science\u2014A Tribute to Giancarlo Rota","author":"F. Cicalese","year":"2001","unstructured":"Cicalese, F., Mundici, D., Vaccaro, U.: Rota-Metropolis cubic logic and Ulam-R\u00e9nyi games. In: Crapo, H., Senato, D. (eds.) Algebraic Combinatorics and Computer Science\u2014A Tribute to Giancarlo Rota, pp. 197\u2013244. Springer Italia, Milano (2001)"},{"issue":"1\u20132","key":"9487_CR9","first-page":"877","volume":"270","author":"F. Cicalese","year":"2001","unstructured":"Cicalese, F., Mundici, D., Vaccaro, U.: Least adaptive optimal search with unreliable tests. Theor. Comput. Sci. 270(1\u20132), 877\u2013893 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"9487_CR10","series-title":"LNCS","first-page":"527","volume-title":"Proc. of 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003)","author":"F. Cicalese","year":"2003","unstructured":"Cicalese, F., Deppe, C.: Quasi-perfect minimally adaptive q-ary search with unreliable tests. In: Proc. of 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003). LNCS, vol. 2906, pp. 527\u2013536 (2003)"},{"key":"9487_CR11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.dam.2003.11.004","volume":"144","author":"F. Cicalese","year":"2004","unstructured":"Cicalese, F., Gargano, L., Vaccaro, U.: On searching strategies, parallel questions, and delayed answers. Discrete Appl. Math. 144, 247\u2013262 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9487_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-3-662-05594-6_12","volume-title":"Adaptivity and Learning\u2014An Interdisciplinary Debate","author":"F. Cicalese","year":"2003","unstructured":"Cicalese, F., Mundici, D.: Learning and the art of fault-tolerant guesswork. In: Kh\u00fcn, R., Menzel, R., Menzel, W., Ratsch, U., Richter, M.M., Stamatescu, I.O. (eds.) Adaptivity and Learning\u2014An Interdisciplinary Debate, pp. 115\u2013140. Springer, Berlin (2003)"},{"key":"9487_CR13","series-title":"Springer-Verlag Synthese Library","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-94-007-0080-2_8","volume-title":"Proof, Computation and Agency","author":"F. Cicalese","year":"2011","unstructured":"Cicalese, F., Mundici, D.: Recent developments of feedback coding and its relations with many-valued logic. In: van Benthem, J., et al. (eds.) Proof, Computation and Agency. Springer-Verlag Synthese Library, vol. 352, pp. 115\u2013131 (2011). (3)"},{"key":"9487_CR14","series-title":"Bolyai Society Mathematical Studies","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-540-32777-6_2","volume-title":"Entropy, Search, Complexity","author":"C. Deppe","year":"2007","unstructured":"Deppe, C.: Coding with feedback and searching with lies. In: Entropy, Search, Complexity. Bolyai Society Mathematical Studies, vol. 16, pp. 27\u201370 (2007)"},{"key":"9487_CR15","first-page":"16","volume-title":"Proc. of 3rd Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms (SODA1992)","author":"A. Dhagat","year":"1992","unstructured":"Dhagat, A., G\u2019acs, P., Winkler, P.: On playing \u201cTwenty Questions\u201d with a liar. In: Proc. of 3rd Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms (SODA1992), pp. 16\u201322 (1992)"},{"key":"9487_CR16","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s00493-005-0033-3","volume":"25","author":"I. Dumitriu","year":"2005","unstructured":"Dumitriu, I., Spencer, J.: The liar game over an arbitrary channel. Combinatorica 25, 537\u2013559 (2005)","journal-title":"Combinatorica"},{"key":"9487_CR17","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1137\/040617510","volume":"19","author":"I. Dumitriu","year":"2006","unstructured":"Dumitriu, I., Spencer, J.: The two-batch liar game over an arbitrary channel. SIAM J. Discrete Math. 19, 1056\u20131064 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"9487_CR18","unstructured":"Kelareva, E.: Adaptive psychophysical procedures and Ulam\u2019s game. MSc Thesis, Australian National University (2006)"},{"issue":"7","key":"9487_CR19","doi-asserted-by":"crossref","first-page":"2003","DOI":"10.3758\/APP.72.7.2003","volume":"72","author":"E. Kelareva","year":"2010","unstructured":"Kelareva, E., Mewing, J., Wirth, A.: Adaptive psychophysical procedures, loss functions, and entropy. Attention, Perception, Psychophys. 72(7), 2003\u20132012 (2010)","journal-title":"Attention, Perception, Psychophys."},{"key":"9487_CR20","series-title":"LNICST","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-642-05284-2_12","volume-title":"Proc. of the 5th Int. ICST Conf. on Security and Privacy in Communication Networks (SecureComm 2009)","author":"W. Kozma","year":"2009","unstructured":"Kozma, W., Lazos, L.: Dealing with liars: Misbehavior identification via R\u00e9nyi-Ulam games. In: Proc. of the 5th Int. ICST Conf. on Security and Privacy in Communication Networks (SecureComm 2009). LNICST, vol. 19, pp. 207\u2013227 (2009)"},{"key":"9487_CR21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0304-3975(97)00030-3","volume":"182","author":"D. Mundici","year":"1997","unstructured":"Mundici, D., Trombetta, A.: Optimal comparison strategies in Ulam\u2019s searching game with two errors. Theor. Comput. Sci. 182, 217\u2013232 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"9487_CR22","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1109\/FOCS.2008.58","volume-title":"Proc. of 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201908)","author":"M.B. Or","year":"2008","unstructured":"Or, M.B., Hassidim, A.: The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well). In: Proc. of 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201908), pp. 221\u2013230 (2008)"},{"key":"9487_CR23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0304-3975(01)00071-8","volume":"282","author":"A. Pedrotti","year":"2002","unstructured":"Pedrotti, A.: Playing by searching: two strategies against a linearly bounded liar. Theor. Comput. Sci. 282, 285\u2013302 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"9487_CR24","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0304-3975(01)00303-6","volume":"270","author":"A. Pelc","year":"2002","unstructured":"Pelc, A.: Searching games with errors\u2014fifty years of coping with liars. Theor. Comput. Sci. 270(1\u20132), 71\u2013109 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9487_CR25","first-page":"17","volume":"24","author":"A. Pelc","year":"1987","unstructured":"Pelc, A.: Coding with bounded error fraction. Ars Comb. 24, 17\u201322 (1987)","journal-title":"Ars Comb."},{"key":"9487_CR26","first-page":"505","volume":"6","author":"A. R\u00e9nyi","year":"1961","unstructured":"R\u00e9nyi, A.: On a problem of information theory. Magy. Tud. Akad. Mat. Kut. Int\u00e9z. K\u00f6zl. 6, 505\u2013516 (1961)","journal-title":"Magy. Tud. Akad. Mat. Kut. Int\u00e9z. K\u00f6zl."},{"key":"9487_CR27","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0022-0000(80)90014-8","volume":"20","author":"R.L. Rivest","year":"1980","unstructured":"Rivest, R.L., Meyer, A.R., Kleitman, D.J., Winklmann, K., Spencer, J.: Coping with errors in binary search procedures. J. Comput. Syst. Sci. Int. 20, 396\u2013404 (1980)","journal-title":"J. Comput. Syst. Sci. Int."},{"issue":"5","key":"9487_CR28","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0020-0190(98)00166-5","volume":"68","author":"M. Sereno","year":"1998","unstructured":"Sereno, M.: Binary search with errors and variable cost queries. Inf. Process. Lett. 68(5), 261\u2013270 (1998)","journal-title":"Inf. Process. Lett."},{"key":"9487_CR29","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1017\/S0963548300000080","volume":"1","author":"J. Spencer","year":"1992","unstructured":"Spencer, J., Winkler, P.: Three thresholds for a liar. Comb. Probab. Comput. 1, 81\u201393 (1992)","journal-title":"Comb. Probab. Comput."},{"key":"9487_CR30","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2307\/2689593","volume":"57","author":"J. Spencer","year":"1984","unstructured":"Spencer, J.: Guess a number with lying. Math. Mag. 57, 105\u2013108 (1984)","journal-title":"Math. Mag."},{"key":"9487_CR31","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 95, 307\u2013321 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"9487_CR32","volume-title":"Adventures of a Mathematician","author":"S.M. Ulam","year":"1976","unstructured":"Ulam, S.M.: Adventures of a Mathematician. Scribner\u2019s, New York (1976)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9487-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9487-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9487-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,26]],"date-time":"2022-02-26T12:11:00Z","timestamp":1645877460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9487-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,27]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9487"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9487-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,27]]}}}