{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:35Z","timestamp":1760202815885,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T00:00:00Z","timestamp":1566864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Gaspard Monge Program for optimization, operations research and their interactions with data sciences","award":["ANR-11-LABX-0056-LMH, LabEx LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH, LabEx LMH"]}]},{"name":"Russian Science Foundation","award":["17-71-20178"],"award-info":[{"award-number":["17-71-20178"]}]},{"name":"Paris Ile-de-France Region"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,27]]},"DOI":"10.1145\/3299904.3340317","type":"proceedings-article","created":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:43:29Z","timestamp":1566243809000},"page":"169-182","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["A tight runtime analysis for the (1 + (\u03bb, \u03bb)) GA on leadingones"],"prefix":"10.1145","author":[{"given":"Denis","family":"Antipov","sequence":"first","affiliation":[{"name":"ITMO University, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitalii","family":"Karavaev","sequence":"additional","affiliation":[{"name":"ITMO University, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,8,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.01.007"},{"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\/3071178.3071297"},{"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\/2739480.2754684"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321731"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424797"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463565"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205553"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0190-3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460245"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35533-2_18"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/1426671"},{"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","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3326910"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0048-0"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-013-0991-0"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"},{"volume-title":"Convergence Properties of Evolutionary Algorithms","author":"Rudolph G\u00fcnter","key":"e_1_3_2_1_25_1","unstructured":"G\u00fcnter Rudolph . 1997. Convergence Properties of Evolutionary Algorithms . Verlag Dr . Kovac. G\u00fcnter Rudolph. 1997. Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovac."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2202241"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205595"},{"key":"e_1_3_2_1_28_1","volume-title":"PPSN","author":"Andrew","year":"2014","unstructured":"Andrew M. Sutton and Frank Neumann. 2014. Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulas. In Parallel Problem Solving from Nature , PPSN 2014 . Springer, 942--951. Andrew M. Sutton and Frank Neumann. 2014. Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulas. In Parallel Problem Solving from Nature, PPSN 2014. Springer, 942--951."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365606776022751"}],"event":{"name":"FOGA '19: Foundations of Genetic Algorithms XV","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Potsdam Germany","acronym":"FOGA '19"},"container-title":["Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299904.3340317","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299904.3340317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:39Z","timestamp":1750204419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299904.3340317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":29,"alternative-id":["10.1145\/3299904.3340317","10.1145\/3299904"],"URL":"https:\/\/doi.org\/10.1145\/3299904.3340317","relation":{},"subject":[],"published":{"date-parts":[[2019,8,27]]},"assertion":[{"value":"2019-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}