Qian, C., Bian, C., Jiang, W., & Tang, K. (2019). Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under Bit-Wise Noise. Algorithmica, 81(2), 749-795. https://doi.org/10.1007/s00453-018-0488-4
Chicago Style (17th ed.) CitationQian, Chao, Chao Bian, Wu Jiang, and Ke Tang. "Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under Bit-Wise Noise." Algorithmica 81, no. 2 (2019): 749-795. https://doi.org/10.1007/s00453-018-0488-4.
MLA (9th ed.) CitationQian, Chao, et al. "Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under Bit-Wise Noise." Algorithmica, vol. 81, no. 2, 2019, pp. 749-795, https://doi.org/10.1007/s00453-018-0488-4.
Warning: These citations may not always be 100% accurate.