Benjamin Doerr. Exponential upper bounds for the runtime of randomized search heuristics. Theoretical Computer Science, 851:24-38, 2021. [doi]
@article{Doerr21,
title = {Exponential upper bounds for the runtime of randomized search heuristics},
author = {Benjamin Doerr},
year = {2021},
doi = {10.1016/j.tcs.2020.09.032},
url = {https://doi.org/10.1016/j.tcs.2020.09.032},
researchr = {https://researchr.org/publication/Doerr21},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {851},
pages = {24-38},
}