{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:25:37Z","timestamp":1759847137032,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654091","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"1569-1577","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Run Time Bounds for Integer-Valued OneMax Functions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0869-0865","authenticated-orcid":false,"given":"Jonathan","family":"Gadea Harder","sequence":"first","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"},{"name":"University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1028-5228","authenticated-orcid":false,"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"},{"name":"University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3245-1685","authenticated-orcid":false,"given":"Xiaoyue","family":"Li","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"},{"name":"University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5667-8780","authenticated-orcid":false,"given":"Aishwarya","family":"Radhakrishnan","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"},{"name":"University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3564-4831","authenticated-orcid":false,"given":"Janosch","family":"Ruff","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"},{"name":"University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-00957-5"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-023-01098-z"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459313"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","unstructured":"Benjamin Doerr Carola Doerr and Timo K\u00f6tzing. 2015. Solving Problems with Unknown Solution Length at (Almost) No Extra Cost (GECCO '15). 831--838. 10.1145\/2739480.2754681","DOI":"10.1145\/2739480.2754681"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0341-1"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","unstructured":"Benjamin Doerr Yassine Ghannane and Marouane Ibn Brahim. 2022. Towards a Stronger Theory for Permutation-Based Evolutionary Algorithms (GECCO '22). 1390--1398. 10.1145\/3512290.3528720","DOI":"10.1145\/3512290.3528720"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781351077040"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.08.021"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-012-9616-8"},{"volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher Michael","key":"e_1_3_2_2_13_1","unstructured":"Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"G\u00fcnter Rudolph. 1994. An evolutionary algorithm for integer programming. In Parallel Problem Solving from Nature --- PPSN III Yuval Davidor Hans-Paul Schwefel and Reinhard M\u00e4nner (Eds.). 139--148.","DOI":"10.1007\/3-540-58484-6_258"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590410"}],"event":{"name":"GECCO '24: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Melbourne VIC Australia","acronym":"GECCO '24"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654091","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:50Z","timestamp":1750291010000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":15,"alternative-id":["10.1145\/3638529.3654091","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654091","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-07-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}