{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:55Z","timestamp":1773481795924,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,12]],"date-time":"2011-07-12T00:00:00Z","timestamp":1310428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,7,12]]},"DOI":"10.1145\/2001576.2001710","type":"proceedings-article","created":{"date-parts":[[2011,7,15]],"date-time":"2011-07-15T12:25:09Z","timestamp":1310732709000},"page":"981-988","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Black-box complexities of combinatorial problems"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Max-Planck-Institute for Informatics, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[{"name":"Max-Planck-Institute for Informatics, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Winzen","sequence":"additional","affiliation":[{"name":"Max-Planck-Institute for Informatics, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527134"},{"key":"e_1_3_2_1_2_1","unstructured":"B. Doerr E. Happ and C. Klein. A tight analysis of the (1  B. Doerr E. Happ and C. Klein. A tight analysis of the (1"},{"key":"e_1_3_2_1_3_1","first-page":"1890","volume-title":"Proc. of CEC'07","year":"2007"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389202"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830618"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967669"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885031.1885052"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001851"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569937"},{"key":"e_1_3_2_1_10_1","unstructured":"B. Doerr and C. Winzen. Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. ArXiv e-prints 1102.1140 2011. To appear in Proc. of CSR'11 Springer.   B. Doerr and C. Winzen. Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. ArXiv e-prints 1102.1140 2011. To appear in Proc. of CSR'11 Springer."},{"key":"e_1_3_2_1_11_1","first-page":"253","volume-title":"Proc. of FOGA'03","author":"Droste S.","year":"2003"},{"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.1145\/1830483.1830747"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_73"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_16_1","volume-title":"Springer","author":"Neumann F.","year":"2010"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527130"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645826.669417"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"}],"event":{"name":"GECCO '11: Genetic and Evolutionary Computation Conference","location":"Dublin Ireland","acronym":"GECCO '11","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 13th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001576.2001710","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2001576.2001710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:20Z","timestamp":1750244780000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001576.2001710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,12]]},"references-count":20,"alternative-id":["10.1145\/2001576.2001710","10.1145\/2001576"],"URL":"https:\/\/doi.org\/10.1145\/2001576.2001710","relation":{},"subject":[],"published":{"date-parts":[[2011,7,12]]},"assertion":[{"value":"2011-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}