D. V. Arnold, Optimal Weighted Recombination, Foundations of Genetic Algorithms (FOGA 2005), pp.215-237, 2005.
DOI : 10.1007/11513575_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.610

D. V. Arnold, Weighted multirecombination evolution strategies. Theoretical computer science, pp.18-37, 2006.
DOI : 10.1016/j.tcs.2006.04.003
URL : http://doi.org/10.1016/j.tcs.2006.04.003

A. Auger, D. Brockhoff, and N. Hansen, Analyzing the impact of mirrored sampling and sequential selection in elitist evolution strategies, Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms, FOGA '11, 2011.
DOI : 10.1145/1967654.1967666
URL : https://hal.archives-ouvertes.fr/inria-00587507

A. Auger and N. Hansen, Reconsidering the progress rate theory for evolution strategies in finite dimensions, Proceedings of the 8th annual conference on Genetic and evolutionary computation , GECCO '06, pp.445-452, 2006.
DOI : 10.1145/1143997.1144081

H. Beyer, The Theory of Evolution Strategies. Natural Computing Series, 2001.

D. Brockhoff, A. Auger, N. Hansen, D. V. Arnold, and T. Hohm, Mirrored Sampling and Sequential Selection for Evolution Strategies, Parallel Problem Solving from Nature (PPSN XI), pp.11-21, 2010.
DOI : 10.1007/978-3-642-15844-5_2
URL : https://hal.archives-ouvertes.fr/inria-00530202

N. Hansen and A. Ostermeier, Completely Derandomized Self-Adaptation in Evolution Strategies, Evolutionary Computation, vol.9, issue.2, pp.159-195, 2001.
DOI : 10.1016/0004-3702(95)00124-7

M. Jebalia and A. Auger, Log-linear convergence of the scale-invariant (µ/µw, ?)-ES and optimal µ for intermediate recombination for large population sizes, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00494478

A. Ostermeier, A. Gawelczyk, and N. Hansen, Step-size adaption based on non-local use of selection information, Conference on Problem Solving From Nature (PPSN III), pp.189-198, 1994.

G. Rudolph, Convergence Properties of Evolutionary algorithms, Verlag Dr. Kovac, 1997.

H. Schwefel, Evolution and Optimum Seeking. Sixth-Generation Computer Technology Series, 1995.

O. Teytaud, S. Gelly, and J. Mary, On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of Isotropy, Conference on Parallel Problem Solving from Nature (PPSN IX), pp.32-41, 2006.
DOI : 10.1007/11844297_4
URL : https://hal.archives-ouvertes.fr/inria-00112816