{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:45Z","timestamp":1750308705041,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,12]],"date-time":"2014-07-12T00:00:00Z","timestamp":1405123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["618091"],"award-info":[{"award-number":["618091"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,12]]},"DOI":"10.1145\/2576768.2598278","type":"proceedings-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:10:42Z","timestamp":1405080642000},"page":"1431-1438","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems"],"prefix":"10.1145","author":[{"given":"Andrew M.","family":"Sutton","sequence":"first","affiliation":[{"name":"Friedrich-Schiller-Universit\u00e4t Jena, Jena, Germany"}]}],"member":"320","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90002-4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463480"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"issue":"3","key":"e_1_3_2_1_4_1","first-page":"361","article-title":"Generalization of a probability limit theorem of Cram\u00e9r","volume":"54","author":"Feller William","year":"1943","journal-title":"Transactions of the American Mathematical Society"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Oliver\n       \n      Giel\n     and \n      \n      \n      Ingo\n       \n      Wegener\n    .\n      \n  \n   \n  Evolutionary algorithms and the maximum matching problem. In Helmut Alt and Michel Habib editors Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS) volume \n  2607\n   of \n  Lecture Notes in Computer Science pages \n  415\n  --\n  426\n  . \n  Springer 2003\n  .   Oliver Giel and Ingo Wegener. Evolutionary algorithms and the maximum matching problem. In Helmut Alt and Michel Habib editors Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS) volume 2607 of Lecture Notes in Computer Science pages 415--426. Springer 2003.","DOI":"10.1007\/3-540-36494-3_37"},{"key":"e_1_3_2_1_6_1","unstructured":"Ji\u0159\u00ed Matou\u0161ek and Jan Vondr\u00e1k. The probabilistic method (lecture notes) March 2008. http:\/\/kam.mff.cuni.cz\/~matousek\/prob-ln.ps.gz.  Ji\u0159\u00ed Matou\u0161ek and Jan Vondr\u00e1k. The probabilistic method (lecture notes) March 2008. http:\/\/kam.mff.cuni.cz\/~matousek\/prob-ln.ps.gz."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000730"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9370-8"},{"key":"e_1_3_2_1_9_1","unstructured":"Pietro S. Oliveto and Carsten Witt. Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. arXiv:1211.7184 {cs.NE}.  Pietro S. Oliveto and Carsten Witt. Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. arXiv:1211.7184 {cs.NE}."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9387-z"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100274"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068202"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"}],"event":{"name":"GECCO '14: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Vancouver BC Canada","acronym":"GECCO '14"},"container-title":["Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598278","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576768.2598278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:00Z","timestamp":1750277640000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,12]]},"references-count":14,"alternative-id":["10.1145\/2576768.2598278","10.1145\/2576768"],"URL":"https:\/\/doi.org\/10.1145\/2576768.2598278","relation":{},"subject":[],"published":{"date-parts":[[2014,7,12]]},"assertion":[{"value":"2014-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}