{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T14:07:21Z","timestamp":1780582041198,"version":"3.54.1"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T00:00:00Z","timestamp":1780531200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.tcs.2026.116084","type":"journal-article","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T15:48:31Z","timestamp":1780415311000},"page":"116084","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Diversity-preserving exploitation of crossover"],"prefix":"10.1016","volume":"1081","author":[{"given":"Johannes","family":"Lengler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom","family":"Offermann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116084_bib0001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2480741.2480752","article-title":"Exploration and exploitation in evolutionary algorithms: a survey","volume":"45","author":"\u010crepin\u0161ek","year":"2013","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.tcs.2026.116084_bib0002","series-title":"Next Generation Genetic Algorithms: A User\u2019s Guide and Tutorial","first-page":"pp.245","author":"Whitley","year":"2019"},{"key":"10.1016\/j.tcs.2026.116084_bib0003","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","article-title":"Escaping local optima using crossover with emergent diversity","volume":"22","author":"Dang","year":"2017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.tcs.2026.116084_bib0004","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1162\/EVCO_a_00171","article-title":"How crossover speeds up building block assembly in genetic algorithms","volume":"25","author":"Sudholt","year":"2017","journal-title":"Evol. Comput."},{"key":"10.1016\/j.tcs.2026.116084_bib0005","series-title":"Genetic and Evolutionary Computation Conference (GECCO 2024)","first-page":"pp.1605","article-title":"A tight O(4k\/pc) runtime bound for a (\u03bc + 1) GA on Jumpk for realistic crossover probabilities","author":"Lengler","year":"2024"},{"key":"10.1016\/j.tcs.2026.116084_bib0006","series-title":"AAAI Conference on Artificial Intelligence (AAAI 2024)","first-page":"pp.20683","article-title":"Runtime analysis of the (\u03bc + 1) GA: provable speed-ups from strong drift towards diverse populations","volume":"volume 38","author":"Doerr","year":"2024"},{"key":"10.1016\/j.tcs.2026.116084_bib0007","series-title":"Parallel Problem Solving from Nature (PPSN 2024)","first-page":"pp.102","article-title":"How population diversity influences the efficiency of crossover","author":"Cerf","year":"2024"},{"key":"10.1016\/j.tcs.2026.116084_bib0008","series-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","first-page":"pp.359","article-title":"The benefits of population diversity in evolutionary algorithms: a survey of rigorous runtime analyses","author":"Sudholt","year":"2020"},{"key":"10.1016\/j.tcs.2026.116084_bib0009","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","article-title":"Black-box search by unbiased variation","volume":"64","author":"Lehre","year":"2012","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116084_bib0010","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","article-title":"From black-box complexity to designing new genetic algorithms","volume":"567","author":"Doerr","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116084_bib0011","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3510426","article-title":"IOHanalyzer: detailed performance analyses for iterative optimization heuristics","volume":"2","author":"Wang","year":"2022","journal-title":"ACM Trans. Evol. Learn. Optim."},{"key":"10.1016\/j.tcs.2026.116084_bib0012","doi-asserted-by":"crossref","first-page":"2317","DOI":"10.1007\/s00453-024-01226-3","article-title":"Analysing equilibrium states for population diversity","volume":"86","author":"Lengler","year":"2024","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116084_bib0013","series-title":"Foundations of Genetic Algorithms (FOGA 2001)","first-page":"pp.69","article-title":"Analysis of recombinative algorithms on a non-separable building-block problem","author":"Watson","year":"2001"},{"key":"10.1016\/j.tcs.2026.116084_bib0014","series-title":"Genetic and Evolutionary Computation Conference (GECCO 2007)","first-page":"pp.1452","article-title":"A building-block royal road where crossover is provably essential","author":"Watson","year":"2007"},{"key":"10.1016\/j.tcs.2026.116084_bib0015","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.dam.2004.02.019","article-title":"Real royal road functions\u2014where crossover provably is essential","volume":"149","author":"Jansen","year":"2005","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.116084_bib0016","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1007\/s00453-021-00809-8","article-title":"Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem","volume":"83","author":"Sutton","year":"2021","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116084_bib0017","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","article-title":"The analysis of evolutionary algorithms\u2014a proof that crossover really can help","volume":"34","author":"Jansen","year":"2002","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116084_bib0018","series-title":"Parallel Problem Solving from Nature (PPSN 2018)","first-page":"pp.55","article-title":"Exploration and exploitation without mutation: solving the jump function in \u0398(n) time","author":"Whitley","year":"2018"},{"key":"10.1016\/j.tcs.2026.116084_bib0019","doi-asserted-by":"crossref","first-page":"3676","DOI":"10.1007\/s00453-020-00743-1","article-title":"On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms","volume":"82","author":"Corus","year":"2020","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116084_bib0020","series-title":"Genetic and Evolutionary Computation Conference (GECCO 2011)","first-page":"pp.989","article-title":"How crossover helps in pseudo-Boolean optimization","author":"K\u00f6tzing","year":"2011"},{"key":"10.1016\/j.tcs.2026.116084_bib0021","series-title":"Convergence Properties of Evolutionary Algorithms","author":"Rudolph","year":"1997"},{"key":"10.1016\/j.tcs.2026.116084_bib0022","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","article-title":"On the analysis of the (1 + 1) evolutionary algorithm","volume":"276","author":"Droste","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116084_bib0023","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1162\/evco_a_00195","article-title":"Introducing elitist black-box models: when does elitist behavior weaken the performance of evolutionary algorithms?","volume":"25","author":"Doerr","year":"2017","journal-title":"Evol. Comput."},{"key":"10.1016\/j.tcs.2026.116084_bib0024","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1007\/s00453-017-0304-6","article-title":"The (1+1) elitist black-box complexity of LeadingOnes","volume":"80","author":"Doerr","year":"2018","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116084_bib0025","series-title":"Foundations of Genetic Algorithms (FOGA 2011)","first-page":"pp.163","article-title":"Faster black-box algorithms through higher arity operators","author":"Doerr","year":"2011"},{"key":"10.1016\/j.tcs.2026.116084_bib0026","series-title":"Artificial Evolution (EA 2011)","first-page":"pp.205","article-title":"Black-box complexity: breaking the O(nlog\u2009n) barrier of LeadingOnes","author":"Doerr","year":"2012"},{"key":"10.1016\/j.tcs.2026.116084_bib0027","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.dam.2019.01.007","article-title":"The query complexity of a permutation-based variant of mastermind","volume":"260","author":"Afshani","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.116084_bib0028","first-page":"1483","article-title":"Significance-based estimation-of-distribution algorithms","volume":"24","author":"Doerr","year":"2020","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.tcs.2026.116084_bib0029","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1109\/TEVC.2022.3229038","article-title":"The competing genes evolutionary algorithm: avoiding genetic drift through competition, local search, and majority voting","volume":"27","author":"Ajimakin","year":"2022","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.tcs.2026.116084_bib0030","series-title":"Genetic and Evolutionary Computation Conference (GECCO 2017)","first-page":"pp.777","article-title":"Fast genetic algorithms","author":"Doerr","year":"2017"},{"key":"10.1016\/j.tcs.2026.116084_bib0031","doi-asserted-by":"crossref","first-page":"3108","DOI":"10.1007\/s00453-021-00854-3","article-title":"Self-adjusting mutation rates with provably optimal success rules","volume":"83","author":"Doerr","year":"2021","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116084_bib0032","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1214\/aos\/1176346079","article-title":"Negative association of random variables with applications","volume":"11","author":"Joag-Dev","year":"1983","journal-title":"Ann. Stat."},{"key":"10.1016\/j.tcs.2026.116084_bib0033","series-title":"Probabilistic Tools for the Analysis of Randomized Optimization Heuristics","first-page":"pp.1","author":"Doerr","year":"2020"},{"key":"10.1016\/j.tcs.2026.116084_bib0034","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","article-title":"The equation for response to selection and its use for prediction","volume":"5","author":"M\u00fchlenbein","year":"1997","journal-title":"Evol. Comput."},{"key":"10.1016\/j.tcs.2026.116084_bib0035","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","article-title":"Individual comparisons by ranking methods","volume":"1","author":"Wilcoxon","year":"1945","journal-title":"Biom. Bull."},{"key":"10.1016\/j.tcs.2026.116084_bib0036","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1214\/aoms\/1177730491","article-title":"On a test of whether one of two random variables is stochastically larger than the other","volume":"18","author":"Mann","year":"1947","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.tcs.2026.116084_bib0037","first-page":"65","article-title":"A simple sequentially rejective multiple test procedure","volume":"6","author":"Holm","year":"1979","journal-title":"Scand. J. Stat."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003348?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003348?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T13:41:56Z","timestamp":1780580516000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":37,"alternative-id":["S0304397526003348"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116084","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Diversity-preserving exploitation of crossover","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116084","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116084"}}