G. Anil and R. P. Wiegand, Black-box search by elimination of fitness functions, Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, FOGA '09, pp.67-78, 2009.
DOI : 10.1145/1527125.1527135

A. Auger, Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed, Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference, GECCO '09, pp.2447-2452, 2009.
DOI : 10.1145/1570256.1570342
URL : https://hal.archives-ouvertes.fr/inria-00430515

A. Auger and N. Hansen, Linear convergence on positively homogeneous functions of a comparison based step-size adaptive randomized search: the (1+1) ES with generalized one-fifth success rule (2013) CoRR abs, p.8397, 1310.

G. Badkobeh, P. K. Lehre, and D. Sudholt, Unbiased Black-Box Complexity of??Parallel??Search, Proc. of Parallel Problem Solving from Nature (PPSN'14), pp.892-901, 2014.
DOI : 10.1007/978-3-319-10762-2_88

S. Böttcher, B. Doerr, and F. Neumann, Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem, Proc. of Parallel Problem Solving from Nature (PPSN'10), pp.1-10, 2010.
DOI : 10.1007/978-3-642-15844-5_1

D. Dang, T. Friedrich, T. Kötzing, M. S. Krejca, P. K. Lehre et al., Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms, Proc. of Parallel Problem Solving from Nature (PPSN'16), pp.890-900, 2016.
DOI : 10.1016/j.tcs.2014.10.028

D. Dang, T. Friedrich, T. Kötzing, M. S. Krejca, P. K. Lehre et al., Escaping Local Optima with Diversity Mechanisms and Crossover, Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, GECCO '16, pp.645-652, 2016.
DOI : 10.1162/106365606776022751
URL : http://dl.acm.org/ft_gateway.cfm?id=2908956&type=pdf

D. C. Dang and P. K. Lehre, Self-adaptation of Mutation Rates in Non-elitist Populations, Proc. of Parallel Problem Solving from Nature (PPSN'16), pp.803-813, 2016.
DOI : 10.1016/j.jtbi.2014.09.017

D. Jong and K. A. , An analysis of the behavior of a class of genetic adaptive systems, 1975.

L. Devroye, The compound random search, 1972.

B. Doerr, Analyzing randomized search heuristics: Tools from probability theory Theory of Randomized Search Heuristics, pp.1-20, 2011.

B. Doerr, Optimal Parameter Settings for the (1 + ??, ??) Genetic Algorithm, Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, GECCO '16, pp.1107-1114, 2016.
DOI : 10.1017/S0963548312000600

B. Doerr and C. Doerr, Optimal Parameter Choices Through Self-Adjustment, Proceedings of the 2015 on Genetic and Evolutionary Computation Conference, GECCO '15, pp.1335-1342, 2015.
DOI : 10.1109/SFCS.1977.24
URL : https://hal.archives-ouvertes.fr/hal-01272868

B. Doerr and C. Doerr, A Tight Runtime Analysis of the (1+(??, ??)) Genetic Algorithm on OneMax, Proceedings of the 2015 on Genetic and Evolutionary Computation Conference, GECCO '15, pp.1423-1430, 2015.
DOI : 10.1016/j.ipl.2013.09.013
URL : https://hal.archives-ouvertes.fr/hal-01272869

B. Doerr, C. Doerr, and F. Ebel, Lessons from the black-box, Proceeding of the fifteenth annual conference on Genetic and evolutionary computation conference, GECCO '13, pp.781-788, 2013.
DOI : 10.1145/2463372.2463480

B. Doerr, C. Doerr, and F. Ebel, From black-box complexity to designing new genetic algorithms, Theoretical Computer Science, vol.567, pp.87-104, 2015.
DOI : 10.1016/j.tcs.2014.11.028
URL : https://hal.archives-ouvertes.fr/hal-01272858

B. Doerr, C. Doerr, and T. Kötzing, Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables, Proc. of Parallel Problem Solving from Nature (PPSN'16), pp.782-791, 2016.
DOI : 10.1007/3-540-58484-6_258
URL : https://hal.archives-ouvertes.fr/hal-01363911

B. Doerr, C. Doerr, and T. Kötzing, The Right Mutation Strength for Multi-Valued Decision Variables, Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, GECCO '16, pp.1115-1122, 2016.
DOI : 10.1017/S0963548312000600
URL : https://hal.archives-ouvertes.fr/hal-01363932

B. Doerr, C. Doerr, and J. Yang, k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation, Proc. of Parallel Problem Solving from Nature (PPSN'16), pp.824-834, 2016.
DOI : 10.1109/CEC.2002.1007058
URL : https://hal.archives-ouvertes.fr/hal-01363906

B. Doerr and L. A. Goldberg, Drift Analysis with Tail Bounds, Proc. of Parallel Problem Solving from Nature (PPSN'10), pp.174-183, 2010.
DOI : 10.1007/978-3-642-15844-5_18

B. Doerr and L. A. Goldberg, Adaptive Drift Analysis, Algorithmica, vol.59, issue.3, pp.224-250, 2013.
DOI : 10.1007/s00453-010-9387-z

B. Doerr, E. Happ, and C. Klein, Crossover can provably be useful in evolutionary computation, Theoretical Computer Science, vol.425, pp.17-33, 2012.
DOI : 10.1016/j.tcs.2010.10.035
URL : http://www.mpi-sb.mpg.de/~doerr/papers/gecco2008_1.pdf

B. Doerr, T. Jansen, D. Sudholt, C. Winzen, and C. Zarges, Mutation Rate Matters Even When Optimizing Monotonic Functions, Evolutionary Computation, vol.6825, issue.1, pp.1-27, 2013.
DOI : 10.1007/s00453-010-9387-z
URL : https://hal.archives-ouvertes.fr/hal-01086549

B. Doerr, D. Johannsen, T. Kötzing, P. K. Lehre, M. Wagner et al., Faster black-box algorithms through higher arity operators, Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms, FOGA '11, pp.163-172, 2011.
DOI : 10.1145/1967654.1967669
URL : http://arxiv.org/pdf/1012.0952.pdf

B. Doerr, D. Johannsen, T. Kötzing, F. Neumann, and M. Theile, More effective crossover operators for the all-pairs shortest path problem, Theoretical Computer Science, vol.471, pp.12-26, 2013.
DOI : 10.1016/j.tcs.2012.10.059
URL : http://arxiv.org/pdf/1207.0369

B. Doerr, D. Johannsen, and C. Winzen, Multiplicative Drift Analysis, Algorithmica, vol.59, issue.3, pp.673-697, 2012.
DOI : 10.1007/s00453-010-9387-z
URL : http://arxiv.org/pdf/1101.0776.pdf

B. Doerr and M. Künnemann, Optimizing linear functions with the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>??</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math> evolutionary algorithm???Different asymptotic runtimes for different instances, Theoretical Computer Science, vol.561, pp.3-23, 2015.
DOI : 10.1016/j.tcs.2014.03.015

B. Doerr and M. Theile, Improved analysis methods for crossover-based algorithms, Proceedings of the 11th Annual conference on Genetic and evolutionary computation, GECCO '09, pp.247-254, 2009.
DOI : 10.1145/1569901.1569937

S. Droste, T. Jansen, and I. Wegener, On the analysis of the (1+1) evolutionary algorithm, Theoretical Computer Science, vol.276, issue.1-2, pp.51-81, 2002.
DOI : 10.1016/S0304-3975(01)00182-7

S. Droste, T. Jansen, and I. Wegener, Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization, Theory of Computing Systems, vol.39, issue.4, pp.525-544, 2006.
DOI : 10.1007/s00224-004-1177-z

A. E. Eiben, R. Hinterding, and Z. Michalewicz, Parameter control in evolutionary algorithms, IEEE Transactions on Evolutionary Computation, vol.3, issue.2, pp.124-141, 1999.
DOI : 10.1109/4235.771166
URL : https://hal.archives-ouvertes.fr/inria-00140549

A. E. Eiben and J. E. Smith, Introduction to Evolutionary Computing, 2003.

P. Erd?-os and A. Rényi, On two problems of information theory, Magyar Tudományos Akadémia Matematikai Kutató Intézet Közleményei, vol.8, pp.229-243, 1963.

S. Fischer and I. Wegener, The Ising Model on the Ring: Mutation Versus Recombination, Proc. of Genetic and Evolutionary Computation Conference, pp.1113-1124, 2004.
DOI : 10.1007/978-3-540-24854-5_109

C. Gießen and C. Witt, Population size vs. mutation strength for the (1+?) EA on One- Max, Proc. of Genetic and Evolutionary Computation Conference (GECCO'15), pp.1439-1446, 2015.

B. W. Goldman and W. F. Punch, Parameter-less population pyramid, Proceedings of the 2014 conference on Genetic and evolutionary computation, GECCO '14, pp.785-792, 2014.
DOI : 10.1145/2576768.2598350
URL : http://dl.acm.org/ft_gateway.cfm?id=2598350&type=pdf

N. Hansen, A. Gawelczyk, and A. Ostermeier, Sizing the population with respect to the local progress in (1,??)-evolution strategies-a theoretical analysis, Proceedings of 1995 IEEE International Conference on Evolutionary Computation, pp.80-85, 1995.
DOI : 10.1109/ICEC.1995.489123

J. He and X. Yao, Drift analysis and average time complexity of evolutionary algorithms, Artificial Intelligence, vol.127, issue.1, pp.57-85, 2001.
DOI : 10.1016/S0004-3702(01)00058-3

J. Jägersküpper, Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes, Proc. of Foundations of Genetic Algorithms (FOGA'05), pp.260-281, 2005.
DOI : 10.1007/11513575_14

T. Jansen, Analyzing Evolutionary Algorithms?The Computer Science Perspective, 2013.

T. Jansen, D. Jong, K. A. Wegener, and I. , On the Choice of the Offspring Population Size in Evolutionary Algorithms, Evolutionary Computation, vol.13, issue.4, pp.413-440, 2005.
DOI : 10.1109/4235.974841

T. Jansen and I. Wegener, The Analysis of Evolutionary Algorithms???A Proof That Crossover Really Can Help, Algorithmica, vol.34, issue.1, pp.47-66, 2002.
DOI : 10.1007/s00453-002-0940-2

T. Jansen and I. Wegener, On the analysis of a dynamic evolutionary algorithm, Journal of Discrete Algorithms, vol.4, issue.1, pp.181-199, 2006.
DOI : 10.1016/j.jda.2005.01.002

G. Karafotias, M. Hoogendoorn, and A. Eiben, Parameter Control in Evolutionary Algorithms: Trends and Challenges, IEEE Transactions on Evolutionary Computation, vol.19, issue.2, pp.167-187, 2015.
DOI : 10.1109/TEVC.2014.2308294

S. Kern, S. D. Müller, N. Hansen, D. Büche, J. Ocenasek et al., Learning probability distributions in continuous evolutionary algorithms ??? a comparative review, Natural Computing, vol.3, issue.1, pp.77-112, 2004.
DOI : 10.1023/B:NACO.0000023416.59689.4e

T. Kötzing, Concentration of first hitting times under additive drift, Proc. of Genetic and Evolutionary Computation Conference (GECCO'14), pp.1391-1398, 2014.

J. Lässig and D. Sudholt, Adaptive population models for offspring populations and parallel evolutionary algorithms, Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms, FOGA '11, pp.181-192, 2011.
DOI : 10.1145/1967654.1967671

P. K. Lehre and C. Witt, Black-Box Search by Unbiased Variation, Algorithmica, vol.14, issue.1, pp.623-642, 2012.
DOI : 10.1017/S0963548304006650
URL : http://orbit.dtu.dk/en/publications/blackbox-search-by-unbiased-variation(2c972069-d476-4182-893a-2dd906a4cf92).html

V. Mironovich and M. Buzdalov, Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm, Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference, GECCO Companion '15, pp.1229-1232, 2015.
DOI : 10.1145/321679.321693

M. Mitchell, J. H. Holland, and S. Forrest, When will a genetic algorithm outperform hill climbing?, Proceeding of the 7th Neural Information Processing Systems Conference (NIPS'93), Advances in Neural Information Processing Systems, pp.51-58

P. S. Oliveto, P. K. Lehre, and F. Neumann, Theoretical analysis of rank-based mutation - combining exploration and exploitation, 2009 IEEE Congress on Evolutionary Computation, pp.1455-1462, 2009.
DOI : 10.1109/CEC.2009.4983114

P. S. Oliveto and X. Yao, Runtime Analysis of Evolutionary Algorithms for Discrete Optimization, Theory of Randomized Search Heuristics, pp.21-52, 2011.
DOI : 10.1142/9789814282673_0002

M. Raab and A. Steger, ???Balls into Bins??? ??? A Simple and Tight Analysis, Proc. of Randomization and Approximation Techniques in Computer Science (RANDOM'98), pp.159-170, 1998.
DOI : 10.1007/3-540-49543-6_13

M. A. Schumer and K. Steiglitz, Adaptive step size random search, IEEE Transactions on Automatic Control, vol.13, issue.3, pp.270-276, 1968.
DOI : 10.1109/TAC.1968.1098903
URL : http://www.cs.princeton.edu/~ken/adaptivestepsize68.pdf

D. Sudholt, Crossover is provably essential for the Ising model on trees, Proceedings of the 2005 conference on Genetic and evolutionary computation , GECCO '05, pp.1161-1167, 2005.
DOI : 10.1145/1068009.1068202

D. Sudholt, Crossover speeds up building-block assembly, Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference, GECCO '12, pp.689-702, 2012.
DOI : 10.1145/2330163.2330260

I. Wegener, Theoretical Aspects of Evolutionary Algorithms, Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01), pp.64-78, 2001.
DOI : 10.1007/3-540-48224-5_6

I. Wegener, Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions, Evolutionary Optimization, pp.349-369, 2002.
DOI : 10.1007/0-306-48041-7_14

I. Wegener, Simulated Annealing Beats Metropolis in Combinatorial Optimization, Proc. of International Colloquium on Automata, Languages and Programming (ICALP'05), pp.589-601, 2005.
DOI : 10.1007/11523468_48
URL : http://sfbci.uni-dortmund.de/Publications/Reference/Downloads/18204.pdf

C. Witt, Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions, Combinatorics, Probability and Computing, vol.13, issue.02, pp.294-318, 2013.
DOI : 10.1016/j.jda.2004.02.001

C. Witt, Fitness levels with tail bounds for the analysis of randomized search heuristics, Information Processing Letters, vol.114, issue.1-2, pp.38-41, 2014.
DOI : 10.1016/j.ipl.2013.09.013

C. Zarges, Rigorous Runtime Analysis of Inversely Fitness Proportional Mutation Rates, Proc. of Parallel Problem Solving from Nature (PPSN'08), pp.112-122, 2008.
DOI : 10.1007/978-3-540-87700-4_12

C. Zarges, On the utility of the population size for inversely fitness proportional mutation rates, Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, FOGA '09, pp.39-46, 2009.
DOI : 10.1145/1527125.1527132