Benjamin Doerr

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 239

Top Venues

Publications

Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Algorithmica 86 (1) (2024)
Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim
Runtime Analysis for Permutation-based Evolutionary Algorithms. Algorithmica 86 (1) (2024)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution. Algorithmica 86 (2) (2024)
Henry Bambury, Antoine Bultel, Benjamin Doerr
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics. Algorithmica 86 (1) (2024)
Shouda Wang, Weijie Zheng, Benjamin Doerr
Choosing the right algorithm with hints from complexity theory. Inf. Comput. 296 (2024)
Benjamin Doerr, Timo Kötzing
Lower Bounds from Fitness Levels Made Easy. Algorithmica 86 (2) (2024)
Firas Ben Jedidia, Benjamin Doerr, Martin S. Krejca
Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables. CoRR (2023)
Benjamin Doerr, Zhongdi Qu
From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. AAAI (2023)
Weijie Zheng, Benjamin Doerr
Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives. Evol. Comput. 31 (4) (2023)
Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle, Sebastian Will
Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. IJCAI (2023)
Benjamin Doerr, Andrew James Kelley
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. CoRR (2023)
Benjamin Doerr
A Gentle Introduction to Theory (for Non-Theoreticians). GECCO Companion (2023)
Alexandra Ivanova, Denis Antipov, Benjamin Doerr
Larger Offspring Populations Help the (1 + (λ, λlambda)) Genetic Algorithm to Overcome the Noise. GECCO (2023)
Alexandra Ivanova, Denis Antipov, Benjamin Doerr
Larger Offspring Populations Help the (1 + (λ, λ)) Genetic Algorithm to Overcome the Noise. CoRR (2023)
Benjamin Doerr, Martin S. Krejca
Bivariate estimation-of-distribution algorithms can find an exponential number of optima. Theor. Comput. Sci. 971 (2023)
Benjamin Doerr, Andrew James Kelley
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. GECCO (2023)
Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle, Sebastian Will
Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. CoRR (2023)
Firas Ben Jedidia, Benjamin Doerr, Martin S. Krejca
Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables. GECCO (2023)
Benjamin Doerr, Arthur Dremaux, Johannes F. Lutzeyer, Aurélien Stumpf
How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs. GECCO (2023)
Sacha Cerf, Benjamin Doerr, Benjamin Hebras, Yakob Kahane, Simon Wietheger
The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. IJCAI (2023)
Benjamin Doerr, Amirhossein Rajabi
Stagnation detection meets fast mutation. Theor. Comput. Sci. 946 (2023)
Benjamin Doerr, Anatolii Kostrygin
Randomized Rumor Spreading Revisited (Long Version). CoRR (2023)
Sacha Cerf, Benjamin Doerr, Benjamin Hebras, Yakob Kahane, Simon Wietheger
The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. CoRR (2023)
Benjamin Doerr, Zhongdi Qu
A First Runtime Analysis of the NSGA-II on a Multimodal Problem. IEEE Trans. Evol. Comput. 27 (5) (2023)
Simon Wietheger, Benjamin Doerr
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). IJCAI (2023)
Weijie Zheng, Benjamin Doerr
Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II). Artif. Intell. 325 (2023)
Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
(1+1) Genetic Programming With Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error. CoRR (2023)
Benjamin Doerr, Zhongdi Qu
Hot off the Press: From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. GECCO Companion (2023)
Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, Martin S. Krejca
Lasting Diversity and Superior Runtime Guarantees for the (μ+1) Genetic Algorithm. CoRR (2023)
Benjamin Doerr, Zhongdi Qu
Hot off the Press: A First Runtime Analysis of the NSGA-II on a Multimodal Problem. GECCO Companion (2023)
Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt
How Well Does the Metropolis Algorithm Cope With Local Optima? GECCO (2023)
Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt
How Well Does the Metropolis Algorithm Cope With Local Optima? CoRR (2023)
Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error. Artif. Intell. 319 (2023)
Benjamin Doerr, Martin S. Krejca
Bivariate Estimation-of-Distribution Algorithms Can Find an Exponential Number of Optima. CoRR (2023)
Benjamin Doerr, Arthur Dremaux, Johannes F. Lutzeyer, Aurélien Stumpf
How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs. CoRR (2023)
Benjamin Doerr, Zhongdi Qu
Runtime Analysis for the NSGA-II: Provable Speed-Ups from Crossover. AAAI (2023)
Weijie Zheng, Benjamin Doerr
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. CoRR (2023)
Benjamin Doerr, Zhongdi Qu
Hot off the Press: Runtime Analysis for the NSGA-II - Provable Speed-Ups From Crossover. GECCO Companion (2023)
Benjamin Doerr, Omar El Hadri, Adrien Pinard
The $(1+(λ, λ))$ Global SEMO Algorithm. CoRR (2022)
Weijie Zheng, Benjamin Doerr
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Three or More Objectives. CoRR (2022)
Benjamin Doerr, Zhongdi Qu
From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. CoRR (2022)
Benjamin Doerr
A gentle introduction to theory (for non-theoreticians). GECCO Companion (2022)
Weijie Zheng, Yufei Liu, Benjamin Doerr
A first mathematical runtime analysis of the non-dominated sorting genetic algorithm II (NSGA-II): (hot-off-the-press track at GECCO 2022). GECCO Companion (2022)
Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. CoRR (2022)
Josu Ceberio Uribe, Benjamin Doerr, Carsten Witt, Vicente P. Soloviev
Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182). Dagstuhl Reports 12 (5) (2022)
Benjamin Doerr
Does Comma Selection Help to Cope with Local Optima? Algorithmica 84 (6) (2022)
Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov
Fixed-Target Runtime Analysis. Algorithmica 84 (6) (2022)
Benjamin Doerr, Marc Dufay
General Univariate Estimation-of-Distribution Algorithms. PPSN (2) (2022)
Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. GECCO (2022)
Quentin Renau, Johann Dréo, Alain Peres, Yann Semet, Carola Doerr, Benjamin Doerr
Automated algorithm selection for radar network configuration. GECCO (2022)
Benjamin Doerr
A sharp discrepancy bound for jittered sampling. Math. Comput. 91 (336) (2022)
Weijie Zheng, Yufei Liu, Benjamin Doerr
A First Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II). AAAI (2022)
Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim
Towards a stronger theory for permutation-based evolutionary algorithms. GECCO (2022)
Benjamin Doerr, Omar El Hadri, Adrien Pinard
The (1 + (λ, λ)) global SEMO algorithm. GECCO (2022)
Quentin Renau, Johann Dréo, Alain Peres, Yann Semet, Carola Doerr, Benjamin Doerr
Automated Algorithm Selection for Radar Network Configuration. CoRR (2022)
Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim
Runtime Analysis for Permutation-based Evolutionary Algorithms. CoRR (2022)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Fast Mutation in Crossover-Based Algorithms. Algorithmica 84 (6) (2022)
Benjamin Doerr, Marc Dufay
General Univariate Estimation-of-Distribution Algorithms. CoRR (2022)
Benjamin Doerr, Zhongdi Qu
The First Mathematical Proof That Crossover Gives Super-Constant Performance Gains For the NSGA-II. CoRR (2022)
Benjamin Doerr, Amirhossein Rajabi
Stagnation Detection Meets Fast Mutation. EvoCOP (2022)
Denis Antipov, Benjamin Doerr
Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022). GECCO Companion (2022)
Benjamin Doerr, Amirhossein Rajabi
Stagnation Detection meets Fast Mutation. CoRR (2022)
Weijie Zheng, Benjamin Doerr
From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms. CoRR (2022)
Zhongdi Qu, Benjamin Doerr
A First Runtime Analysis of the NSGA-II on a Multimodal Problem. CoRR (2022)
Shouda Wang, Weijie Zheng, Benjamin Doerr
Choosing the right algorithm with hints from complexity theory: (hot-off-the-press track at GECCO 2022). GECCO Companion (2022)
Benjamin Doerr, Zhongdi Qu
A First Runtime Analysis of the NSGA-II on a Multimodal Problem. PPSN (2) (2022)
Benjamin Doerr, Simon Wietheger
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). CoRR (2022)
Weijie Zheng, Benjamin Doerr
Better Approximation Guarantees for the NSGA-II by Using the Current Crowding Distance. CoRR (2022)
Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim
Towards a Stronger Theory for Permutation-based Evolutionary Algorithms. CoRR (2022)
Denis Antipov, Benjamin Doerr, Vitalii Karavaev
A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions. Algorithmica 84 (6) (2022)
Weijie Zheng, Benjamin Doerr
Better approximation guarantees for the NSGA-II by using the current crowding distance. GECCO (2022)
Benjamin Doerr
A Sharp Discrepancy Bound for Jittered Sampling. CoRR (2021)
Quentin Renau, Johann Dréo, Carola Doerr, Benjamin Doerr
Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions. CoRR (2021)
Benjamin Doerr, Michael Gnewuch
On Negative Dependence Properties of Latin Hypercube Samples and Scrambled Nets. CoRR (2021)
Quentin Renau, Johann Dréo, Carola Doerr, Benjamin Doerr
Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions. EvoApplications (2021)
Denis Antipov, Benjamin Doerr
A Tight Runtime Analysis for the (μ + λ ) EA. Algorithmica 83 (4) (2021)
Benjamin Doerr, Carsten Witt, Jing Yang
Runtime Analysis for Self-adaptive Mutation Rates. Algorithmica 83 (4) (2021)
Benjamin Doerr, Martin S. Krejca
The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis. Evol. Comput. 29 (4) (2021)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution. CoRR (2021)
Benjamin Doerr
Runtime analysis of evolutionary algorithms via symmetry arguments. Inf. Process. Lett. 166 (2021)
Shouda Wang, Weijie Zheng, Benjamin Doerr
Choosing the Right Algorithm With Hints From Complexity Theory. CoRR (2021)
Benjamin Doerr, Timo Kötzing
Lower bounds from fitness levels made easy. GECCO (2021)
Benjamin Doerr, Timo Kötzing
Lower Bounds from Fitness Levels Made Easy. CoRR (2021)
Benjamin Doerr
Exponential upper bounds for the runtime of randomized search heuristics. Theor. Comput. Sci. 851 (2021)
Benjamin Doerr, Weijie Zheng
Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives: (hot-off-the-press track at GECCO 2021). GECCO Companion (2021)
Shouda Wang, Weijie Zheng, Benjamin Doerr
Choosing the Right Algorithm With Hints From Complexity Theory. IJCAI (2021)
Benjamin Doerr, Martin S. Krejca
A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes. Theor. Comput. Sci. 851 (2021)
Riade Benbaki, Ziyad Benomar, Benjamin Doerr
on jump functions: ant colony optimizers can cope well with local optima. GECCO (2021)
Benjamin Doerr, Michael Gnewuch
On negative dependence properties of Latin hypercube samples and scrambled nets. J. Complex. 67 (2021)
Benjamin Doerr, Timo Kötzing
Multiplicative Up-Drift. Algorithmica 83 (10) (2021)
Benjamin Doerr, Carola Doerr, Johannes Lengler
Self-Adjusting Mutation Rates with Provably Optimal Success Rules. Algorithmica 83 (10) (2021)
Benjamin Doerr
The Runtime of the Compact Genetic Algorithm on Jump Functions. Algorithmica 83 (10) (2021)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. GECCO (2021)
Henry Bambury, Antoine Bultel, Benjamin Doerr
An Extended Jump Function Benchmark for the Analysis of Randomized Search Heuristics. CoRR (2021)
Benjamin Doerr, Weijie Zheng
Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives. AAAI (2021)
Benjamin Doerr, Sebastian Mayer
The recovery of ridge functions on the hypercube suffers from the curse of dimensionality. J. Complex. 63 (2021)
Denis Antipov, Benjamin Doerr
Precise Runtime Analysis for Plateau Functions. ACM Trans. Evol. Learn. Optim. 1 (4) (2021)
Benjamin Doerr, Frank Neumann
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization. ACM Trans. Evol. Learn. Optim. 1 (4) (2021)
Benjamin Doerr
A gentle introduction to theory (for non-theoreticians). GECCO Companion (2021)
Benjamin Doerr
Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift. Evol. Comput. 29 (2) (2021)

Benjamin Doerr.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Benjamin Doerr