{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:55:21Z","timestamp":1783749321052,"version":"3.55.0"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-22-ERCS-0003-01"],"award-info":[{"award-number":["ANR-22-ERCS-0003-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00453-024-01258-9","type":"journal-article","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T07:01:51Z","timestamp":1721631711000},"page":"3115-3152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions"],"prefix":"10.1007","volume":"86","author":[{"given":"Carola","family":"Doerr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Duri Andrea","family":"Janett","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,22]]},"reference":[{"key":"1258_CR1","volume-title":"Stochastic Local Search: Foundations & Applications","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations & Applications. Elsevier\/Morgan Kaufmann, San Francisco (2004)"},{"key":"1258_CR2","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"1258_CR3","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2015","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Natural Computing Series, 2nd edn. Springer, Berlin, Heidelberg (2015)","edition":"2"},{"issue":"4","key":"1258_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/3472304","volume":"1","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Neumann, F.: A survey on recent progress in the theory of evolutionary algorithms for discrete optimization. ACM Trans. Evol. Learn. Optim. 1(4), 16\u201311643 (2021)","journal-title":"ACM Trans. Evol. Learn. Optim."},{"key":"1258_CR5","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO) (2017). ACM","DOI":"10.1145\/3071178.3071301"},{"key":"1258_CR6","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B.: Runtime analysis of a heavy-tailed $$(1+(\\lambda , \\lambda ))$$ genetic algorithm on jump functions. In: Proceedings of Parallel Problem Solving from Nature (PPSN). LNCS, pp. 545\u2013559 (2020). Springer","DOI":"10.1007\/978-3-030-58115-2_38"},{"key":"1258_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-022-00977-1","volume":"86","author":"H Bambury","year":"2024","unstructured":"Bambury, H., Bultel, A., Doerr, B.: An extended jump functions benchmark for the analysis of randomized search heuristics. Algorithmica 86, 1\u201332 (2024)","journal-title":"Algorithmica"},{"key":"1258_CR8","doi-asserted-by":"crossref","unstructured":"Antipov, D., Naumov, S.: The effect of non-symmetric fitness: The analysis of crossover-based algorithms on realjump functions. In: Proceedings of Foundations of Genetic Algorithms (FOGA), pp. 1\u201315 (2021). ACM","DOI":"10.1145\/3450218.3477311"},{"key":"1258_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing new genetic algorithms. Theoret. Comput. Sci. 567, 87\u2013104 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"1258_CR10","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1007\/s00453-022-00957-5","volume":"84","author":"D Antipov","year":"2022","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Fast mutation in crossover-based algorithms. Algorithmica 84, 1724\u20131761 (2022)","journal-title":"Algorithmica"},{"key":"1258_CR11","doi-asserted-by":"crossref","unstructured":"Ye, F., Doerr, C., B\u00e4ck, T.: Interpolating local and global search by controlling the variance of standard bit mutation. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 2292\u20132299 (2019). IEEE","DOI":"10.1109\/CEC.2019.8790107"},{"key":"1258_CR12","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Quinzan, F., Wagner, M.: Escaping large deceptive basins of attraction with heavy-tailed mutation operators. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), pp. 293\u2013300 (2018). ACM","DOI":"10.1145\/3205455.3205515"},{"key":"1258_CR13","doi-asserted-by":"crossref","unstructured":"Friedrich, T., G\u00f6bel, A., Quinzan, F., Wagner, M.: Heavy-tailed mutation operators in single-objective combinatorial optimization. In: Proceedings of Parallel Problem Solving from Nature (PPSN), pp. 134\u2013145 (2018). Springer","DOI":"10.1007\/978-3-319-99253-2_11"},{"key":"1258_CR14","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s11047-021-09841-7","volume":"20","author":"F Quinzan","year":"2021","unstructured":"Quinzan, F., G\u00f6bel, A., Wagner, M., Friedrich, T.: Evolutionary algorithms and submodular functions: Benefits of heavy-tailed mutations. Nat. Comput. 20, 561\u2013575 (2021)","journal-title":"Nat. Comput."},{"key":"1258_CR15","doi-asserted-by":"crossref","unstructured":"Buzdalov, M.: The $$(1+(\\lambda ,\\lambda ))$$ genetic algorithm on the vertex cover problem: Crossover helps leaving plateaus. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 1\u201310 (2022). IEEE","DOI":"10.1109\/CEC55065.2022.9870224"},{"key":"1258_CR16","doi-asserted-by":"crossref","unstructured":"Ye, F., Wang, H., Doerr, C., B\u00e4ck, T.: Benchmarking a genetic algorithm with configurable crossover probability. In: Proceedings of Parallel Problem Solving from Nature (PPSN), pp. 699\u2013713 (2020). Springer","DOI":"10.1007\/978-3-030-58115-2_49"},{"key":"1258_CR17","doi-asserted-by":"crossref","unstructured":"Mironovich, V., Buzdalov, M.: Evaluation of heavy-tailed mutation operator on maximum flow test generation problem. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO, Companion), pp. 1423\u20131426 (2017). ACM","DOI":"10.1145\/3067695.3082507"},{"key":"1258_CR18","unstructured":"Semenov, A., Chivilikhin, D., Pavlenko, A., Otpuschennikov, I., Ulyantsev, V., Ignatiev, A.: Evaluating the hardness of SAT instances using evolutionary optimization algorithms. In: Proceedings of International Conference on Principles and Practice of Constraint Programming (CP) (2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik"},{"key":"1258_CR19","doi-asserted-by":"crossref","unstructured":"Doerr, B., Zheng, W.: Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 12293\u201312301 (2021)","DOI":"10.1609\/aaai.v35i14.17459"},{"key":"1258_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, B., Qu, Z.: A first runtime analysis of the NSGA-II on a multimodal problem. In: Proceedings of Parallel Problem Solving from Nature (PPSN), pp. 399\u2013412 (2022). Springer","DOI":"10.1007\/978-3-031-14721-0_28"},{"key":"1258_CR21","doi-asserted-by":"crossref","unstructured":"Doerr, B., Hadri, O.E., Pinard, A.: The (1+($$\\lambda $$, $$\\lambda $$)) global SEMO algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), pp. 520\u2013528 (2022). ACM","DOI":"10.1145\/3512290.3528868"},{"key":"1258_CR22","doi-asserted-by":"crossref","unstructured":"Wu, M., Qian, C., Tang, K.: Dynamic mutation based pareto optimization for subset selection. In: Proceedings of Intelligent Computing Methodologies (ICIC), pp. 25\u201335 (2018). Springer","DOI":"10.1007\/978-3-319-95957-3_4"},{"issue":"2","key":"1258_CR23","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2021.05.011","volume":"297","author":"A Novak","year":"2022","unstructured":"Novak, A., Sucha, P., Novotny, M., Stec, R., Hanzalek, Z.: Scheduling jobs with normally distributed processing times on parallel machines. Eur. J. Oper. Res. 297(2), 422\u2013441 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"1258_CR24","doi-asserted-by":"crossref","unstructured":"Neumann, A., Xie, Y., Neumann, F.: Evolutionary algorithms for limiting the effect of uncertainty for the knapsack problem with stochastic profits. In: Proceedings of Parallel Problem Solving from Nature (PPSN), pp. 294\u2013307 (2022). Springer","DOI":"10.1007\/978-3-031-14714-2_21"},{"key":"1258_CR25","doi-asserted-by":"crossref","unstructured":"Klap\u00e1lek, J., Nov\u00e1k, A., Sojka, M., Hanz\u00e1lek, Z.: Car racing line optimization with genetic algorithm using approximate homeomorphism. In: 2021 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 601\u2013607 (2021). IEEE","DOI":"10.1109\/IROS51168.2021.9636503"},{"key":"1258_CR26","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s00453-023-01146-8","volume":"86","author":"B Doerr","year":"2024","unstructured":"Doerr, B., Ghannane, Y., Ibn Brahim, M.: Runtime analysis for permutation-based evolutionary algorithms. Algorithmica 86, 90\u2013129 (2024)","journal-title":"Algorithmica"},{"key":"1258_CR27","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), pp. 1115\u20131123 (2021). ACM","DOI":"10.1145\/3449639.3459377"},{"key":"1258_CR28","unstructured":"Doerr, C., Wang, H., Ye, F., Van\u00a0Rijn, S., B\u00e4ck, T.: IOHprofiler: A benchmarking and profiling tool for iterative optimization heuristics. arXiv preprint arXiv:1810.05281 (2018)"},{"issue":"1","key":"1258_CR29","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/3460310.3460312","volume":"14","author":"P Bennet","year":"2021","unstructured":"Bennet, P., Doerr, C., Moreau, A., Rapin, J., Teytaud, F., Teytaud, O.: Nevergrad: Black-box optimization platform. ACM SIGEVOlution 14(1), 8\u201315 (2021)","journal-title":"ACM SIGEVOlution"},{"key":"1258_CR30","doi-asserted-by":"crossref","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Automatic adaptation of hypermutation rates for multimodal optimisation. In: Proceedings of Foundations of Genetic Algorithms (FOGA), pp. 1\u201312 (2021). ACM","DOI":"10.1145\/3450218.3477305"},{"issue":"5","key":"1258_CR31","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1109\/TEVC.2021.3068574","volume":"25","author":"D Corus","year":"2021","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Fast immune system-inspired hypermutation operators for combinatorial optimization. IEEE Trans. Evol. Comput. 25(5), 956\u2013970 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1258_CR32","doi-asserted-by":"publisher","first-page":"113670","DOI":"10.1016\/j.tcs.2022.12.020","volume":"946","author":"B Doerr","year":"2022","unstructured":"Doerr, B., Rajabi, A.: Stagnation detection meets fast mutation. Theoret. Comput. Sci. 946, 113670 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"1258_CR33","doi-asserted-by":"crossref","unstructured":"Neumann, A., Antipov, D., Neumann, F.: Coevolutionary pareto diversity optimization. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), pp. 832\u2013839 (2022). ACM","DOI":"10.1145\/3512290.3528755"},{"key":"1258_CR34","doi-asserted-by":"crossref","unstructured":"Pavlenko, A., Chivilikhin, D., Semenov, A.: Asynchronous evolutionary algorithm for finding backdoors in boolean satisfiability. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138 (2022). IEEE","DOI":"10.1109\/CEC55065.2022.9870262"},{"key":"1258_CR35","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S Droste","year":"2006","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theo. Comput. Syst. 39, 525\u2013544 (2006)","journal-title":"Theo. Comput. Syst."},{"key":"1258_CR36","doi-asserted-by":"crossref","unstructured":"Doerr, C.: Complexity theory for discrete black-box optimization heuristics. Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, 133\u2013212 (2020)","DOI":"10.1007\/978-3-030-29414-4_3"},{"key":"1258_CR37","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica 64, 623\u2013642 (2012)","journal-title":"Algorithmica"},{"key":"1258_CR38","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D., K\u00f6tzing, T., Lehre, P.K., Wagner, M., Winzen, C.: Faster black-box algorithms through higher arity operators. In: Proceedings of Foundations of Genetic Algorithms (FOGA), pp. 163\u2013172 (2011). ACM","DOI":"10.1145\/1967654.1967669"},{"key":"1258_CR39","doi-asserted-by":"crossref","unstructured":"Doerr, B., Winzen, C.: Black-box complexity: Breaking the $$O (n \\log n)$$ barrier of LeadingOnes. In: Proceedings of Artificial Evolution (EA), pp. 205\u2013216 (2012). Springer","DOI":"10.1007\/978-3-642-35533-2_18"},{"key":"1258_CR40","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2012.10.039","volume":"471","author":"B Doerr","year":"2013","unstructured":"Doerr, B., K\u00f6tzing, T., Lengler, J., Winzen, C.: Black-box complexities of combinatorial problems. Theor. Comput. Sci. 471, 84\u2013106 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"1258_CR41","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2013.05.004","volume":"545","author":"B Doerr","year":"2014","unstructured":"Doerr, B., Doerr, C.: Reducing the arity in unbiased black-box complexity. Theor. Comput. Sci. 545, 108\u2013121 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1258_CR42","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1162\/EVCO_a_00158","volume":"23","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Unbiased black-box complexities of jump functions. Evol. Comput. 23(4), 641\u2013670 (2015)","journal-title":"Evol. Comput."},{"issue":"6","key":"1258_CR43","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/TEVC.2019.2954234","volume":"24","author":"PK Lehre","year":"2019","unstructured":"Lehre, P.K., Sudholt, D.: Parallel black-box complexity with tail bounds. IEEE Trans. Evol. Comput. 24(6), 1010\u20131024 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1258_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2019.06.014","volume":"801","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Doerr, C., Yang, J.: Optimal parameter choices via precise black-box analysis. Theor. Comput. Sci. 801, 1\u201334 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1258_CR45","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1162\/evco_a_00290","volume":"29","author":"N Buskulic","year":"2021","unstructured":"Buskulic, N., Doerr, C.: Maximizing drift is not optimal for solving OneMax. Evol. Comput. 29(4), 521\u2013541 (2021)","journal-title":"Evol. Comput."},{"key":"1258_CR46","doi-asserted-by":"crossref","unstructured":"Buzdalov, M., Doerr, C.: Optimal mutation rates for the $$(1+\\lambda )$$ EA on OneMax. In: Proceedings of Parallel Problem Solving from Nature (PPSN). LNCS, vol. 12270, pp. 574\u2013587 (2020). Springer","DOI":"10.1007\/978-3-030-58115-2_40"},{"key":"1258_CR47","doi-asserted-by":"crossref","unstructured":"Buzdalov, M., Doerr, C.: Optimal static mutation strength distributions for the $$(1+\\lambda )$$ evolutionary algorithm on OneMax. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), pp. 660\u2013668 (2021). ACM","DOI":"10.1145\/3449639.3459389"},{"issue":"2","key":"1258_CR48","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S0963548312000600","volume":"22","author":"C Witt","year":"2013","unstructured":"Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Comb. Probab. Comput. 22(2), 294\u2013318 (2013)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"1258_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3469800","volume":"1","author":"D Antipov","year":"2021","unstructured":"Antipov, D., Doerr, B.: Precise runtime analysis for plateau functions. ACM Trans. Evol. Learn. Optim. 1(4), 1\u201328 (2021)","journal-title":"ACM Trans. Evol. Learn. Optim."},{"key":"1258_CR50","doi-asserted-by":"crossref","unstructured":"Doerr, B., Kelley, A.J.: Fourier analysis meets runtime analysis: Precise runtimes on plateaus. In: Proc. of the Genetic and Evolutionary Computation Conference (GECCO), pp. 1555\u20131564. (2023). ACM","DOI":"10.1145\/3583131.3590393"},{"issue":"6","key":"1258_CR51","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/TEVC.2019.2917014","volume":"24","author":"J Lengler","year":"2019","unstructured":"Lengler, J.: A general dichotomy of evolutionary algorithms on monotone functions. IEEE Trans. Evol. Comput. 24(6), 995\u20131009 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1258_CR52","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"issue":"301","key":"1258_CR53","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"1258_CR54","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. Theory of evolutionary computation: Recent developments in discrete optimization, 1\u201387 (2020)","DOI":"10.1007\/978-3-030-29414-4_1"},{"key":"1258_CR55","doi-asserted-by":"crossref","unstructured":"Jorritsma, J., Lengler, J., Sudholt, D.: Comma selection outperforms plus selection on onemax with randomly planted optima. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), pp. 1602\u20131610. (2023). ACM","DOI":"10.1145\/3583131.3590488"},{"key":"1258_CR56","doi-asserted-by":"crossref","unstructured":"Poli, R., Wright, A., McPhee, N., Langdon, W.: Emergent behaviour, population-based search and low-pass filtering. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 88\u201395 (2006). IEEE","DOI":"10.1109\/CEC.2006.1688294"},{"key":"1258_CR57","doi-asserted-by":"crossref","unstructured":"J\u00e4gersk\u00fcpper, J.: A blend of Markov-chain and drift analysis. In: Proceedings of Parallel Problem Solving from Nature (PPSN), pp. 41\u201351 (2008). Springer","DOI":"10.1007\/978-3-540-87700-4_5"},{"key":"1258_CR58","doi-asserted-by":"crossref","unstructured":"Lengler, J., Spooner, N.: Fixed budget performance of the (1+1) EA on linear functions. In: Proceedings of Foundations of Genetic Algorithms (FOGA), pp. 52\u201361 (2015). ACM","DOI":"10.1145\/2725494.2725506"},{"issue":"3","key":"1258_CR59","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2013","unstructured":"Sudholt, D.: A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans. Evol. Comput. 17(3), 418\u2013435 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1258_CR60","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Drift analysis and linear functions revisited. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138 (2010). IEEE","DOI":"10.1109\/CEC.2010.5586097"},{"key":"1258_CR61","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2018.09.024","volume":"773","author":"B Doerr","year":"2019","unstructured":"Doerr, B.: Analyzing randomized search heuristics via stochastic domination. Theoret. Comput. Sci. 773, 115\u2013137 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"1258_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-020-00780-w","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B.: The runtime of the compact genetic algorithm on jump functions. Algorithmica 83, 1\u201349 (2021)","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-024-01258-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-024-01258-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-024-01258-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T07:04:47Z","timestamp":1727679887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-024-01258-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,22]]},"references-count":62,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1258"],"URL":"https:\/\/doi.org\/10.1007\/s00453-024-01258-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,22]]},"assertion":[{"value":"11 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}