{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T01:29:10Z","timestamp":1787621350371,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T00:00:00Z","timestamp":1436572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union Seventh Framework Programme","award":["618091"],"award-info":[{"award-number":["618091"]}]},{"name":"Australian Research Council","award":["DP140103400"],"award-info":[{"award-number":["DP140103400"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,11]]},"DOI":"10.1145\/2739480.2754659","type":"proceedings-article","created":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T19:38:55Z","timestamp":1436297935000},"page":"1415-1422","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Universit\u00e9 Paris-Saclay, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew M.","family":"Sutton","sequence":"additional","affiliation":[{"name":"Hasso-Plattner-Institut, Universit\u00e4t Potsdam, Potsdam, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"245","volume-title":"Handbook of Satisfiability","author":"Achlioptas Dimitris","year":"2009","unstructured":"Dimitris Achlioptas . Random satisfiability . In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability , volume 185 of Frontiers in Artificial Intelligence and Applications , pages 245 -- 270 . IOS Press , 2009 . Dimitris Achlioptas. Random satisfiability. In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, pages 245--270. IOS Press, 2009."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20323"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704440107"},{"key":"e_1_3_2_1_4_1","first-page":"57","volume-title":"Proceedings of the Seventh International Conference on Genetic Algorithms","author":"Altenberg Lee","year":"1997","unstructured":"Lee Altenberg . Fitness distance correlation analysis: An instructive counterexample. In Thomas Back, editor , Proceedings of the Seventh International Conference on Genetic Algorithms , pages 57 -- 64 . Morgan Kaufmann , 1997 . Lee Altenberg. Fitness distance correlation analysis: An instructive counterexample. In Thomas Back, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 57--64. Morgan Kaufmann, 1997."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1996312"},{"key":"e_1_3_2_1_6_1","volume-title":"Manuscript","author":"Ben-Sasson Eli","year":"2002","unstructured":"Eli Ben-Sasson , Yonatan Bilu , and Danny Gutfreund . Finding a randomly planted assignment in a random 3-CNF . Manuscript , 2002 . Eli Ben-Sasson, Yonatan Bilu, and Danny Gutfreund. Finding a randomly planted assignment in a random 3-CNF. Manuscript, 2002."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1867270.1867274"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9585-3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0016"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/380383.380408"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17339-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645514.657929"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.264.5163.1297"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109608"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1867135.1867206"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v27:1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/645824.668915"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579445"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.06.008"},{"key":"e_1_3_2_1_23_1","series-title":"Lecture Notes in Computer Science","first-page":"942","volume-title":"Proceedings of the Thirteenth International Conference on Parallel Problem Solving from Nature (PPSN XIII)","author":"Andrew","year":"2014","unstructured":"Andrew M. Sutton and Frank Neumann. Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulas . In Thomas Bartz-Beielstein, J\u00fcrgen Branke, Bogdan Filipic, and Jim Smith, editors, Proceedings of the Thirteenth International Conference on Parallel Problem Solving from Nature (PPSN XIII) , volume 8672 of Lecture Notes in Computer Science , pages 942 -- 951 . Springer , 2014 . Andrew M. Sutton and Frank Neumann. Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulas. In Thomas Bartz-Beielstein, J\u00fcrgen Branke, Bogdan Filipic, and Jim Smith, editors, Proceedings of the Thirteenth International Conference on Parallel Problem Solving from Nature (PPSN XIII), volume 8672 of Lecture Notes in Computer Science, pages 942--951. Springer, 2014."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.09.013"}],"event":{"name":"GECCO '15: Genetic and Evolutionary Computation Conference","location":"Madrid Spain","acronym":"GECCO '15","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739480.2754659","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2739480.2754659","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:24Z","timestamp":1750227384000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739480.2754659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,11]]},"references-count":23,"alternative-id":["10.1145\/2739480.2754659","10.1145\/2739480"],"URL":"https:\/\/doi.org\/10.1145\/2739480.2754659","relation":{},"subject":[],"published":{"date-parts":[[2015,7,11]]},"assertion":[{"value":"2015-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}