{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:23Z","timestamp":1759638563179},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,10]],"date-time":"2010-03-10T00:00:00Z","timestamp":1268179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s00453-010-9396-y","type":"journal-article","created":{"date-parts":[[2010,3,9]],"date-time":"2010-03-09T19:47:10Z","timestamp":1268164030000},"page":"409-424","source":"Crossref","is-referenced-by-count":27,"title":["Combining Markov-Chain Analysis and Drift Analysis"],"prefix":"10.1007","volume":"59","author":[{"given":"Jens","family":"J\u00e4gersk\u00fcpper","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,10]]},"reference":[{"issue":"1\u20132","key":"9396_CR1","doi-asserted-by":"crossref","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\u201382 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9396_CR2","series-title":"LNCS","first-page":"415","volume-title":"Proc. 20th Int\u2019l Symposium on Theoretical Aspects of Computer Science (STACS)","author":"O. Giel","year":"2003","unstructured":"Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Proc. 20th Int\u2019l Symposium on Theoretical Aspects of Computer Science (STACS). LNCS, vol. 2607, pp. 415\u2013426. Springer, Berlin (2003)"},{"issue":"1","key":"9396_CR3","doi-asserted-by":"crossref","first-page":"57","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(1), 57\u201385 (2001)","journal-title":"Artif. Intell."},{"issue":"1\/2","key":"9396_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0004-3702(02)00260-6","volume":"140","author":"J. He","year":"2002","unstructured":"He, J., Yao, X.: Erratum to: Drift analysis and average time complexity of evolutionary algorithms (He and Xao 2001). Artif. Intell. 140(1\/2), 245\u2013248 (2002)","journal-title":"Artif. Intell."},{"issue":"1","key":"9396_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J. He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat. Comput. 3(1), 21\u201335 (2004)","journal-title":"Nat. Comput."},{"issue":"3","key":"9396_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.tcs.2007.02.042","volume":"379","author":"J. J\u00e4gersk\u00fcpper","year":"2007","unstructured":"J\u00e4gersk\u00fcpper, J.: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theor. Comput. Sci. 379(3), 329\u2013347 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9396_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-87700-4_5","volume-title":"Proc. 10th Int\u2019l Conference on Parallel Problem Solving from Nature","author":"J. J\u00e4gersk\u00fcpper","year":"2008","unstructured":"J\u00e4gersk\u00fcpper, J.: A blend of Markov-chain and drift analysis. In: Proc. 10th Int\u2019l Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, vol. 5199, pp. 41\u201351. Springer, Berlin (2008)"},{"key":"9396_CR8","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1145\/1068009.1068153","volume-title":"Proc. 2005 Genetic and Evolutionary Computation Conference (GECCO)","author":"J. J\u00e4gersk\u00fcpper","year":"2005","unstructured":"J\u00e4gersk\u00fcpper, J., Witt, C.: Rigorous runtime analysis of a (\u03bc+1)\u2009ES for the Sphere function. In: Proc. 2005 Genetic and Evolutionary Computation Conference (GECCO), pp. 849\u2013856. ACM, New York (2005)"},{"issue":"1\u20134","key":"9396_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.3233\/FI-1998-35123405","volume":"35","author":"G. Rudolph","year":"1998","unstructured":"Rudolph, G.: Finite Markov chain results in evolutionary computation: A tour d\u2019horizon. Fundam. Inform. 35(1\u20134), 67\u201389 (1998)","journal-title":"Fundam. Inform."},{"key":"9396_CR10","series-title":"Int\u2019l Series in Operations Research & Management Science","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/0-306-48041-7_14","volume-title":"Evolutionary Optimization","author":"I. Wegener","year":"2003","unstructured":"Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In: Sarker, R., Mohammadian, M., Yao, X. (eds.) Evolutionary Optimization. Int\u2019l Series in Operations Research & Management Science, vol. 48, pp. 349\u2013369. Kluwer Academic, Dordrecht (2003)"},{"issue":"1\u20132","key":"9396_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1017\/S0963548304006650","volume":"14","author":"I. Wegener","year":"2005","unstructured":"Wegener, I., Witt, C.: On the optimization of monotone polynomials by simple randomized search heuristics. Comb. Probab. Comput. 14(1\u20132), 225\u2013247 (2005)","journal-title":"Comb. Probab. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9396-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9396-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9396-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T22:26:26Z","timestamp":1591136786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9396-y"}},"subtitle":["The (1+1)\u00a0Evolutionary Algorithm on Linear Functions Reloaded"],"short-title":[],"issued":{"date-parts":[[2010,3,10]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9396"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9396-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,10]]}}}