Benjamin Doerr
Benjamin Doerr
Professor at Ecole Polytechnique, France; senior researcher at Max Planck Institute for Informatics
Verified email at - Homepage
Cited by
Cited by
Why rumors spread so quickly in social networks
B Doerr, M Fouz, T Friedrich
Communications of the ACM 55 (6), 70-75, 2012
Theory of randomized search heuristics: Foundations and recent developments
A Auger, B Doerr
World Scientific, 2011
Multiplicative drift analysis
B Doerr, D Johannsen, C Winzen
Algorithmica 64 (4), 673-697, 2012
Social networks spread rumors in sublogarithmic time
B Doerr, M Fouz, T Friedrich
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
Crossover can provably be useful in evolutionary computation
B Doerr, E Happ, C Klein
Theoretical Computer Science 425, 17-33, 2012
From black-box complexity to designing new genetic algorithms
B Doerr, C Doerr, F Ebel
Theoretical Computer Science 567, 87-104, 2015
Optimal fixed and adaptive mutation rates for the LeadingOnes problem
S Böttcher, B Doerr, F Neumann
International Conference on Parallel Problem Solving from Nature, 1-10, 2010
Quasirandom rumor spreading
B Doerr, T Friedrich, T Sauerwald
arXiv preprint arXiv:1012.5351, 2010
Adaptive drift analysis
B Doerr, LA Goldberg
Algorithmica 65 (1), 224-250, 2013
Stabilizing consensus with the power of two choices
B Doerr, LA Goldberg, L Minder, T Sauerwald, C Scheideler
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
Analyzing randomized search heuristics: Tools from probability theory
B Doerr
Theory of Randomized Search Heuristics: Foundations and Recent Developments …, 2011
Fast genetic algorithms
B Doerr, HP Le, R Makhmara, TD Nguyen
Proceedings of the Genetic and Evolutionary Computation Conference, 777-784, 2017
Quasirandom rumor spreading: Expanders, push vs. pull, and robustness
B Doerr, T Friedrich, T Sauerwald
International Colloquium on Automata, Languages, and Programming, 366-377, 2009
Deterministic random walks on the two-dimensional grid
B Doerr, T Friedrich
arXiv preprint math/0703453, 2007
Optimal parameter choices via precise black-box analysis
B Doerr, C Doerr, J Yang
Theoretical Computer Science 801, 1-34, 2020
Optimal parameter choices through self-adjustment: Applying the 1/5-th rule in discrete settings
B Doerr, C Doerr
Proceedings of the 2015 Annual Conference on Genetic and Evolutionary …, 2015
Sharp bounds by probability-generating functions and variable drift
B Doerr, M Fouz, C Witt
Proceedings of the 13th annual conference on Genetic and evolutionary …, 2011
Deterministic random walks on the integers
J Cooper, B Doerr, J Spencer, G Tardos
European Journal of Combinatorics 28 (8), 2072-2090, 2007
On the runtime analysis of the 1-ANT ACO algorithm
B Doerr, F Neumann, D Sudholt, C Witt
Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007
Optimal static and self-adjusting parameter choices for the (1+(λ, λ)) genetic algorithm
B Doerr, C Doerr
Algorithmica 80, 1658-1709, 2018
The system can't perform the operation now. Try again later.
Articles 1–20