{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:04:50Z","timestamp":1773655490782,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"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"}],"funder":[{"DOI":"10.13039\/100009094","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["17-71-20178"],"award-info":[{"award-number":["17-71-20178"]}],"id":[{"id":"10.13039\/100009094","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005304","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH, LabEx LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH, LabEx LMH"]}],"id":[{"id":"10.13039\/501100005304","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,25]]},"DOI":"10.1145\/3377930.3390172","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T19:29:12Z","timestamp":1593458952000},"page":"1268-1276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Fast mutation in crossover-based algorithms"],"prefix":"10.1145","author":[{"given":"Denis","family":"Antipov","sequence":"first","affiliation":[{"name":"ITMO University, St. Petersburg, Russia and Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Buzdalov","sequence":"additional","affiliation":[{"name":"ITMO University, St. 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"}]}],"member":"320","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Fast mutation in crossover-based algorithms. CoRR abs\/2004.06538","author":"Antipov Denis","year":"2020","unstructured":"Denis Antipov , Maxim Buzdalov , and Benjamin Doerr . 2020. Fast mutation in crossover-based algorithms. CoRR abs\/2004.06538 ( 2020 ). Denis Antipov, Maxim Buzdalov, and Benjamin Doerr. 2020. Fast mutation in crossover-based algorithms. CoRR abs\/2004.06538 (2020)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340317"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390148"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics. World Scientific Publishing.  Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics. World Scientific Publishing.","DOI":"10.1142\/7438"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645513.657408"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071297"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389823"},{"key":"e_1_3_2_1_8_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_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00055"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.03.015"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_14_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_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0214-z"},{"key":"e_1_3_2_1_17_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Brian","year":"2014","unstructured":"Brian W. Goldman and William F. Punch. 2014. Parameter-less population pyramid . In Genetic and Evolutionary Computation Conference, GECCO 2014 . ACM, 785--792. Brian W. Goldman and William F. Punch. 2014. Parameter-less population pyramid. In Genetic and Evolutionary Computation Conference, GECCO 2014. ACM, 785--792."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00058-3"},{"key":"e_1_3_2_1_19_1","volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","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_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_21_1","volume-title":"PPSN","author":"Lehre Per Kristian","year":"2010","unstructured":"Per Kristian Lehre . 2010 . Negative drift in populations. In Parallel Problem Solving from Nature , PPSN 2010. Springer, 244--253. Per Kristian Lehre. 2010. Negative drift in populations. In Parallel Problem Solving from Nature, PPSN 2010. Springer, 244--253."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001855"},{"key":"e_1_3_2_1_23_1","volume-title":"PPSN","author":"Lengler Johannes","year":"2018","unstructured":"Johannes Lengler . 2018 . A general dichotomy of evolutionary algorithms on monotone functions. In Parallel Problem Solving from Nature , PPSN 2018. Springer, 3--15. Johannes Lengler. 2018. A general dichotomy of evolutionary algorithms on monotone functions. In Parallel Problem Solving from Nature, PPSN 2018. Springer, 3--15."},{"key":"e_1_3_2_1_24_1","volume-title":"PPSN","author":"M\u00fchlenbein Heinz","year":"1992","unstructured":"Heinz M\u00fchlenbein . 1992 . How genetic algorithms really work: Mutation and hillclimbing. In Parallel Problem Solving from Nature , PPSN 1992. Elsevier, 15--26. Heinz M\u00fchlenbein. 1992. How genetic algorithms really work: Mutation and hillclimbing. In Parallel Problem Solving from Nature, PPSN 1992. Elsevier, 15--26."},{"key":"e_1_3_2_1_25_1","volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"Neumann Frank","unstructured":"Frank Neumann and Carsten Witt . 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity . Springer . Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer."},{"key":"e_1_3_2_1_26_1","volume-title":"Towards a more practice-aware runtime analysis of evolutionary algorithms. CoRR abs\/1812.00493","author":"Pinto Eduardo Carvalho","year":"2018","unstructured":"Eduardo Carvalho Pinto and Carola Doerr . 2018. Towards a more practice-aware runtime analysis of evolutionary algorithms. CoRR abs\/1812.00493 ( 2018 ). Eduardo Carvalho Pinto and Carola Doerr. 2018. Towards a more practice-aware runtime analysis of evolutionary algorithms. CoRR abs\/1812.00493 (2018)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.038"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"e_1_3_2_1_29_1","volume-title":"PPSN","author":"Teytaud Olivier","year":"2006","unstructured":"Olivier Teytaud and Sylvain Gelly . 2006 . General lower bounds for evolutionary algorithms. In Parallel Problem Solving from Nature , PPSN 2006. Springer, 21--31. Olivier Teytaud and Sylvain Gelly. 2006. General lower bounds for evolutionary algorithms. In Parallel Problem Solving from Nature, PPSN 2006. Springer, 21--31."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731092"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365606776022751"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"}],"event":{"name":"GECCO '20: Genetic and Evolutionary Computation Conference","location":"Canc\u00fan Mexico","acronym":"GECCO '20","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390172","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377930.3390172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:07Z","timestamp":1750200067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,25]]},"references-count":32,"alternative-id":["10.1145\/3377930.3390172","10.1145\/3377930"],"URL":"https:\/\/doi.org\/10.1145\/3377930.3390172","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"}}]}}