The following publications are possibly variants of this publication:
- Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise NoiseChao Qian, Chao Bian, Wu Jiang, Ke Tang. algorithmica, 81(2):749-795, 2019. [doi]
- Towards a Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under General Bit-Wise NoiseChao Bian, Chao Qian, Ke Tang. ppsn 2018: 165-177 [doi]
- Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noiseChao Qian, Chao Bian, Wu Jiang, Ke Tang. gecco 2017: 1399-1406 [doi]
- Running Time Analysis of the (1+1)-EA Using Surrogate Models on OneMax and LeadingOnesZi-An Zhang, Chao Bian 0002, Chao Qian 0001. ppsn 2022: 512-525 [doi]