{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:41Z","timestamp":1750306061217,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,15]],"date-time":"2017-07-15T00:00:00Z","timestamp":1500076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["074-U01"],"award-info":[{"award-number":["074-U01"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006289","name":"\u00c9lectricit\u00e9 de France","doi-asserted-by":"publisher","award":["FMJH Program Gaspard Monge in optimization and operations research"],"award-info":[{"award-number":["FMJH Program Gaspard Monge in optimization and operations research"]}],"id":[{"id":"10.13039\/501100006289","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,15]]},"DOI":"10.1145\/3067695.3084376","type":"proceedings-article","created":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T20:17:18Z","timestamp":1499804238000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The unrestricted black-box complexity of jump functions"],"prefix":"10.1145","author":[{"given":"Maxim","family":"Buzdalov","sequence":"first","affiliation":[{"name":"ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"Laboratoire d'Informatique (LIX), Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Kever","sequence":"additional","affiliation":[{"name":"ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms, number 8066 in Lecture Notes in Computer Science","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 Space-Efficient Data Structures, Streams, and Algorithms, number 8066 in Lecture Notes in Computer Science , 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 Space-Efficient Data Structures, Streams, and Algorithms, number 8066 in Lecture Notes in Computer Science, pages 1--11. Springer, 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527135"},{"key":"e_1_3_2_1_3_1","first-page":"892","volume-title":"Parallel Problem Solving from Nature XIII, number 8672 in Lecture Notes in Computer Science","author":"Badkobeh G.","year":"2014","unstructured":"G. Badkobeh , P. K. Lehre , and D. Sudholt . Unbiased black-box complexity of parallel search . In Parallel Problem Solving from Nature XIII, number 8672 in Lecture Notes in Computer Science , pages 892 -- 901 . Springer , 2014 . G. Badkobeh, P. K. Lehre, and D. Sudholt. Unbiased black-box complexity of parallel search. In Parallel Problem Solving from Nature XIII, number 8672 in Lecture Notes in Computer Science, pages 892--901. Springer, 2014."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00185"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.07.009"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598341"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.039"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9438-8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9684-9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754654"},{"key":"e_1_3_2_1_13_1","first-page":"253","volume-title":"Proceedings of Foundations of Genetic Algorithms","author":"Droste S.","year":"2003","unstructured":"S. Droste , T. Jansen , K. Tinnefeld , and I. Wegener . A new framework for the valuation of algorithms for black-box optimization . In Proceedings of Foundations of Genetic Algorithms , pages 253 -- 270 . Morgan Kaufmann , 2003 . S. Droste, T. Jansen, K. Tinnefeld, and I. Wegener. A new framework for the valuation of algorithms for black-box optimization. In Proceedings of Foundations of Genetic Algorithms, pages 253--270. Morgan Kaufmann, 2003."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1177-z"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725507"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830747"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001850"}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Berlin Germany","acronym":"GECCO '17"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3067695.3084376","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3067695.3084376","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:43Z","timestamp":1750215823000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3067695.3084376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,15]]},"references-count":18,"alternative-id":["10.1145\/3067695.3084376","10.1145\/3067695"],"URL":"https:\/\/doi.org\/10.1145\/3067695.3084376","relation":{},"subject":[],"published":{"date-parts":[[2017,7,15]]},"assertion":[{"value":"2017-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}