Benjamin Doerr. Exponential Upper Bounds for the Runtime of Randomized Search Heuristics. In Thomas Bäck, Mike Preuss, André H. Deutz, Hao Wang 0025, Carola Doerr, Michael T. M. Emmerich, Heike Trautmann, editors, Parallel Problem Solving from Nature - PPSN XVI - 16th International Conference, PPSN 2020, Leiden, The Netherlands, September 5-9, 2020, Proceedings, Part II. Volume 12270 of Lecture Notes in Computer Science, pages 619-633, Springer, 2020. [doi]
@inproceedings{Doerr20a-0,
title = {Exponential Upper Bounds for the Runtime of Randomized Search Heuristics},
author = {Benjamin Doerr},
year = {2020},
doi = {10.1007/978-3-030-58115-2_43},
url = {https://doi.org/10.1007/978-3-030-58115-2_43},
researchr = {https://researchr.org/publication/Doerr20a-0},
cites = {0},
citedby = {0},
pages = {619-633},
booktitle = {Parallel Problem Solving from Nature - PPSN XVI - 16th International Conference, PPSN 2020, Leiden, The Netherlands, September 5-9, 2020, Proceedings, Part II},
editor = {Thomas Bäck and Mike Preuss and André H. Deutz and Hao Wang 0025 and Carola Doerr and Michael T. M. Emmerich and Heike Trautmann},
volume = {12270},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-58115-2},
}