| Why rumors spread so quickly in social networks B Doerr, M Fouz, T Friedrich Communications of the ACM 55 (6), 70-75, 2012 | 388 | 2012 |
| Theory of randomized search heuristics: Foundations and recent developments A Auger, B Doerr World Scientific, 2011 | 338 | 2011 |
| Multiplicative drift analysis B Doerr, D Johannsen, C Winzen Algorithmica 64 (4), 673-697, 2012 | 221 | 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 | 148 | 2011 |
| Crossover can provably be useful in evolutionary computation B Doerr, E Happ, C Klein Theoretical Computer Science 425, 17-33, 2012 | 131 | 2012 |
| 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 | 126 | 2010 |
| From black-box complexity to designing new genetic algorithms B Doerr, C Doerr, F Ebel Theoretical Computer Science 567, 87-104, 2015 | 125 | 2015 |
| Fast genetic algorithms B Doerr, HP Le, R Makhmara, TD Nguyen Proceedings of the Genetic and Evolutionary Computation Conference, 777-784, 2017 | 100 | 2017 |
| Quasirandom rumor spreading B Doerr, T Friedrich, T Sauerwald arXiv preprint arXiv:1012.5351, 2010 | 98 | 2010 |
| Adaptive drift analysis B Doerr, LA Goldberg Algorithmica 65 (1), 224-250, 2013 | 97 | 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 | 95 | 2011 |
| Analyzing randomized search heuristics: Tools from probability theory B Doerr Theory of Randomized Search Heuristics: Foundations and Recent Developments …, 2011 | 90 | 2011 |
| 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 | 81 | 2009 |
| Optimal parameter choices via precise black-box analysis B Doerr, C Doerr, J Yang Theoretical Computer Science 801, 1-34, 2020 | 77 | 2020 |
| Probabilistic tools for the analysis of randomized optimization heuristics B Doerr Theory of Evolutionary Computation, 1-87, 2020 | 72 | 2020 |
| Optimal Static and Self-Adjusting Parameter Choices for the ( 1 + ( λ , λ ) ) Genetic … B Doerr, C Doerr Algorithmica 80 (5), 1658-1709, 2018 | 72 | 2018 |
| Deterministic random walks on the two-dimensional grid B Doerr, T Friedrich Combinatorics, Probability and Computing 18 (1-2), 123-144, 2009 | 70 | 2009 |
| 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 | 64 | 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 | 62 | 2011 |
| Mutation rate matters even when optimizing monotonic functions B Doerr, T Jansen, D Sudholt, C Winzen, C Zarges Evolutionary computation 21 (1), 1-27, 2013 | 58 | 2013 |
Carola DoerrCNRS researcher at Sorbonne Université, Paris, FranceVerified email at mpi-inf.mpg.de
