{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T10:07:58Z","timestamp":1787652478888,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642402722","type":"print"},{"value":"9783642402739","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40273-9_1","type":"book-chapter","created":{"date-parts":[[2013,8,10]],"date-time":"2013-08-10T01:20:34Z","timestamp":1376097634000},"page":"1-11","source":"Crossref","is-referenced-by-count":14,"title":["The Query Complexity of Finding a Hidden Permutation"],"prefix":"10.1007","author":[{"given":"Peyman","family":"Afshani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manindra","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kasper Green","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-35533-2_18","volume-title":"Artificial Evolution","author":"B. Doerr","year":"2012","unstructured":"Doerr, B., Winzen, C.: Black-box complexity: Breaking the o(n logn) barrier of LeadingOnes. In: Hao, J.-K., Legrand, P., Collet, P., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2011. LNCS, vol.\u00a07401, pp. 205\u2013216. Springer, Heidelberg (2012)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T.: The Mastermind attack on genomic data. In: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (SP 2009), pp. 204\u2013218. IEEE (2009)","DOI":"10.1109\/SP.2009.4"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-13122-6_21","volume-title":"Fun with Algorithms","author":"R. Focardi","year":"2010","unstructured":"Focardi, R., Luccio, F.L.: Cracking bank PINs by playing Mastermind. In: Boldi, P. (ed.) FUN 2010. LNCS, vol.\u00a06099, pp. 202\u2013213. Springer, Heidelberg (2010)"},{"key":"1_CR4","first-page":"229","volume":"8","author":"P. Erd\u0151s","year":"1963","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On two problems of information theory. Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei\u00a08, 229\u2013243 (1963)","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei"},{"key":"1_CR5","first-page":"1","volume":"9","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E.: The computer as master mind. Journal of Recreational Mathematics\u00a09, 1\u20135 (1977)","journal-title":"Journal of Recreational Mathematics"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02579188","volume":"3","author":"V. Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V.: Mastermind. Combinatorica\u00a03, 325\u2013329 (1983)","journal-title":"Combinatorica"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-61332-3_138","volume-title":"Computing and Combinatorics","author":"Z. Chen","year":"1996","unstructured":"Chen, Z., Cunha, C., Homer, S.: Finding a hidden code by asking questions. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 50\u201355. Springer, Heidelberg (1996)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.ipl.2009.02.021","volume":"109","author":"M.T. Goodrich","year":"2009","unstructured":"Goodrich, M.T.: On the algorithmic complexity of the Mastermind game with black-peg results. Information Processing Letters\u00a0109, 675\u2013678 (2009)","journal-title":"Information Processing Letters"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-30347-0_36","volume-title":"Fun with Algorithms","author":"G. Viglietta","year":"2012","unstructured":"Viglietta, G.: Hardness of Mastermind. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol.\u00a07288, pp. 368\u2013378. Springer, Heidelberg (2012)"},{"key":"1_CR10","doi-asserted-by":"publisher","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 \u2014 fifty years of coping with liars. Theoretical Computer Science\u00a0270, 71\u2013109 (2002)","journal-title":"Theoretical Computer Science"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/0304-3975(94)90181-3","volume":"131","author":"J. Spencer","year":"1994","unstructured":"Spencer, J.: Randomization, derandomization and antirandomization: Three games. Theoretical Computer Science\u00a0131, 415\u2013429 (1994)","journal-title":"Theoretical Computer Science"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, B., Sp\u00f6hel, R., Thomas, H., Winzen, C.: Playing Mastermind with many colors. In: SODA 2013, pp. 695\u2013704. SIAM (2013)","DOI":"10.1137\/1.9781611973105.50"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Probabilistic computations: Toward a unified measure of complexity. In: FOCS 1977, pp. 222\u2013227. IEEE (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Space-Efficient Data Structures, Streams, and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40273-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:47:35Z","timestamp":1558018055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40273-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402722","9783642402739"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40273-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}