{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:41Z","timestamp":1759847861999,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:00:00Z","timestamp":1593043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,25]]},"DOI":"10.1145\/3377930.3390184","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T19:29:12Z","timestamp":1593458952000},"page":"1295-1303","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Fixed-target runtime analysis"],"prefix":"10.1145","author":[{"given":"Maxim","family":"Buzdalov","sequence":"first","affiliation":[{"name":"ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Vinokurov","sequence":"additional","affiliation":[{"name":"ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"PPSN","author":"Badkobeh Golnaz","year":"2014","unstructured":"Golnaz Badkobeh , Per Kristian Lehre , and Dirk Sudholt . 2014 . Unbiased black-box complexity of parallel search. In Parallel Problem Solving from Nature , PPSN 2014. Springer, 892--901. Golnaz Badkobeh, Per Kristian Lehre, and Dirk Sudholt. 2014. Unbiased black-box complexity of parallel search. In Parallel Problem Solving from Nature, PPSN 2014. Springer, 892--901."},{"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.1109\/TEVC.2017.2753538"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.09.024"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321747"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0019-5"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_8_1","volume-title":"PPSN","author":"Doerr Benjamin","year":"2016","unstructured":"Benjamin Doerr , Carola Doerr , and Jing Yang . 2016 . k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation. In Parallel Problem Solving from Nature , PPSN 2016. Springer, 824--834. Benjamin Doerr, Carola Doerr, and Jing Yang. 2016. k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation. In Parallel Problem Solving from Nature, PPSN 2016. Springer, 824--834."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908950"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.06.014"},{"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","volume-title":"PPSN 2010 (Lecture Notes in Computer Science)","volume":"6238","author":"Doerr Benjamin","unstructured":"Benjamin Doerr and L.A. Goldberg . 2010. Drift Analysis with Tail Bounds. In Parallel Problem Solving from Nature , PPSN 2010 (Lecture Notes in Computer Science) , Vol. 6238 . Springer, 174--183. Benjamin Doerr and L.A. Goldberg. 2010. Drift Analysis with Tail Bounds. In Parallel Problem Solving from Nature, PPSN 2010 (Lecture Notes in Computer Science), Vol. 6238. Springer, 174--183."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463565"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation---Recent Developments in Discrete Optimization. Springer.  Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation---Recent Developments in Discrete Optimization. Springer.","DOI":"10.1007\/978-3-030-29414-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0168-1"},{"key":"e_1_3_2_1_17_1","unstructured":"Carola Doerr Hao Wang Furong Ye Sander van Rijn and Thomas B\u00e4ck. 2018. IOHprofiler: A benchmarking and profiling tool for iterative optimization heuristics. https:\/\/arxiv.org\/abs\/1810.05281. IOHprofiler is available at https:\/\/github.com\/IOHprofiler.  Carola Doerr Hao Wang Furong Ye Sander van Rijn and Thomas B\u00e4ck. 2018. IOHprofiler: A benchmarking and profiling tool for iterative optimization heuristics. https:\/\/arxiv.org\/abs\/1810.05281. IOHprofiler is available at https:\/\/github.com\/IOHprofiler."},{"key":"e_1_3_2_1_18_1","volume-title":"COCO: A platform for comparing continuous optimizers in a black-box setting. https:\/\/arxiv.org\/abs\/1603.08785.","author":"Hansen Niklaus","year":"2016","unstructured":"Niklaus Hansen , Anne Auger , Olaf Mersmann , Tea Tu\u0161ar , and Dimo Brockhoff . 2016 . COCO: A platform for comparing continuous optimizers in a black-box setting. https:\/\/arxiv.org\/abs\/1603.08785. Niklaus Hansen, Anne Auger, Olaf Mersmann, Tea Tu\u0161ar, and Dimo Brockhoff. 2016. COCO: A platform for comparing continuous optimizers in a black-box setting. https:\/\/arxiv.org\/abs\/1603.08785."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3322009"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00058-3"},{"volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","key":"e_1_3_2_1_21_1","unstructured":"Thomas Jansen . 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective . Springer . Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.01.002"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.007"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2349160"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0048-0"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.08.021"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13075-0_54"},{"volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"Lengler Johannes","key":"e_1_3_2_1_28_1","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_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725506"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598302"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_32_1","unstructured":"Eduardo Carvalho Pinto and Carola Doerr. 2018. Towards a more practice-aware runtime analysis of evolutionary algorithms. https:\/\/arxiv.org\/abs\/1812.00493.  Eduardo Carvalho Pinto and Carola Doerr. 2018. Towards a more practice-aware runtime analysis of evolutionary algorithms. https:\/\/arxiv.org\/abs\/1812.00493."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.03.052"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2202241"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3326906"},{"volume-title":"Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions","author":"Wegener Ingo","key":"e_1_3_2_1_36_1","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_37_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365606776022751"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/2799693.2799868"}],"event":{"name":"GECCO '20: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Canc\u00fan Mexico","acronym":"GECCO '20"},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390184","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377930.3390184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:40:59Z","timestamp":1750200059000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,25]]},"references-count":39,"alternative-id":["10.1145\/3377930.3390184","10.1145\/3377930"],"URL":"https:\/\/doi.org\/10.1145\/3377930.3390184","relation":{},"subject":[],"published":{"date-parts":[[2020,6,25]]},"assertion":[{"value":"2020-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}