{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:10:11Z","timestamp":1750223411798,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"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":"European Union Seventh Framework Programme (FP7\/2007-2013)","award":["618091"],"award-info":[{"award-number":["618091"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,20]]},"DOI":"10.1145\/2908812.2908846","type":"proceedings-article","created":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T15:32:51Z","timestamp":1469633571000},"page":"669-676","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Runtime Analysis for the Parameter-less Population Pyramid"],"prefix":"10.1145","author":[{"given":"Brian W.","family":"Goldman","sequence":"first","affiliation":[{"name":"Colorado State University, Fort Collins, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[{"name":"University of Sheffield, Sheffield, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"World Scientific","author":"Auger A.","year":"2011","unstructured":"A. Auger and B. Doerr , editors. Theory of Randomized Search Heuristics -- Foundations and Recent Developments. Number 1 in Series on Theoretical Computer Science . World Scientific , 2011 . A. Auger and B. Doerr, editors. Theory of Randomized Search Heuristics -- Foundations and Recent Developments. Number 1 in Series on Theoretical Computer Science. World Scientific, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.818192"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598227"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598350"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00148"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms -- The Computer Science Perspective","author":"Jansen T.","year":"2013","unstructured":"T. Jansen . Analyzing Evolutionary Algorithms -- The Computer Science Perspective . Springer , 2013 . T. Jansen. Analyzing Evolutionary Algorithms -- The Computer Science Perspective. Springer, 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00114"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330255"},{"key":"e_1_3_2_1_11_1","volume-title":"Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity","author":"Neumann F.","year":"2010","unstructured":"F. Neumann and C. Witt . Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity . Springer , 2010 . F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity. Springer, 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.015"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725498"},{"volume-title":"How crossover speeds up building-block assembly in genetic algorithms. Evolutionary Computation","author":"Sudholt D.","key":"e_1_3_2_1_14_1","unstructured":"D. Sudholt . How crossover speeds up building-block assembly in genetic algorithms. Evolutionary Computation . In press . D. Sudholt. How crossover speeds up building-block assembly in genetic algorithms. Evolutionary Computation. In press."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789814282673_0005"}],"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.2908846","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2908812.2908846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:18Z","timestamp":1750222458000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908812.2908846"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":15,"alternative-id":["10.1145\/2908812.2908846","10.1145\/2908812"],"URL":"https:\/\/doi.org\/10.1145\/2908812.2908846","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"}}]}}