{"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":1783749321041,"version":"3.55.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319992587","type":"print"},{"value":"9783319992594","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99259-4_10","type":"book-chapter","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T13:28:18Z","timestamp":1534771698000},"page":"117-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Precise Runtime Analysis for Plateaus"],"prefix":"10.1007","author":[{"given":"Denis","family":"Antipov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,21]]},"reference":[{"key":"10_CR1","unstructured":"Antipov, D., Doerr, B.: Precise runtime analysis for plateaus (2018). \nhttp:\/\/arxiv.org\/abs\/1806.01331"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15844-5_1","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 1\u201310. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15844-5_1"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TEVC.2008.2009064","volume":"13","author":"D Brockhoff","year":"2009","unstructured":"Brockhoff, D., Friedrich, T., Hebbinghaus, N., Klein, C., Neumann, F., Zitzler, E.: On the effects of adding objectives to plateau functions. IEEE Trans. Evol. Comput. 13(3), 591\u2013603 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1162\/EVCO_a_00185","volume":"24","author":"M Buzdalov","year":"2016","unstructured":"Buzdalov, M., Doerr, B., Kever, M.: The unrestricted black-box complexity of jump functions. Evol. Comput. 24(4), 719\u2013744 (2016)","journal-title":"Evol. Comput."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1007\/978-3-319-45823-6_83","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"D-C Dang","year":"2016","unstructured":"Dang, D.-C., et al.: Emergence of diversity and its benefits for crossover in genetic algorithms. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 890\u2013900. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-45823-6_83"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Dang, D.C., et al.: Escaping local optima with diversity mechanisms and crossover. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 645\u2013652. ACM (2016)","DOI":"10.1145\/2908812.2908956"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/s00453-015-0103-x","volume":"75","author":"D Dang","year":"2016","unstructured":"Dang, D., Lehre, P.K.: Runtime analysis of non-elitist populations: from classical optimisation to partial information. Algorithmica 75(3), 428\u2013461 (2016)","journal-title":"Algorithmica"},{"issue":"4","key":"10_CR8","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."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Sharp bounds by probability-generating functions and variable drift. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2011, pp. 2083\u20132090. ACM (2011)","DOI":"10.1145\/2001576.2001856"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1162\/evco.2007.15.4.401","volume":"15","author":"B Doerr","year":"2007","unstructured":"Doerr, B., Hebbinghaus, N., Neumann, F.: Speeding up evolutionary algorithms through asymmetric mutation operators. Evol. Comput. 15, 401\u2013410 (2007)","journal-title":"Evol. Comput."},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/EVCO_a_00055","volume":"21","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Mutation rate matters even when optimizing monotonic functions. Evol. Comput. 21(1), 1\u201327 (2013)","journal-title":"Evol. Comput."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, B., Jansen, T., Klein, C.: Comparing global and local mutations on bit strings. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2008, pp. 929\u2013936. ACM (2008)","DOI":"10.1145\/1389095.1389274"},{"issue":"4","key":"10_CR13","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(4), 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"10_CR14","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 777\u2013784. ACM (2017). \nhttp:\/\/arxiv.org\/abs\/1703.03334"},{"issue":"1\u20132","key":"10_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1\u20132), 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evol. Comput. 7(2), 173\u2013203 (1999)","journal-title":"Evol. Comput."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127, 51\u201381 (2001)","journal-title":"Artif. Intell."},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","volume":"34","author":"T Jansen","year":"2002","unstructured":"Jansen, T., Wegener, I.: The analysis of evolutionary algorithms\u2013a proof that crossover really can help. Algorithmica 34(1), 47\u201366 (2002)","journal-title":"Algorithmica"},{"issue":"4","key":"10_CR19","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(4), 623\u2013642 (2012)","journal-title":"Algorithmica"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-319-13075-0_54","volume-title":"Algorithms and Computation","author":"PK Lehre","year":"2014","unstructured":"Lehre, P.K., Witt, C.: Concentrated hitting times of randomized search heuristics with variable drift. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 686\u2013697. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-13075-0_54"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the runtime analysis of generalised selection hyper-heuristics for pseudo-boolean optimisation. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 849\u2013856. ACM (2017)","DOI":"10.1145\/3071178.3071288"},{"key":"10_CR22","volume-title":"Matrix Analysis and Applied Linear Algebra","year":"2000","unstructured":"Meyer, C.D. (ed.): Matrix Analysis and Applied Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Mironovich, V., Buzdalov, M.: Hard test generation for maximum flow algorithms with the fast crossover-based evolutionary algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2015, pp. 1229\u20131232. ACM (2015)","DOI":"10.1145\/2739482.2768487"},{"key":"10_CR24","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, 418\u2013435 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-48224-5_6","volume-title":"Automata, Languages and Programming","author":"I Wegener","year":"2001","unstructured":"Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 64\u201378. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-48224-5_6"},{"issue":"2","key":"10_CR26","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."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99259-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T14:34:52Z","timestamp":1535034892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99259-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992587","9783319992594"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99259-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}