{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:41:58Z","timestamp":1761597718061},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,5,25]],"date-time":"2016-05-25T00:00:00Z","timestamp":1464134400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"FMJH Program Gaspard Monge in optimization and operation research"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s00453-016-0168-1","type":"journal-article","created":{"date-parts":[[2016,5,25]],"date-time":"2016-05-25T17:05:55Z","timestamp":1464195955000},"page":"610-640","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["OneMax in Black-Box Models with Several Restrictions"],"prefix":"10.1007","volume":"78","author":[{"given":"Carola","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"key":"168_CR1","doi-asserted-by":"publisher","unstructured":"Anil, G., Wiegand, R.P.: Black-box search by elimination of fitness functions. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201909), pp. 67\u201378. ACM (2009)","DOI":"10.1145\/1527125.1527135"},{"key":"168_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/9789814282673_0001","volume-title":"Theory of Randomized Search Heuristics","author":"B Doerr","year":"2011","unstructured":"Doerr, B.: Analyzing randomized search heuristics: tools from probability theory. In: Auger, A., Doerr, B. (eds.) Theory of Randomized Search Heuristics, pp. 1\u201320. World Scientific Publishing, Singapore (2011)"},{"key":"168_CR3","doi-asserted-by":"publisher","unstructured":"Doerr, B., Doerr, C.: Black-box complexity: from complexity theory to playing Mastermind. In: Proceedings of Genetic and Evolutionary Computation Conference, (GECCO\u201914), Companion Material, pp. 623\u2013646. Tutorial Slides, ACM (2014)","DOI":"10.1145\/2598394.2605352"},{"key":"168_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing new genetic algorithms. Theor. Comput. Sci. 567, 87\u2013104 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"168_CR5","doi-asserted-by":"publisher","unstructured":"Doerr, B., Johannsen, D., K\u00f6tzing, T., Lehre, P.K., Wagner, M., Winzen, C.: Faster black-box algorithms through higher arity operators. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201911), pp. 163\u2013172. ACM (2011)","DOI":"10.1145\/1967654.1967669"},{"key":"168_CR6","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/s00224-012-9438-8","volume":"55","author":"B Doerr","year":"2014","unstructured":"Doerr, B., Winzen, C.: Playing Mastermind with constant-size memory. Theory Comput. Syst. 55, 658\u2013684 (2014)","journal-title":"Theory Comput. Syst."},{"key":"168_CR7","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s00453-012-9684-9","volume":"68","author":"B Doerr","year":"2014","unstructured":"Doerr, B., Winzen, C.: Ranking-based black-box complexity. Algorithmica 68, 571\u2013609 (2014)","journal-title":"Algorithmica"},{"key":"168_CR8","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2013.05.004","volume":"545","author":"B Doerr","year":"2014","unstructured":"Doerr, B., Winzen, C.: Reducing the arity in unbiased black-box complexity. Theor. Comput. Sci. 545, 108\u2013121 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"168_CR9","doi-asserted-by":"publisher","unstructured":"Doerr, C., Lengler, J.: Elitist black-box models: Analyzing the impact of elitist selection on the performance of evolutionary algorithms. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201915), pp. 839\u2013846. ACM (2015)","DOI":"10.1145\/2739480.2754654"},{"key":"168_CR10","doi-asserted-by":"publisher","unstructured":"Doerr, C., Lengler, J.: Onemax in black-box models with several restrictions. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201915), pp. 1431\u20131438. ACM (2015)","DOI":"10.1145\/2739480.2754678"},{"key":"168_CR11","unstructured":"Droste, S., Jansen, T., Tinnefeld, K., Wegener, I.: A new framework for the valuation of algorithms for black-box optimization. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201902), pp. 253\u2013270. Morgan Kaufmann (2003)"},{"key":"168_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S Droste","year":"2006","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory Comput. Syst. 39, 525\u2013544 (2006)","journal-title":"Theory Comput. Syst."},{"key":"168_CR13","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 8, 229\u2013243 (1963)","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei"},{"key":"168_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.2307\/2312725","volume":"69","author":"OA Gross","year":"1962","unstructured":"Gross, O.A.: Preferential arrangements. Am. Math. Mon. 69, 4\u20138 (1962)","journal-title":"Am. Math. Mon."},{"key":"168_CR15","doi-asserted-by":"publisher","unstructured":"Jansen, T.: On the analysis of dynamic restart strategies for evolutionary algorithms. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201902), Lecture Notes in Computer Science, vol. 2439, pp. 33\u201343. Springer (2002)","DOI":"10.1007\/3-540-45712-7_4"},{"key":"168_CR16","doi-asserted-by":"publisher","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. In: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference (GECCO\u201910), pp. 1441\u20131448. ACM (2010)","DOI":"10.1145\/1830483.1830747"},{"key":"168_CR17","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica 64, 623\u2013642 (2012)","journal-title":"Algorithmica"},{"key":"168_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"168_CR19","doi-asserted-by":"publisher","unstructured":"Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in\u00a0evolutionary computation. Algorithmica 59, 369\u2013386 (2011). Erratum at \n                        http:\/\/arxiv.org\/abs\/1211.7184","DOI":"10.1007\/s00453-010-9387-z"},{"key":"168_CR20","doi-asserted-by":"publisher","unstructured":"Teytaud, O., Gelly, S.: General lower bounds for evolutionary algorithms. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201906), Lecture Notes in Computer Science, vol. 4193, pp. 21\u201331. Springer (2006)","DOI":"10.1007\/11844297_3"},{"key":"168_CR21","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Probabilistic computations: toward a unified measure of complexity. In: Proceedings of Foundations of Computer Science (FOCS\u201977), pp. 222\u2013227. IEEE (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0168-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0168-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0168-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0168-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:24Z","timestamp":1559087244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0168-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,25]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["168"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0168-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,25]]}}}