{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:27Z","timestamp":1750306347959,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T00:00:00Z","timestamp":1468972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FMJH Program Gaspard Monge in optimization and operation research"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,20]]},"DOI":"10.1145\/2908812.2908922","type":"proceedings-article","created":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T15:32:51Z","timestamp":1469633571000},"page":"1131-1138","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The (1+1) Elitist Black-Box Complexity of LeadingOnes"],"prefix":"10.1145","author":[{"given":"Carola","family":"Doerr","sequence":"first","affiliation":[{"name":"CNRS & Univ. Pierre et Marie Curie, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"LNCS 8066","author":"Afshani P.","year":"2013","unstructured":"P. Afshani , M. Agrawal , B. Doerr , C. Doerr , K. G. Larsen , and K. Mehlhorn . The query complexity of finding a hidden permutation . In LNCS 8066 , pages 1 -- 11 . Springer , 2013 . P. Afshani, M. Agrawal, B. Doerr, C. Doerr, K. G. Larsen, and K. Mehlhorn. The query complexity of finding a hidden permutation. In LNCS 8066, pages 1--11. Springer, 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885031.1885033"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463480"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967669"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35533-2_18"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9438-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9684-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754654"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754678"},{"key":"e_1_3_2_1_10_1","volume-title":"The (1+1) elitist black-box complexity of LeadingOnes","author":"Doerr C.","year":"2016","unstructured":"C. Doerr and J. Lengler . The (1+1) elitist black-box complexity of LeadingOnes . volume abs\/ 1604 .02355, 2016 . C. Doerr and J. Lengler. The (1+1) elitist black-box complexity of LeadingOnes. volume abs\/1604.02355, 2016."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1177-z"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1110381369"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_16_1","first-page":"15","volume-title":"PPSN'92","author":"M\u00fchlenbein H.","year":"1992","unstructured":"H. M\u00fchlenbein . How genetic algorithms really work: Mutation and hillclimbing . In PPSN'92 , pages 15 -- 26 . Elsevier , 1992 . H. M\u00fchlenbein. How genetic algorithms really work: Mutation and hillclimbing. In PPSN'92, pages 15--26. Elsevier, 1992."},{"key":"e_1_3_2_1_17_1","volume-title":"Kovac","author":"Rudolph G.","year":"1997","unstructured":"G. Rudolph . Convergence Properties of Evolutionary Algorithms . Kovac , 1997 . G. Rudolph. Convergence Properties of Evolutionary Algorithms. Kovac, 1997."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2202241"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"}],"event":{"name":"GECCO '16: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Denver Colorado USA","acronym":"GECCO '16"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference 2016"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908812.2908922","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2908812.2908922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:52Z","timestamp":1750222552000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908812.2908922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":19,"alternative-id":["10.1145\/2908812.2908922","10.1145\/2908812"],"URL":"https:\/\/doi.org\/10.1145\/2908812.2908922","relation":{},"subject":[],"published":{"date-parts":[[2016,7,20]]},"assertion":[{"value":"2016-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}