| Geometric inhomogeneous random graphs K Bringmann, R Keusch, J Lengler Theoretical Computer Science 760, 35-54, 2019 | 94 | 2019 |
| Drift analysis J Lengler Theory of Evolutionary Computation, 89-131, 2020 | 47 | 2020 |
| A general dichotomy of evolutionary algorithms on monotone functions J Lengler IEEE Transactions on Evolutionary Computation 24 (6), 995-1009, 2019 | 45 | 2019 |
| Drift analysis and evolutionary algorithms revisited J Lengler, A Steger Combinatorics, Probability and Computing 27 (4), 643-666, 2018 | 39 | 2018 |
| Reliable neuronal systems: the importance of heterogeneity J Lengler, F Jug, A Steger PloS one 8 (12), e80694, 2013 | 39 | 2013 |
| Bootstrap percolation on geometric inhomogeneous random graphs C Koch, J Lengler arXiv preprint arXiv:1603.02057, 2016 | 38 | 2016 |
| Average distance in a general class of scale-free networks with underlying geometry K Bringmann, R Keusch, J Lengler arXiv preprint arXiv:1602.05712, 2016 | 37 | 2016 |
| Greedy routing and the algorithmic small-world phenomenon K Bringmann, R Keusch, J Lengler, Y Maus, AR Molla Proceedings of the ACM Symposium on Principles of Distributed Computing, 371-380, 2017 | 36 | 2017 |
| Sampling geometric inhomogeneous random graphs in linear time K Bringmann, R Keusch, J Lengler 25th Annual European Symposium on Algorithms (ESA 2017), 2017 | 34 | 2017 |
| Black-box complexities of combinatorial problems B Doerr, T Kötzing, J Lengler, C Winzen Theoretical Computer Science 471, 84-106, 2013 | 33 | 2013 |
| Self-adjusting mutation rates with provably optimal success rules B Doerr, C Doerr, J Lengler Algorithmica 83 (10), 3108-3147, 2021 | 32 | 2021 |
| Fixed budget performance of the (1+ 1) EA on linear functions J Lengler, N Spooner Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms …, 2015 | 25 | 2015 |
| Bounding bloat in genetic programming B Doerr, T Kötzing, JAG Lagodzinski, J Lengler Proceedings of the Genetic and Evolutionary Computation Conference, 921-928, 2017 | 24 | 2017 |
| Medium step sizes are harmful for the compact genetic algorithm J Lengler, D Sudholt, C Witt Proceedings of the Genetic and Evolutionary Computation Conference, 1499-1506, 2018 | 22 | 2018 |
| Nearly-tight analysis for 2-choice and 3-majority consensus dynamics M Ghaffari, J Lengler Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 21 | 2018 |
| OneMax in black-box models with several restrictions C Doerr, J Lengler Algorithmica 78 (2), 610-640, 2017 | 19 | 2017 |
| Asymptotically optimal amplifiers for the moran process LA Goldberg, J Lapinskas, J Lengler, F Meier, K Panagiotou, P Pfister Theoretical Computer Science 758, 73-93, 2019 | 18 | 2019 |
| Bootstrap percolation with inhibition H Einarsson, J Lengler, K Panagiotou, F Mousset, A Steger arXiv preprint arXiv:1410.3291, 2014 | 17 | 2014 |
| The Cohen-Lenstra heuristic for finite abelian groups J Lengler Verlag nicht ermittelbar, 2009 | 17 | 2009 |
| Elitist black-box models: Analyzing the impact of elitist selection on the performance of evolutionary algorithms C Doerr, J Lengler Proceedings of the 2015 Annual Conference on Genetic and Evolutionary …, 2015 | 16 | 2015 |
