{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:56:49Z","timestamp":1783749409529,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["FR 2988\/17-1"],"award-info":[{"award-number":["FR 2988\/17-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,26]]},"DOI":"10.1145\/3449639.3459352","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:51:58Z","timestamp":1624297918000},"page":"1142-1150","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Lower bounds from fitness levels made easy"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"PPSN","author":"Antipov Denis","year":"2020","unstructured":"Denis Antipov , Maxim Buzdalov , and Benjamin Doerr . 2020 . First steps towards a runtime analysis when starting with a good solution. In Parallel Problem Solving From Nature , PPSN 2020, Part II. Springer, 560--573. Denis Antipov, Maxim Buzdalov, and Benjamin Doerr. 2020. First steps towards a runtime analysis when starting with a good solution. In Parallel Problem Solving From Nature, PPSN 2020, Part II. Springer, 560--573."},{"key":"e_1_3_2_1_2_1","volume-title":"PPSN","author":"B\u00f6ttcher S\u00fcntje","year":"2010","unstructured":"S\u00fcntje B\u00f6ttcher , Benjamin Doerr , and Frank Neumann . 2010 . Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In Parallel Problem Solving from Nature , PPSN 2010. Springer, 1--10. S\u00fcntje B\u00f6ttcher, Benjamin Doerr, and Frank Neumann. 2010. Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In Parallel Problem Solving from Nature, PPSN 2010. Springer, 1--10."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390184"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2753538"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0103-x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.09.024"},{"key":"e_1_3_2_1_7_1","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"Doerr Benjamin","unstructured":"Benjamin Doerr . 2020. Probabilistic tools for the analysis of randomized optimization heuristics . In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization , Benjamin Doerr and Frank Neumann (Eds.). Springer , 1--87. Also available at https:\/\/arxiv.org\/abs\/1801.06733. Benjamin Doerr. 2020. Probabilistic tools for the analysis of randomized optimization heuristics. In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 1--87. Also available at https:\/\/arxiv.org\/abs\/1801.06733."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0341-1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.06.014"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830749"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001856"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463565"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321819"},{"key":"e_1_3_2_1_15_1","volume-title":"Lower Bounds from Fitness Levels Made Easy. CoRR abs\/2104.03372","author":"Doerr Benjamin","year":"2021","unstructured":"Benjamin Doerr and Timo K\u00f6tzing . 2021. Lower Bounds from Fitness Levels Made Easy. CoRR abs\/2104.03372 ( 2021 ). arXiv:2104.03372 Benjamin Doerr and Timo K\u00f6tzing. 2021. Lower Bounds from Fitness Levels Made Easy. CoRR abs\/2104.03372 (2021). arXiv:2104.03372"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.01.011"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1998.6.2.185"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460246"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.2.173"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0360-y"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00058-3"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00212"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340302"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.042"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.007"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00114"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001855"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13075-0_54"},{"key":"e_1_3_2_1_31_1","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"Lengler Johannes","unstructured":"Johannes Lengler . 2020. Drift analysis . In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization , Benjamin Doerr and Frank Neumann (Eds.). Springer , 89--131. Also available at https:\/\/arxiv.org\/abs\/1712.00964. Johannes Lengler. 2020. Drift analysis. In Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 89--131. Also available at https:\/\/arxiv.org\/abs\/1712.00964."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1108\/17563780910959893"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.2.195"},{"key":"e_1_3_2_1_34_1","volume-title":"Convergence Properties of Evolutionary Algorithms","author":"Rudolph G\u00fcnter","unstructured":"G\u00fcnter Rudolph . 1997. Convergence Properties of Evolutionary Algorithms . Verlag Dr . Kov\u01cec. G\u00fcnter Rudolph. 1997. Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kov\u01cec."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.003"},{"key":"e_1_3_2_1_36_1","volume-title":"PPSN","author":"Sudholt Dirk","year":"2010","unstructured":"Dirk Sudholt . 2010 . General lower bounds for the running time of evolutionary algorithms. In Parallel Problem Solving from Nature , PPSN 2010, Part I. Springer, 124--133. Dirk Sudholt. 2010. General lower bounds for the running time of evolutionary algorithms. In Parallel Problem Solving from Nature, PPSN 2010, Part I. Springer, 124--133."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2202241"},{"key":"e_1_3_2_1_38_1","volume-title":"Automata","author":"Wegener Ingo","year":"2001","unstructured":"Ingo Wegener . 2001. Theoretical aspects of evolutionary algorithms . In Automata , Languages and Programming, ICALP 2001 . Springer , 64--78. Ingo Wegener. 2001. Theoretical aspects of evolutionary algorithms. In Automata, Languages and Programming, ICALP 2001. Springer, 64--78."},{"key":"e_1_3_2_1_39_1","volume-title":"Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions","author":"Wegener Ingo","unstructured":"Ingo Wegener . 2002. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions . In Evolutionary Optimization, R. Sarker, X. Yao, and M. Mohammadian (Eds.). Kluwer , 349--369. Ingo Wegener. 2002. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In Evolutionary Optimization, R. Sarker, X. Yao, and M. Mohammadian (Eds.). Kluwer, 349--369."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2799693.2799868"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","location":"Lille France","acronym":"GECCO '21","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459352","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449639.3459352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:09Z","timestamp":1750195689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":40,"alternative-id":["10.1145\/3449639.3459352","10.1145\/3449639"],"URL":"https:\/\/doi.org\/10.1145\/3449639.3459352","relation":{},"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"2021-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}