default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Doerr
Person information
- affiliation: École Polytechnique de Paris, Computer Science Laboratory (LIX), France
- affiliation: Saarland University, Department of Computer Science, Saarbrücken, Germany
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation (PhD 2000): University of Kiel, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c218]Benjamin Doerr, Martin S. Krejca, Günter Rudolph:
Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces. AAAI 2025: 26955-26963- [c217]Benjamin Doerr, Tudor Ivan, Martin S. Krejca:
Speeding Up the NSGA-II with a Simple Tie-Breaking Rule. AAAI 2025: 26964-26972 - [c216]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. AAAI 2025: 28740 - [c215]Weijie Zheng, Benjamin Doerr:
From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms (Journal Track). AAAI 2025: 28746- - [i134]Marcel Chwialkowski, Benjamin Doerr, Martin S. Krejca:
Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark. CoRR abs/2501.16250 (2025) - 2024
- [j133]Henry Bambury, Antoine Bultel, Benjamin Doerr
:
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics. Algorithmica 86(1): 1-32 (2024) - [j132]Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Algorithmica 86(1): 64-89 (2024) - [j131]Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim:
Runtime Analysis for Permutation-based Evolutionary Algorithms. Algorithmica 86(1): 90-129 (2024) - [j130]Benjamin Doerr, Timo Kötzing:
Lower Bounds from Fitness Levels Made Easy. Algorithmica 86(2): 367-395 (2024) - [j129]Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution. Algorithmica 86(2): 442-484 (2024) - [j128]Benjamin Doerr, Andrew James Kelley:
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. Algorithmica 86(8): 2479-2518 (2024) - [j127]Shouda Wang, Weijie Zheng, Benjamin Doerr:
Choosing the right algorithm with hints from complexity theory. Inf. Comput. 296: 105125 (2024) - [j126]Firas Ben Jedidia, Benjamin Doerr, Martin S. Krejca:
Estimation-of-distribution algorithms for multi-valued decision variables. Theor. Comput. Sci. 1003: 114622 (2024) - [j125]Weijie Zheng, Benjamin Doerr:
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency for Many Objectives. IEEE Trans. Evol. Comput. 28(5): 1442-1454 (2024) - [c214]Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, Martin S. Krejca:
Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations. AAAI 2024: 20683-20691 - [c213]Weijie Zheng, Benjamin Doerr:
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. AAAI 2024: 20874-20882 - [c212]Weijie Zheng, Mingfeng Li, Renzhong Deng, Benjamin Doerr:
How to Use the Metropolis Algorithm for Multi-Objective Optimization? AAAI 2024: 20883-20891 - [c211]Denis Antipov, Benjamin Doerr, Alexandra Ivanova:
Already Moderate Population Sizes Provably Yield Strong Robustness to Noise. GECCO 2024 - [c210]Sacha Cerf, Benjamin Doerr, Benjamin Hebras, Yakob Kahane, Simon Wietheger:
Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. GECCO Companion 2024: 27-28 - [c209]Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle, Sebastian Will:
Hot off the Press: Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. GECCO Companion 2024: 33-34 - [c208]Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, Martin S. Krejca:
Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations. GECCO Companion 2024: 35-36 - [c207]Simon Wietheger, Benjamin Doerr:
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). GECCO Companion 2024: 63-64 - [c206]Weijie Zheng, Benjamin Doerr:
Hot off the Press: Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives. GECCO Companion 2024: 67-68 - [c205]Weijie Zheng, Benjamin Doerr:
Hot off the Press: Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. GECCO Companion 2024: 69-70 - [c204]Weijie Zheng, Mingfeng Li, Renzhong Deng, Benjamin Doerr:
How to Use the Metropolis Algorithm for Multi-Objective Optimization? GECCO Companion 2024: 71-72 - [c203]Benjamin Doerr:
A Gentle Introduction to Theory (for Non-Theoreticians). GECCO Companion 2024: 800-829 - [c202]Benjamin Doerr, Joshua D. Knowles, Aneta Neumann, Frank Neumann:
A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. GECCO 2024 - [c201]Benjamin Doerr, Martin S. Krejca, Nguyen Vu:
Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics. GECCO 2024 - [c200]Simon Wietheger, Benjamin Doerr:
Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. PPSN (4) 2024: 153-168 - [c199]Benjamin Doerr, Martin S. Krejca, Noé Weeks:
Proven Runtime Guarantees for How the MOEA/D: Computes the Pareto Front from the Subproblem Solutions. PPSN (3) 2024: 197-212 - [c198]Renzhong Deng, Weijie Zheng, Mingfeng Li, Jie Liu, Benjamin Doerr:
Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem. PPSN (3) 2024: 264-279 - [d3]Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Code and data for "First Steps Towards a Runtime Analysis When Starting With a Good Solution". Zenodo, 2024
- [i133]Benjamin Doerr, Andrew James Kelley:
The Runtime of Random Local Search on the Generalized Needle Problem. CoRR abs/2403.08153 (2024) - [i132]Denis Antipov, Benjamin Doerr, Alexandra Ivanova:
Already Moderate Population Sizes Provably Yield Strong Robustness to Noise. CoRR abs/2404.02090 (2024) - [i131]Benjamin Doerr, Joshua D. Knowles, Aneta Neumann, Frank Neumann:
A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. CoRR abs/2404.03838 (2024) - [i130]Benjamin Doerr, Martin S. Krejca, Nguyen Vu:
Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics. CoRR abs/2404.04018 (2024) - [i129]Simon Wietheger, Benjamin Doerr:
Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. CoRR abs/2404.12746 (2024) - [i128]Benjamin Doerr, Martin S. Krejca, Noé Weeks:
Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions. CoRR abs/2405.01014 (2024) - [i127]Benjamin Doerr, Johannes F. Lutzeyer:
Hyper-Heuristics Can Profit From Global Variation Operators. CoRR abs/2407.14237 (2024) - [i126]Weijie Zheng, Benjamin Doerr:
Overcome the Difficulties of NSGA-II via Truthful Crowding Distance with Theoretical Guarantees. CoRR abs/2407.17687 (2024) - [i125]Denis Antipov, Benjamin Doerr:
Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It. CoRR abs/2409.00306 (2024) - [i124]Benjamin Doerr, Dimitri Korkotashvili, Martin S. Krejca:
Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem. CoRR abs/2411.10017 (2024) - [i123]Benjamin Doerr, Martin S. Krejca, Günter Rudolph:
Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces. CoRR abs/2412.11684 (2024) - [i122]Benjamin Doerr, Tudor Ivan, Martin S. Krejca:
Speeding Up the NSGA-II With a Simple Tie-Breaking Rule. CoRR abs/2412.11931 (2024) - 2023
- [j124]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: 103906 (2023) - [j123]Weijie Zheng, Benjamin Doerr:
Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II). Artif. Intell. 325: 104016 (2023) - [j122]Weijie Zheng, Benjamin Doerr:
Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives. Evol. Comput. 31(4): 337-373 (2023) - [j121]Weijie Zheng, Benjamin Doerr:
From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms. J. Mach. Learn. Res. 24: 292:1-292:40 (2023) - [j120]Benjamin Doerr, Amirhossein Rajabi:
Stagnation detection meets fast mutation. Theor. Comput. Sci. 946: 113670 (2023) - [j119]Benjamin Doerr, Martin S. Krejca:
Bivariate estimation-of-distribution algorithms can find an exponential number of optima. Theor. Comput. Sci. 971: 114074 (2023) - [j118]Benjamin Doerr, Zhongdi Qu:
A First Runtime Analysis of the NSGA-II on a Multimodal Problem. IEEE Trans. Evol. Comput. 27(5): 1288-1297 (2023) - [c197]Benjamin Doerr, Zhongdi Qu:
Runtime Analysis for the NSGA-II: Provable Speed-Ups from Crossover. AAAI 2023: 12399-12407 - [c196]Benjamin Doerr, Zhongdi Qu:
From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. AAAI 2023: 12408-12416 - [c195]Benjamin Doerr, Zhongdi Qu:
Hot off the Press: A First Runtime Analysis of the NSGA-II on a Multimodal Problem. GECCO Companion 2023: 15-16 - [c194]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: 17-18 - [c193]Benjamin Doerr, Zhongdi Qu:
Hot off the Press: Runtime Analysis for the NSGA-II - Provable Speed-Ups From Crossover. GECCO Companion 2023: 19-20 - [c192]Firas Ben Jedidia, Benjamin Doerr, Martin S. Krejca:
Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables. GECCO 2023: 230-238 - [c191]Alexandra Ivanova, Denis Antipov, Benjamin Doerr:
Larger Offspring Populations Help the (1 + (λ, λlambda)) Genetic Algorithm to Overcome the Noise. GECCO 2023: 919-928 - [c190]Benjamin Doerr:
A Gentle Introduction to Theory (for Non-Theoreticians). GECCO Companion 2023: 946-975 - [c189]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: 990-999 - [c188]Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt:
How Well Does the Metropolis Algorithm Cope With Local Optima? GECCO 2023: 1000-1008 - [c187]Benjamin Doerr, Andrew James Kelley:
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. GECCO 2023: 1555-1564 - [c186]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: 5522-5530 - [c185]Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle, Sebastian Will:
Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. IJCAI 2023: 5549-5557 - [c184]Simon Wietheger, Benjamin Doerr:
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). IJCAI 2023: 5657-5665 - [i121]Benjamin Doerr, Andrew James Kelley:
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. CoRR abs/2302.08021 (2023) - [i120]Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, Martin S. Krejca:
Lasting Diversity and Superior Runtime Guarantees for the (μ+1) Genetic Algorithm. CoRR abs/2302.12570 (2023) - [i119]Firas Ben Jedidia, Benjamin Doerr, Martin S. Krejca:
Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables. CoRR abs/2302.14420 (2023) - [i118]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 abs/2303.07455 (2023) - [i117]Benjamin Doerr, Anatolii Kostrygin:
Randomized Rumor Spreading Revisited (Long Version). CoRR abs/2303.11150 (2023) - [i116]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 abs/2304.10414 (2023) - [i115]Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt:
How Well Does the Metropolis Algorithm Cope With Local Optima? CoRR abs/2304.10848 (2023) - [i114]Alexandra Ivanova, Denis Antipov, Benjamin Doerr:
Larger Offspring Populations Help the (1 + (λ, λ)) Genetic Algorithm to Overcome the Noise. CoRR abs/2305.04553 (2023) - [i113]Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle, Sebastian Will:
Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. CoRR abs/2305.10259 (2023) - [i112]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 abs/2305.13459 (2023) - [i111]Benjamin Doerr, Martin S. Krejca:
Bivariate Estimation-of-Distribution Algorithms Can Find an Exponential Number of Optima. CoRR abs/2310.04042 (2023) - [i110]Weijie Zheng, Benjamin Doerr:
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. CoRR abs/2312.10290 (2023) - 2022
- [j117]Denis Antipov, Benjamin Doerr, Vitalii Karavaev:
A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions. Algorithmica 84(6): 1573-1602 (2022) - [j116]Benjamin Doerr:
Does Comma Selection Help to Cope with Local Optima? Algorithmica 84(6): 1659-1693 (2022) - [j115]Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Fast Mutation in Crossover-Based Algorithms. Algorithmica 84(6): 1724-1761 (2022) - [j114]Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov:
Fixed-Target Runtime Analysis. Algorithmica 84(6): 1762-1793 (2022) - [j113]Benjamin Doerr:
A sharp discrepancy bound for jittered sampling. Math. Comput. 91(336): 1871-1892 (2022) - [c183]Weijie Zheng, Yufei Liu, Benjamin Doerr:
A First Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II). AAAI 2022: 10408-10416 - [c182]Benjamin Doerr, Amirhossein Rajabi:
Stagnation Detection Meets Fast Mutation. EvoCOP 2022: 191-207 - [c181]Denis Antipov, Benjamin Doerr:
Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022). GECCO Companion 2022: 13-14 - [c180]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: 45-46 - [c179]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: 53-54 - [c178]Benjamin Doerr, Omar El Hadri, Adrien Pinard:
The (1 + (λ, λ)) global SEMO algorithm. GECCO 2022: 520-528 - [c177]Weijie Zheng, Benjamin Doerr:
Better approximation guarantees for the NSGA-II by using the current crowding distance. GECCO 2022: 611-619 - [c176]Benjamin Doerr:
A gentle introduction to theory (for non-theoreticians). GECCO Companion 2022: 890-921 - [c175]Quentin Renau, Johann Dréo, Alain Peres, Yann Semet, Carola Doerr, Benjamin Doerr:
Automated algorithm selection for radar network configuration. GECCO 2022: 1263-1271 - [c174]Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. GECCO 2022: 1381-1389 - [c173]Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim:
Towards a stronger theory for permutation-based evolutionary algorithms. GECCO 2022: 1390-1398 - [c172]Benjamin Doerr, Zhongdi Qu:
A First Runtime Analysis of the NSGA-II on a Multimodal Problem. PPSN (2) 2022: 399-412 - [c171]Benjamin Doerr, Marc Dufay:
General Univariate Estimation-of-Distribution Algorithms. PPSN (2) 2022: 470-484 - [i109]Benjamin Doerr, Amirhossein Rajabi:
Stagnation Detection meets Fast Mutation. CoRR abs/2201.12158 (2022) - [i108]Weijie Zheng, Benjamin Doerr:
Better Approximation Guarantees for the NSGA-II by Using the Current Crowding Distance. CoRR abs/2203.02693 (2022) - [i107]Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. CoRR abs/2204.02097 (2022) - [i106]Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim:
Towards a Stronger Theory for Permutation-based Evolutionary Algorithms. CoRR abs/2204.07637 (2022) - [i105]Zhongdi Qu, Benjamin Doerr:
A First Runtime Analysis of the NSGA-II on a Multimodal Problem. CoRR abs/2204.13750 (2022) - [i104]Quentin Renau, Johann Dréo, Alain Peres, Yann Semet, Carola Doerr, Benjamin Doerr:
Automated Algorithm Selection for Radar Network Configuration. CoRR abs/2205.03670 (2022) - [i103]Weijie Zheng, Benjamin Doerr:
From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms. CoRR abs/2206.09090 (2022) - [i102]Benjamin Doerr, Marc Dufay:
General Univariate Estimation-of-Distribution Algorithms. CoRR abs/2206.11198 (2022) - [i101]Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim:
Runtime Analysis for Permutation-based Evolutionary Algorithms. CoRR abs/2207.04045 (2022) - [i100]Benjamin Doerr, Zhongdi Qu:
The First Mathematical Proof That Crossover Gives Super-Constant Performance Gains For the NSGA-II. CoRR abs/2208.08759 (2022) - [i99]Benjamin Doerr, Zhongdi Qu:
From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. CoRR abs/2209.13974 (2022) - [i98]Benjamin Doerr, Omar El Hadri, Adrien Pinard:
The $(1+(λ, λ))$ Global SEMO Algorithm. CoRR abs/2210.03618 (2022) - [i97]Benjamin Doerr, Simon Wietheger:
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). CoRR abs/2211.08202 (2022) - [i96]Weijie Zheng, Benjamin Doerr:
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Three or More Objectives. CoRR abs/2211.13084 (2022) - [i95]Josu Ceberio Uribe, Benjamin Doerr, Carsten Witt, Vicente P. Soloviev:
Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182). Dagstuhl Reports 12(5): 17-36 (2022) - 2021
- [j112]Benjamin Doerr, Carsten Witt, Jing Yang:
Runtime Analysis for Self-adaptive Mutation Rates. Algorithmica 83(4): 1012-1053 (2021) - [j111]Denis Antipov, Benjamin Doerr:
A Tight Runtime Analysis for the (μ + λ ) EA. Algorithmica 83(4): 1054-1095 (2021) - [j110]Benjamin Doerr, Timo Kötzing:
Multiplicative Up-Drift. Algorithmica 83(10): 3017-3058 (2021) - [j109]Benjamin Doerr:
The Runtime of the Compact Genetic Algorithm on Jump Functions. Algorithmica 83(10): 3059-3107 (2021) - [j108]Benjamin Doerr, Carola Doerr, Johannes Lengler:
Self-Adjusting Mutation Rates with Provably Optimal Success Rules. Algorithmica 83(10): 3108-3147 (2021) - [j107]Benjamin Doerr:
Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift. Evol. Comput. 29(2): 305-329 (2021) - [j106]Benjamin Doerr, Martin S. Krejca:
The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis. Evol. Comput. 29(4): 543-563 (2021) - [j105]Benjamin Doerr:
Runtime analysis of evolutionary algorithms via symmetry arguments. Inf. Process. Lett. 166: 106064 (2021) - [j104]Benjamin Doerr, Sebastian Mayer:
The recovery of ridge functions on the hypercube suffers from the curse of dimensionality. J. Complex. 63: 101521 (2021) - [j103]Benjamin Doerr, Michael Gnewuch:
On negative dependence properties of Latin hypercube samples and scrambled nets. J. Complex. 67: 101589 (2021) - [j102]Benjamin Doerr:
Exponential upper bounds for the runtime of randomized search heuristics. Theor. Comput. Sci. 851: 24-38 (2021) - [j101]Benjamin Doerr, Martin S. Krejca:
A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes. Theor. Comput. Sci. 851: 121-128 (2021) - [j100]Denis Antipov, Benjamin Doerr:
Precise Runtime Analysis for Plateau Functions. ACM Trans. Evol. Learn. Optim. 1(4): 13:1-13:28 (2021) - [j99]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): 16:1-16:43 (2021) - [c170]Benjamin Doerr, Weijie Zheng:
Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives. AAAI 2021: 12293-12301 - [c169]Quentin Renau, Johann Dréo, Carola Doerr, Benjamin Doerr:
Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions. EvoApplications 2021: 17-33 - [c168]Riade Benbaki, Ziyad Benomar, Benjamin Doerr:
A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima. GECCO 2021: 4-13 - [c167]Benjamin Doerr:
Runtime analysis via symmetry arguments: (hot-off-the-press track at GECCO 2021). GECCO Companion 2021: 23-24 - [c166]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: 25-26 - [c165]Benjamin Doerr:
A gentle introduction to theory (for non-theoreticians). GECCO Companion 2021: 369-398 - [c164]Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. GECCO 2021: 1115-1123 - [c163]Henry Bambury, Antoine Bultel, Benjamin Doerr:
Generalized jump functions. GECCO 2021: 1124-1132 - [c162]Benjamin Doerr, Timo Kötzing:
Lower bounds from fitness levels made easy. GECCO 2021: 1142-1150 - [c161]Shouda Wang, Weijie Zheng, Benjamin Doerr:
Choosing the Right Algorithm With Hints From Complexity Theory. IJCAI 2021: 1697-1703 - [d2]Quentin Renau, Johann Dréo, Carola Doerr, Benjamin Doerr:
Exploratory Landscape Analysis Feature Values for the 24 Noiseless BBOB Functions. Zenodo, 2021 - [i94]Quentin Renau, Johann Dréo, Carola Doerr, Benjamin Doerr:
Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions. CoRR abs/2102.00736 (2021) - [i93]Benjamin Doerr:
A Sharp Discrepancy Bound for Jittered Sampling. CoRR abs/2103.15712 (2021) - [i92]Benjamin Doerr, Timo Kötzing:
Lower Bounds from Fitness Levels Made Easy. CoRR abs/2104.03372 (2021) - [i91]Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution. CoRR abs/2104.06714 (2021) - [i90]Benjamin Doerr, Michael Gnewuch:
On Negative Dependence Properties of Latin Hypercube Samples and Scrambled Nets. CoRR abs/2104.10799 (2021) - [i89]Henry Bambury, Antoine Bultel, Benjamin Doerr:
An Extended Jump Function Benchmark for the Analysis of Randomized Search Heuristics. CoRR abs/2105.03090 (2021) - [i88]Shouda Wang, Weijie Zheng, Benjamin Doerr:
Choosing the Right Algorithm With Hints From Complexity Theory. CoRR abs/2109.06584 (2021) - [i87]Weijie Zheng, Yufei Liu, Benjamin Doerr:
A First Mathematical Runtime Analysis of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). CoRR abs/2112.08581 (2021) - 2020
- [j98]Benjamin Doerr, Carola Doerr, Jing Yang:
Optimal parameter choices via precise black-box analysis. Theor. Comput. Sci. 801: 1-34 (2020) - [j97]Benjamin Doerr, Weijie Zheng:
Working principles of binary differential evolution. Theor. Comput. Sci. 801: 110-142 (2020) - [j96]Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler:
The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time. Theor. Comput. Sci. 816: 144-168 (2020) - [j95]Benjamin Doerr, Martin S. Krejca:
Significance-Based Estimation-of-Distribution Algorithms. IEEE Trans. Evol. Comput. 24(6): 1025-1034 (2020) - [j94]Benjamin Doerr, Weijie Zheng:
Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms. IEEE Trans. Evol. Comput. 24(6): 1140-1149 (2020) - [j93]Benjamin Doerr, Marvin Künnemann:
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. IEEE Trans. Inf. Theory 66(9): 5729-5741 (2020) - [c160]Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Optimization of Chance-Constrained Submodular Functions. AAAI 2020: 1460-1467 - [c159]Benjamin Doerr, Martin S. Krejca:
The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis. EvoCOP 2020: 51-66 - [c158]Benjamin Doerr, Weijie Zheng:
Sharp bounds for genetic drift in estimation of distribution algorithms (Hot-off-the-press track at GECCO 2020). GECCO Companion 2020: 15-16 - [c157]Benjamin Doerr, Martin S. Krejca:
The univariate marginal distribution algorithm copes well with deception and epistasis. GECCO Companion 2020: 17-18 - [c156]Benjamin Doerr:
A gentle introduction to theory (for non-theoreticians). GECCO Companion 2020: 373-403 - [c155]Benjamin Doerr, Martin S. Krejca:
Bivariate estimation-of-distribution algorithms can find an exponential number of optima. GECCO 2020: 796-804 - [c154]Benjamin Doerr, Weijie Zheng:
From understanding genetic drift to a smart-restart parameter-less compact genetic algorithm. GECCO 2020: 805-813 - [c153]Denis Antipov, Benjamin Doerr, Vitalii Karavaev:
The (1 + (λ, λ)) GA is even faster on multimodal problems. GECCO 2020: 1259-1267 - [c152]Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Fast mutation in crossover-based algorithms. GECCO 2020: 1268-1276 - [c151]Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov:
Fixed-target runtime analysis. GECCO 2020: 1295-1303 - [c150]Benjamin Doerr:
Does comma selection help to cope with local optima? GECCO 2020: 1304-1313 - [c149]Quentin Renau, Carola Doerr, Johann Dréo, Benjamin Doerr:
Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy. PPSN (2) 2020: 139-153 - [c148]Denis Antipov, Benjamin Doerr:
Runtime Analysis of a Heavy-Tailed (1+(λ , λ )) Genetic Algorithm on Jump Functions. PPSN (2) 2020: 545-559 - [c147]Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
First Steps Towards a Runtime Analysis When Starting with a Good Solution. PPSN (2) 2020: 560-573 - [c146]Benjamin Doerr:
Lower Bounds for Non-elitist Evolutionary Algorithms via Negative Multiplicative Drift. PPSN (2) 2020: 604-618 - [c145]Benjamin Doerr:
Exponential Upper Bounds for the Runtime of Randomized Search Heuristics. PPSN (2) 2020: 619-633 - [p4]Benjamin Doerr:
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. Theory of Evolutionary Computation 2020: 1-87 - [p3]Benjamin Doerr, Carola Doerr:
Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices. Theory of Evolutionary Computation 2020: 271-321 - [e2]Benjamin Doerr, Frank Neumann:
Theory of Evolutionary Computation - Recent Developments in Discrete Optimization. Natural Computing Series, Springer 2020, ISBN 978-3-030-29413-7 [contents] - [d1]Quentin Renau, Carola Doerr, Johann Dréo, Benjamin Doerr:
Experimental Data Set for the study "Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy". Zenodo, 2020 - [i86]Benjamin Doerr:
Does Comma Selection Help To Cope With Local Optima. CoRR abs/2004.01274 (2020) - [i85]Benjamin Doerr, Martin S. Krejca:
A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes. CoRR abs/2004.04978 (2020) - [i84]Benjamin Doerr:
Exponential Upper Bounds for the Runtime of Randomized Search Heuristics. CoRR abs/2004.05733 (2020) - [i83]Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Fast Mutation in Crossover-based Algorithms. CoRR abs/2004.06538 (2020) - [i82]Denis Antipov, Benjamin Doerr, Vitalii Karavaev:
The (1 + (λ, λ)) GA Is Even Faster on Multimodal Problems. CoRR abs/2004.06702 (2020) - [i81]Benjamin Doerr, Weijie Zheng:
From Understanding Genetic Drift to a Smart-Restart Parameter-less Compact Genetic Algorithm. CoRR abs/2004.07141 (2020) - [i80]Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov:
Fixed-Target Runtime Analysis. CoRR abs/2004.09613 (2020) - [i79]Benjamin Doerr:
Lower Bounds for Non-Elitist Evolutionary Algorithms Via Negative Multiplicative Drift. CoRR abs/2005.00853 (2020) - [i78]Denis Antipov, Benjamin Doerr:
Runtime Analysis of a Heavy-Tailed (1+(λ, λ)) Genetic Algorithm on Jump Functions. CoRR abs/2006.03523 (2020) - [i77]Benjamin Doerr:
Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments. CoRR abs/2006.04663 (2020) - [i76]Quentin Renau, Carola Doerr, Johann Dréo, Benjamin Doerr:
Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy. CoRR abs/2006.11135 (2020) - [i75]Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
First Steps Towards a Runtime Analysis When Starting With a Good Solution. CoRR abs/2006.12161 (2020) - [i74]Benjamin Doerr, Frank Neumann:
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization. CoRR abs/2006.16709 (2020) - [i73]Benjamin Doerr, Martin S. Krejca:
The Univariate Marginal Distribution Algorithm Copes Well With Deception and Epistasis. CoRR abs/2007.08277 (2020) - [i72]Benjamin Doerr, Weijie Zheng:
Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives. CoRR abs/2012.07231 (2020)
2010 – 2019
- 2019
- [j92]Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang:
The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. Algorithmica 81(2): 593-631 (2019) - [j91]Benjamin Doerr, Carola Doerr, Timo Kötzing:
Solving Problems with Unknown Solution Length at Almost No Extra Cost. Algorithmica 81(2): 703-748 (2019) - [j90]Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck:
Island Models Meet Rumor Spreading. Algorithmica 81(2): 886-915 (2019) - [j89]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The query complexity of a permutation-based variant of Mastermind. Discret. Appl. Math. 260: 28-50 (2019) - [j88]Benjamin Doerr:
Analyzing randomized search heuristics via stochastic domination. Theor. Comput. Sci. 773: 115-137 (2019) - [c144]Benjamin Doerr:
An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. FOGA 2019: 25-33 - [c143]Denis Antipov, Benjamin Doerr, Vitalii Karavaev:
A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones. FOGA 2019: 169-182 - [c142]Benjamin Doerr, Carola Doerr, Frank Neumann:
Fast re-optimization via structural diversity. GECCO 2019: 233-241 - [c141]Benjamin Doerr, Andrew M. Sutton:
When resampling to cope with noise, use median, not mean. GECCO 2019: 242-248 - [c140]Benjamin Doerr:
Theory for non-theoreticians: introductory tutorial. GECCO (Companion) 2019: 523-549 - [c139]Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto:
Evolving boolean functions with conjunctions and disjunctions via genetic programming. GECCO 2019: 1003-1011 - [c138]Denis Antipov, Benjamin Doerr, Quentin Yang:
The efficiency threshold for the offspring population size of the (µ, λ) EA. GECCO 2019: 1461-1469 - [c137]Benjamin Doerr, Timo Kötzing:
Multiplicative up-drift. GECCO 2019: 1470-1478 - [c136]Benjamin Doerr, Carola Doerr, Johannes Lengler:
Self-adjusting mutation rates with provably optimal success rules. GECCO 2019: 1479-1487 - [c135]Benjamin Doerr:
A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost. GECCO 2019: 1488-1496 - [c134]Vitalii Karavaev, Denis Antipov, Benjamin Doerr:
Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem. GECCO (Companion) 2019: 2036-2039 - [c133]Quentin Renau, Johann Dréo, Carola Doerr, Benjamin Doerr:
Expressiveness and robustness of landscape features. GECCO (Companion) 2019: 2048-2051 - [c132]Dmitry Vinokurov, Maxim Buzdalov, Arina Buzdalova, Benjamin Doerr, Carola Doerr:
Fixed-target runtime analysis of the (1 + 1) EA with resampling. GECCO (Companion) 2019: 2068-2071 - [i71]Benjamin Doerr, Carola Doerr, Frank Neumann:
Fast Re-Optimization via Structural Diversity. CoRR abs/1902.00304 (2019) - [i70]Benjamin Doerr, Carola Doerr, Johannes Lengler:
Self-Adjusting Mutation Rates with Provably Optimal Success Rules. CoRR abs/1902.02588 (2019) - [i69]Benjamin Doerr:
A Tight Runtime Analysis for the cGA on Jump Functions - EDAs Can Cross Fitness Valleys at No Extra Cost. CoRR abs/1903.10983 (2019) - [i68]Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto:
Evolving Boolean Functions with Conjunctions and Disjunctions via Genetic Programming. CoRR abs/1903.11936 (2019) - [i67]Benjamin Doerr, Timo Kötzing:
Multiplicative Up-Drift. CoRR abs/1904.05682 (2019) - [i66]Denis Antipov, Benjamin Doerr, Quentin Yang:
The Efficiency Threshold for the Offspring Population Size of the (μ, λ) EA. CoRR abs/1904.06981 (2019) - [i65]Benjamin Doerr:
An Exponential Lower Bound for the Runtime of the cGA on Jump Functions. CoRR abs/1904.08415 (2019) - [i64]Benjamin Doerr:
The Runtime of the Compact Genetic Algorithm on Jump Functions. CoRR abs/1908.06527 (2019) - [i63]Benjamin Doerr, Weijie Zheng:
Sharp Bounds for Genetic Drift in EDAs. CoRR abs/1910.14389 (2019) - [i62]Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Optimization of Chance-Constrained Submodular Functions. CoRR abs/1911.11451 (2019) - 2018
- [j87]Benjamin Doerr, Carola Doerr:
Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ, λ)) Genetic Algorithm. Algorithmica 80(5): 1658-1709 (2018) - [j86]Benjamin Doerr, Carola Doerr, Timo Kötzing:
Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables. Algorithmica 80(5): 1732-1768 (2018) - [c131]Benjamin Doerr:
Better Runtime Guarantees via Stochastic Domination. EvoCOP 2018: 1-17 - [c130]Benjamin Doerr:
Better runtime guarantees via stochastic domination (hot-off-the-press track at GECCO 2018). GECCO (Companion) 2018: 13-14 - [c129]Benjamin Doerr:
Theory for non-theoreticians: tutorial. GECCO (Companion) 2018: 389-414 - [c128]Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker:
On the runtime analysis of selection hyper-heuristics with adaptive learning periods. GECCO 2018: 1015-1022 - [c127]Weijie Zheng, Guangwen Yang, Benjamin Doerr:
Working principles of binary differential evolution. GECCO 2018: 1103-1110 - [c126]Denis Antipov, Benjamin Doerr, Jiefeng Fang, Tangi Hetet:
A tight runtime analysis for the (μ + λ) EA. GECCO 2018: 1459-1466 - [c125]Raphaël Dang-Nhu, Thibault Dardinier, Benjamin Doerr, Gautier Izacard, Dorian Nogneng:
A new analysis method for evolutionary optimization of dynamic and noisy objective functions. GECCO 2018: 1467-1474 - [c124]Benjamin Doerr, Carsten Witt, Jing Yang:
Runtime analysis for self-adaptive mutation rates. GECCO 2018: 1475-1482 - [c123]Benjamin Doerr, Martin S. Krejca:
Significance-based estimation-of-distribution algorithms. GECCO 2018: 1483-1490 - [c122]Denis Antipov, Benjamin Doerr:
Precise Runtime Analysis for Plateaus. PPSN (2) 2018: 117-128 - [i61]Benjamin Doerr:
Better Runtime Guarantees Via Stochastic Domination. CoRR abs/1801.04487 (2018) - [i60]Benjamin Doerr:
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. CoRR abs/1801.06733 (2018) - [i59]Benjamin Doerr, Carola Doerr:
Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices. CoRR abs/1804.05650 (2018) - [i58]Denis Antipov, Benjamin Doerr:
Precise Runtime Analysis for Plateaus. CoRR abs/1806.01331 (2018) - [i57]Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler:
Bounding Bloat in Genetic Programming. CoRR abs/1806.02112 (2018) - [i56]Benjamin Doerr, Carola Doerr, Jing Yang:
Optimal Parameter Choices via Precise Black-Box Analysis. CoRR abs/1807.03403 (2018) - [i55]Benjamin Doerr, Martin S. Krejca:
Significance-based Estimation-of-Distribution Algorithms. CoRR abs/1807.03495 (2018) - [i54]Benjamin Doerr, Carsten Witt, Jing Yang:
Runtime Analysis for Self-adaptive Mutation Rates. CoRR abs/1811.12824 (2018) - [i53]Benjamin Doerr, Weijie Zheng:
Working Principles of Binary Differential Evolution. CoRR abs/1812.03513 (2018) - [i52]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of a Permutation-Based Variant of Mastermind. CoRR abs/1812.08480 (2018) - [i51]Denis Antipov, Benjamin Doerr:
A Tight Runtime Analysis for the (μ+ λ) EA. CoRR abs/1812.11061 (2018) - 2017
- [j85]Benjamin Doerr, Frank Neumann, Andrew M. Sutton:
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica 78(2): 561-586 (2017) - [j84]Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt:
Detecting structural breaks in time series via genetic algorithms. Soft Comput. 21(16): 4707-4720 (2017) - [c121]Maxim Buzdalov, Benjamin Doerr, Mikhail Kever:
The unrestricted black-box complexity of jump functions. GECCO (Companion) 2017: 1-2 - [c120]Benjamin Doerr:
Theory for non-theoreticians. GECCO (Companion) 2017: 389-412 - [c119]Benjamin Doerr, Huu Phuoc Le, Régis Makhmara, Ta Duy Nguyen:
Fast genetic algorithms. GECCO 2017: 777-784 - [c118]Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler:
Bounding bloat in genetic programming. GECCO 2017: 921-928 - [c117]Maxim Buzdalov, Benjamin Doerr:
Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas. GECCO 2017: 1343-1350 - [c116]Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang:
The (1+λ) evolutionary algorithm with self-adjusting mutation rate. GECCO 2017: 1351-1358 - [c115]Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck:
Island models meet rumor spreading. GECCO 2017: 1359-1366 - [c114]Benjamin Doerr, Carola Doerr, Timo Kötzing:
Unknown solution length problems with no asymptotically optimal run time. GECCO 2017: 1367-1374 - [c113]Benjamin Doerr, Anatolii Kostrygin:
Randomized Rumor Spreading Revisited. ICALP 2017: 138:1-138:14 - [i50]Benjamin Doerr, Huu Phuoc Le, Régis Makhmara, Ta Duy Nguyen:
Fast Genetic Algorithms. CoRR abs/1703.03334 (2017) - [i49]Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang:
The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. CoRR abs/1704.02191 (2017) - [i48]Maxim Buzdalov, Benjamin Doerr:
Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas. CoRR abs/1704.04366 (2017) - [i47]Benjamin Doerr:
An Elementary Analysis of the Probability That a Binomial Random Variable Exceeds Its Expectation. CoRR abs/1712.00519 (2017) - 2016
- [j83]Benjamin Doerr, Carsten Witt:
Guest Editorial: Theory of Evolutionary Computation. Algorithmica 75(3): 425-427 (2016) - [j82]Benjamin Doerr, Carola Doerr:
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics. Algorithmica 75(3): 529-553 (2016) - [j81]Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran:
Simple and optimal randomized fault-tolerant rumor spreading. Distributed Comput. 29(2): 89-104 (2016) - [j80]Maxim Buzdalov, Benjamin Doerr, Mikhail Kever:
The Unrestricted Black-Box Complexity of Jump Functions. Evol. Comput. 24(4): 719-744 (2016) - [j79]Benjamin Doerr, Carola Doerr, Reto Spöhel, Henning Thomas:
Playing Mastermind With Many Colors. J. ACM 63(5): 42:1-42:23 (2016) - [c112]Benjamin Doerr, Carola Doerr:
Theory for Non-Theoreticians. GECCO (Companion) 2016: 463-482 - [c111]Benjamin Doerr, Wanru Gao, Frank Neumann:
Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax. GECCO 2016: 557-564 - [c110]Benjamin Doerr:
Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm. GECCO 2016: 1107-1114 - [c109]Benjamin Doerr, Carola Doerr, Timo Kötzing:
The Right Mutation Strength for Multi-Valued Decision Variables. GECCO 2016: 1115-1122 - [c108]Benjamin Doerr, Carola Doerr, Jing Yang:
Optimal Parameter Choices via Precise Black-Box Analysis. GECCO 2016: 1123-1130 - [c107]Benjamin Doerr, Marvin Künnemann:
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. ICALP 2016: 150:1-150:13 - [c106]Benjamin Doerr, Carola Doerr, Timo Kötzing:
Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables. PPSN 2016: 782-791 - [c105]Benjamin Doerr, Carola Doerr, Jing Yang:
k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation. PPSN 2016: 824-834 - [c104]Carola Doerr, Nicolas Bredèche, Enrique Alba, Thomas Bartz-Beielstein, Dimo Brockhoff, Benjamin Doerr, Gusz Eiben, Michael G. Epitropakis, Carlos M. Fonseca, Andreia P. Guerreiro, Evert Haasdijk, Jacqueline Heinerman, Julien Hubert, Per Kristian Lehre, Luigi Malagò, Juan Julián Merelo Guervós, Julian Francis Miller, Boris Naujoks, Pietro S. Oliveto, Stjepan Picek, Nelishia Pillay, Mike Preuss, Patricia Ryser-Welch, Giovanni Squillero, Jörg Stork, Dirk Sudholt, Alberto Paolo Tonda, L. Darrell Whitley, Martin Zaefferer:
Tutorials at PPSN 2016. PPSN 2016: 1012-1022 - [p2]Benjamin Doerr, Magnus Wahlström:
How to Generate Randomized Roundings with Dependencies and How to Derandomize Them. Algorithm Engineering 2016: 159-184 - [i46]Benjamin Doerr, Marvin Künnemann:
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. CoRR abs/1603.06113 (2016) - [i45]Benjamin Doerr:
Optimal Parameter Settings for the $(1+(λ, λ))$ Genetic Algorithm. CoRR abs/1604.01088 (2016) - [i44]Benjamin Doerr, Carola Doerr, Timo Kötzing:
The Right Mutation Strength for Multi-Valued Decision Variables. CoRR abs/1604.03277 (2016) - 2015
- [j78]Benjamin Doerr, Carola Doerr, Timo Kötzing:
Unbiased Black-Box Complexities of Jump Functions. Evol. Comput. 23(4): 641-670 (2015) - [j77]Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online Checkpointing with Improved Worst-Case Guarantees. INFORMS J. Comput. 27(3): 478-490 (2015) - [j76]Benjamin Doerr, Marvin Künnemann:
Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances. Theor. Comput. Sci. 561: 3-23 (2015) - [j75]Benjamin Doerr, Carola Doerr, Franziska Ebel:
From black-box complexity to designing new genetic algorithms. Theor. Comput. Sci. 567: 87-104 (2015) - [c103]Denis Antipov, Maxim Buzdalov, Benjamin Doerr:
Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem. EvoCOP 2015: 160-172 - [c102]Maxim Buzdalov, Mikhail Kever, Benjamin Doerr:
Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ. EvoCOP 2015: 209-221 - [c101]Axel de Perthuis de Laillevault, Benjamin Doerr, Carola Doerr:
Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization. GECCO 2015: 815-822 - [c100]Benjamin Doerr, Carola Doerr, Timo Kötzing:
Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. GECCO 2015: 831-838 - [c99]Benjamin Doerr, Carola Doerr:
Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings. GECCO 2015: 1335-1342 - [c98]Benjamin Doerr, Frank Neumann, Andrew M. Sutton:
Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. GECCO 2015: 1415-1422 - [c97]Benjamin Doerr, Carola Doerr:
A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax. GECCO 2015: 1423-1430 - [i43]Benjamin Doerr, Carola Doerr:
Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings. CoRR abs/1504.03212 (2015) - [i42]Laurent Hoeltgen, Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Simon Setzer, Daniel Johannsen, Frank Neumann, Benjamin Doerr:
Optimising Spatial and Tonal Data for PDE-based Inpainting. CoRR abs/1506.04566 (2015) - [i41]Benjamin Doerr, Carola Doerr, Timo Kötzing:
Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. CoRR abs/1506.05913 (2015) - [i40]Benjamin Doerr, Carola Doerr:
A Tight Runtime Analysis of the $(1+(λ, λ))$ Genetic Algorithm on OneMax. CoRR abs/1506.05937 (2015) - [i39]Benjamin Doerr, Nikolaus Hansen, Christian Igel, Lothar Thiele:
Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). Dagstuhl Reports 5(5): 57-91 (2015) - 2014
- [j74]Benjamin Doerr, Carola Doerr, Timo Kötzing:
The unbiased black-box complexity of partition is polynomial. Artif. Intell. 216: 275-286 (2014) - [j73]Benjamin Doerr, Carola Winzen:
Ranking-Based Black-Box Complexity. Algorithmica 68(3): 571-609 (2014) - [j72]Benjamin Doerr:
A lower bound for the discrepancy of a random point set. J. Complex. 30(1): 16-20 (2014) - [j71]Benjamin Doerr, Magnus Wahlström:
Randomized Rounding in the Presence of a Cardinality Constraint. ACM J. Exp. Algorithmics 19(1) (2014) - [j70]Benjamin Doerr, Carola Winzen:
Playing Mastermind with Constant-Size Memory. Theory Comput. Syst. 55(4): 658-684 (2014) - [j69]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading. ACM Trans. Algorithms 11(2): 9:1-9:35 (2014) - [j68]Benjamin Doerr, Carola Winzen:
Reducing the arity in unbiased black-box complexity. Theor. Comput. Sci. 545: 108-121 (2014) - [j67]Frank Neumann, Benjamin Doerr, Per Kristian Lehre, Pauline C. Haddow:
Editorial for the Special Issue on Theoretical Foundations of Evolutionary Computation. IEEE Trans. Evol. Comput. 18(5): 625-627 (2014) - [j66]Xujin Chen, Benjamin Doerr, Carola Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee:
The Price of Anarchy for Selfish Ring Routing is Two. ACM Trans. Economics and Comput. 2(2): 8:1-8:24 (2014) - [c96]Benjamin Doerr, Marvin Künnemann:
Tight Analysis of Randomized Rumor Spreading in Complete Graphs. ANALCO 2014: 82-91 - [c95]Benjamin Doerr, Carola Doerr:
Black-box complexity: from complexity theory to playing mastermind. GECCO (Companion) 2014: 623-646 - [c94]Sylvain Colin, Benjamin Doerr, Gaspard Férey:
Monotonic functions in EC: anything but monotone! GECCO 2014: 753-760 - [c93]Benjamin Doerr, Carola Doerr, Timo Kötzing:
Unbiased black-box complexities of jump functions: how to cross large plateaus. GECCO 2014: 769-776 - [c92]Benjamin Doerr, Carola Doerr:
The impact of random initialization on the runtime of randomized search heuristics. GECCO 2014: 1375-1382 - [i38]Benjamin Doerr, Carola Doerr, Timo Kötzing:
Unbiased Black-Box Complexities of Jump Functions - How to Cross Large Plateaus. CoRR abs/1403.7806 (2014) - 2013
- [j65]Benjamin Doerr, Leslie Ann Goldberg:
Adaptive Drift Analysis. Algorithmica 65(1): 224-250 (2013) - [j64]Benjamin Doerr, Anna Huber, Ariel Levavi:
Strong robustness of randomized rumor spreading protocols. Discret. Appl. Math. 161(6): 778-793 (2013) - [j63]Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges:
Mutation Rate Matters Even When Optimizing Monotonic Functions. Evol. Comput. 21(1): 1-27 (2013) - [j62]Benjamin Doerr:
Improved approximation algorithms for the Min-Max Selecting Items problem. Inf. Process. Lett. 113(19-21): 747-749 (2013) - [j61]Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile:
More effective crossover operators for the all-pairs shortest path problem. Theor. Comput. Sci. 471: 12-26 (2013) - [j60]Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen:
Black-box complexities of combinatorial problems. Theor. Comput. Sci. 471: 84-106 (2013) - [c91]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of Finding a Hidden Permutation. Space-Efficient Data Structures, Streams, and Algorithms 2013: 1-11 - [c90]Benjamin Doerr, Marvin Künnemann:
Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations. IEEE Congress on Evolutionary Computation 2013: 424-431 - [c89]Benjamin Doerr, Bojana Kodric, Marco Voigt:
Lower bounds for the runtime of a global multi-objective evolutionary algorithm. IEEE Congress on Evolutionary Computation 2013: 432-439 - [c88]Benjamin Doerr, Dirk Sudholt, Carsten Witt:
When do evolutionary algorithms optimize separable functions in parallel? FOGA 2013: 51-64 - [c87]Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt:
Evolutionary algorithms for the detection of structural breaks in time series: extended abstract. GECCO (Companion) 2013: 119-120 - [c86]Benjamin Doerr, Carola Doerr:
Black-box complexity: from complexity theory to playing mastermind. GECCO (Companion) 2013: 617-640 - [c85]Benjamin Doerr, Carola Doerr, Franziska Ebel:
Lessons from the black-box: fast crossover-based genetic algorithms. GECCO 2013: 781-788 - [c84]Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges:
A method to derive fixed budget results from expected optimisation times. GECCO 2013: 1581-1588 - [c83]Benjamin Doerr, Marvin Künnemann:
How the (1+λ) evolutionary algorithm optimizes linear functions. GECCO 2013: 1589-1596 - [c82]Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online Checkpointing with Improved Worst-Case Guarantees. ICALP (1) 2013: 255-266 - [c81]Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen:
Playing Mastermind with Many Colors. SODA 2013: 695-704 - [i37]Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online checkpointing with improved worst-case guarantees. CTW 2013: 23-26 - [i36]Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen:
Evolutionary Algorithms and Dynamic Programming. CoRR abs/1301.4096 (2013) - [i35]Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online Checkpointing with Improved Worst-Case Guarantees. CoRR abs/1302.4216 (2013) - [i34]Benjamin Doerr:
Winkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions. CoRR abs/1303.7205 (2013) - [i33]Benjamin Doerr:
Improved Approximation Algorithms for the Min-Max Selecting Items Problem. CoRR abs/1304.7403 (2013) - [i32]Benjamin Doerr, Carola Doerr:
Collecting Coupons with Random Initial Stake. CoRR abs/1308.6384 (2013) - [i31]Benjamin Doerr, Robert Elsässer, Pierre Fraigniaud:
Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042). Dagstuhl Reports 3(1): 94-110 (2013) - [i30]Benjamin Doerr, Nikolaus Hansen, Jonathan L. Shapiro, L. Darrell Whitley:
Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271). Dagstuhl Reports 3(7): 1-28 (2013) - 2012
- [j59]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Multiplicative Drift Analysis. Algorithmica 64(4): 673-697 (2012) - [j58]Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Why rumors spread so quickly in social networks. Commun. ACM 55(6): 70-75 (2012) - [j57]Benjamin Doerr, Carola Winzen:
Memory-restricted black-box complexity of OneMax. Inf. Process. Lett. 112(1-2): 32-34 (2012) - [j56]Benjamin Doerr, Edda Happ, Christian Klein:
Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. 425: 17-33 (2012) - [j55]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Non-existence of linear universal drift functions. Theor. Comput. Sci. 436: 71-86 (2012) - [c80]Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen:
Playing Mastermind with Many Colors. CTW 2012: 108-111 - [c79]Benjamin Doerr, Ashish Ranjan Hota, Timo Kötzing:
Ants easily solve stochastic shortest path problems. GECCO 2012: 17-24 - [c78]Benjamin Doerr:
Black-box complexity: from complexity theory to playing mastermind. GECCO (Companion) 2012: 1079-1092 - [c77]Benjamin Doerr, Carola Winzen:
Reducing the arity in unbiased black-box complexity. GECCO 2012: 1309-1316 - [c76]Benjamin Doerr, Sebastian Pohl:
Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet. GECCO 2012: 1317-1324 - [c75]Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Experimental Analysis of Rumor Spreading in Social Networks. MedAlg 2012: 159-173 - [c74]Benjamin Doerr, Carola Winzen:
Playing Mastermind With Constant-Size Memory. STACS 2012: 441-452 - [c73]Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Asynchronous Rumor Spreading in Preferential Attachment Graphs. SWAT 2012: 307-315 - [c72]Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen:
The Price of Anarchy for Selfish Ring Routing Is Two. WINE 2012: 420-433 - [i29]Benjamin Doerr, Carola Winzen:
Reducing the Arity in Unbiased Black-Box Complexity. CoRR abs/1203.4111 (2012) - [i28]Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile:
More Effective Crossover Operators for the All-Pairs Shortest Path Problem. CoRR abs/1207.0369 (2012) - [i27]Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen:
Playing Mastermind with Many Colors. CoRR abs/1207.0773 (2012) - [i26]Benjamin Doerr, Shay Moran, Shlomo Moran, Carola Winzen:
Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity. CoRR abs/1209.6158 (2012) - [i25]Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen:
The Price of Anarchy for Selfish Ring Routing is Two. CoRR abs/1210.0230 (2012) - [i24]Benjamin Doerr:
A Lower Bound for the Discrepancy of a Random Point Set. CoRR abs/1210.0572 (2012) - [i23]Benjamin Doerr, Carola Winzen:
Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes. CoRR abs/1210.6465 (2012) - [i22]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn:
The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j54]Benjamin Doerr, Thomas Jansen:
Theory of Evolutionary Computation. Algorithmica 59(3): 299-300 (2011) - [j53]Benjamin Doerr, Edda Happ, Christian Klein:
Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem. Evol. Comput. 19(4): 673-691 (2011) - [j52]Benjamin Doerr, Mahmoud Fouz:
Asymptotically Optimal Randomized Rumor Spreading. Electron. Notes Discret. Math. 38: 297-302 (2011) - [j51]Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Social Networks Spread Rumors in Sublogarithmic Time. Electron. Notes Discret. Math. 38: 303-308 (2011) - [j50]Benjamin Doerr, Mahmoud Fouz:
Quasi-random rumor spreading: Reducing randomness can be costly. Inf. Process. Lett. 111(5): 227-230 (2011) - [j49]Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom rumor spreading: An experimental analysis. ACM J. Exp. Algorithmics 16 (2011) - [j48]Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt:
Runtime analysis of the 1-ANT ant colony optimizer. Theor. Comput. Sci. 412(17): 1629-1644 (2011) - [j47]Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen:
Evolutionary algorithms and dynamic programming. Theor. Comput. Sci. 412(43): 6020-6035 (2011) - [c71]Benjamin Doerr, Carola Winzen:
Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes. Artificial Evolution 2011: 205-216 - [c70]Benjamin Doerr, Marvin Künnemann, Magnus Wahlström:
Dependent Randomized Rounding: The Bipartite Case. ALENEX 2011: 96-106 - [c69]Tetsuo Asano, Benjamin Doerr:
Memory-Constrained Algorithms for Shortest Path Problem. CCCG 2011 - [c68]Benjamin Doerr, Carola Winzen:
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. CSR 2011: 15-28 - [c67]Benjamin Doerr, Daniel Johannsen, Martin Schmidt:
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. FOGA 2011: 119-126 - [c66]Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen:
Faster black-box algorithms through higher arity operators. FOGA 2011: 163-172 - [c65]Benjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen:
Black-box complexities of combinatorial problems. GECCO 2011: 981-988 - [c64]Benjamin Doerr:
Drift analysis. GECCO (Companion) 2011: 1311-1320 - [c63]Benjamin Doerr, Timo Kötzing, Carola Winzen:
Too fast unbiased black-box algorithms. GECCO 2011: 2043-2050 - [c62]Benjamin Doerr, Mahmoud Fouz, Carsten Witt:
Sharp bounds by probability-generating functions and variable drift. GECCO 2011: 2083-2090 - [c61]Benjamin Doerr, Mahmoud Fouz:
Asymptotically Optimal Randomized Rumor Spreading. ICALP (2) 2011: 502-513 - [c60]Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, Benjamin Doerr:
Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. SSVM 2011: 26-37 - [c59]Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Stabilizing consensus with the power of two choices. SPAA 2011: 149-158 - [c58]Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Social networks spread rumors in sublogarithmic time. STOC 2011: 21-30 - [p1]Benjamin Doerr:
Analyzing Randomized Search Heuristics: Tools from Probability Theory. Theory of Randomized Search Heuristics 2011: 1-20 - [e1]Anne Auger, Benjamin Doerr:
Theory of Randomized Search Heuristics: Foundations and Recent Developments. Series on Theoretical Computer Science 1, World Scientific 2011, ISBN 978-981-4282-66-6 [contents] - [i21]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Multiplicative Drift Analysis. CoRR abs/1101.0776 (2011) - [i20]Benjamin Doerr, Carola Winzen:
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. CoRR abs/1102.1140 (2011) - [i19]Benjamin Doerr, Leslie Ann Goldberg:
Adaptive Drift Analysis. CoRR abs/1108.0295 (2011) - [i18]Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen:
Black-Box Complexities of Combinatorial Problems. CoRR abs/1108.0342 (2011) - [i17]Benjamin Doerr, Carola Winzen:
Playing Mastermind With Constant-Size Memory. CoRR abs/1110.3619 (2011) - [i16]Benjamin Doerr, Carola Winzen:
Memory-Restricted Black-Box Complexity. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j46]Benjamin Doerr, Frank Neumann, Ingo Wegener:
Editorial. Algorithmica 57(1): 119-120 (2010) - [j45]Benjamin Doerr, Frank Neumann:
In Memoriam: Ingo Wegener. Algorithmica 58(3): 541-542 (2010) - [j44]Benjamin Doerr, Michael Gnewuch, Magnus Wahlström:
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. J. Complex. 26(5): 490-507 (2010) - [j43]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic random walks on regular trees. Random Struct. Algorithms 37(3): 353-366 (2010) - [j42]Benjamin Doerr, Mahmoud Fouz:
Hereditary Discrepancies in Different Numbers of Colors II. SIAM J. Discret. Math. 24(3): 1205-1213 (2010) - [c57]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Drift analysis and linear functions revisited. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c56]Benjamin Doerr, Daniel Johannsen:
Edge-based representation beats vertex-based representation in shortest path problems. GECCO 2010: 759-766 - [c55]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Multiplicative drift analysis. GECCO 2010: 1449-1456 - [c54]Benjamin Doerr, Mahmoud Fouz, Carsten Witt:
Quasirandom evolutionary algorithms. GECCO 2010: 1457-1464 - [c53]Süntje Böttcher, Benjamin Doerr, Frank Neumann:
Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. PPSN (1) 2010: 1-10 - [c52]Benjamin Doerr, Leslie Ann Goldberg:
Adaptive Drift Analysis. PPSN (1) 2010: 32-41 - [c51]Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges:
Optimizing Monotone Functions Can Be Difficult. PPSN (1) 2010: 42-51 - [c50]Benjamin Doerr, Leslie Ann Goldberg:
Drift Analysis with Tail Bounds. PPSN (1) 2010: 174-183 - [c49]Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile:
More Effective Crossover Operators for the All-Pairs Shortest Path Problem. PPSN (1) 2010: 184-193 - [c48]Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Brief Announcement: Stabilizing Consensus with the Power of Two Choices. DISC 2010: 528-530 - [c47]Benjamin Doerr, Marvin Künnemann, Magnus Wahlström:
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. SEA 2010: 190-201 - [i15]Benjamin Doerr, Anna Huber, Ariel Levavi:
Strong Robustness of Randomized Rumor Spreading Protocols. CoRR abs/1001.3056 (2010) - [i14]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic Random Walks on Regular Trees. CoRR abs/1006.1441 (2010) - [i13]Benjamin Doerr, Marvin Künnemann, Magnus Wahlström:
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. CoRR abs/1007.0372 (2010) - [i12]Benjamin Doerr, Mahmoud Fouz:
Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly. CoRR abs/1008.0501 (2010) - [i11]Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges:
Optimizing Monotone Functions Can Be Difficult. CoRR abs/1010.1429 (2010) - [i10]Benjamin Doerr, Mahmoud Fouz:
Asymptotically Optimal Randomized Rumor Spreading. CoRR abs/1011.1868 (2010) - [i9]Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Non-Existence of Linear Universal Drift Functions. CoRR abs/1011.3466 (2010) - [i8]Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen:
Faster Black-Box Algorithms Through Higher Arity Operators. CoRR abs/1012.0952 (2010) - [i7]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading. CoRR abs/1012.5351 (2010) - [i6]Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom Rumor Spreading: An Experimental Analysis. CoRR abs/1012.5357 (2010)
2000 – 2009
- 2009
- [j41]Spyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou:
Tight Bounds for Quasirandom Rumor Spreading. Electron. J. Comb. 16(1) (2009) - [j40]Benjamin Doerr, Tobias Friedrich:
Deterministic Random Walks on the Two-Dimensional Grid. Comb. Probab. Comput. 18(1-2): 123-144 (2009) - [j39]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading on Expanders. Electron. Notes Discret. Math. 34: 243-247 (2009) - [j38]Benjamin Doerr, Mahmoud Fouz:
A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading. Electron. Notes Discret. Math. 34: 335-339 (2009) - [c46]Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom Rumor Spreading: An Experimental Analysis. ALENEX 2009: 145-153 - [c45]Benjamin Doerr, Magnus Wahlström:
Randomized Rounding in the Presence of a Cardinality Constraint. ALENEX 2009: 162-174 - [c44]Benjamin Doerr:
Introducing Quasirandomness to Computer Science. Efficient Algorithms 2009: 99-111 - [c43]Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann:
Computing single source shortest paths using single-objective fitness. FOGA 2009: 59-66 - [c42]Benjamin Doerr, Madeleine Theile:
Improved analysis methods for crossover-based algorithms. GECCO 2009: 247-254 - [c41]Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile:
Evolutionary algorithms and dynamic programming. GECCO 2009: 771-778 - [c40]Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, Magnus Wahlström:
BBOB: Nelder-Mead with resize and halfruns. GECCO (Companion) 2009: 2239-2246 - [c39]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. ICALP (1) 2009: 366-377 - [c38]Benjamin Doerr, Anna Huber, Ariel Levavi:
Strong Robustness of Randomized Rumor Spreading Protocols. ISAAC 2009: 812-821 - [i5]Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Stabilizing Consensus with the Power of Two Choices. Algorithmic Methods for Distributed Cooperative Systems 2009 - 2008
- [j37]Benjamin Doerr, Michael Gnewuch, Peter Kritzer, Friedrich Pillichshammer:
Component-by-component construction of low-discrepancy point sets of small size. Monte Carlo Methods Appl. 14(2): 129-149 (2008) - [c37]Benjamin Doerr, Edda Happ:
Directed trees: A powerful representation for sorting and ordering problems. IEEE Congress on Evolutionary Computation 2008: 3606-3613 - [c36]Benjamin Doerr, Edda Happ, Christian Klein:
Crossover can provably be useful in evolutionary computation. GECCO 2008: 539-546 - [c35]Benjamin Doerr, Thomas Jansen, Christian Klein:
Comparing global and local mutations on bit strings. GECCO 2008: 929-936 - [c34]Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang:
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. PPSN 2008: 378-388 - [c33]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic random walks on regular trees. SODA 2008: 766-772 - [c32]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom rumor spreading. SODA 2008: 773-781 - 2007
- [j36]Benjamin Doerr, Nils Hebbinghaus, Frank Neumann:
Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. Evol. Comput. 15(4): 401-410 (2007) - [j35]Benjamin Doerr:
Matrix approximation and Tusnády's problem. Eur. J. Comb. 28(3): 990-995 (2007) - [j34]Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer, Gábor Tardos:
Deterministic random walks on the integers. Eur. J. Comb. 28(8): 2072-2090 (2007) - [j33]Tobias Friedrich, Benjamin Doerr, Christian Klein, Ralf Osbild:
Unbiased Matrix Rounding. Electron. Notes Discret. Math. 28: 41-46 (2007) - [j32]Benjamin Doerr, Johannes Lengler, David Steurer:
The Interval Liar Game. Electron. Notes Discret. Math. 28: 425-432 (2007) - [j31]Benjamin Doerr:
Partial Colorings of Unimodular Hypergraphs. Electron. Notes Discret. Math. 29: 359-363 (2007) - [j30]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic Random Walks on Regular Trees. Electron. Notes Discret. Math. 29: 509-513 (2007) - [j29]Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav:
On the minimum load coloring problem. J. Discrete Algorithms 5(3): 533-545 (2007) - [j28]Benjamin Doerr:
Roundings Respecting Hard Constraints. Theory Comput. Syst. 40(4): 467-483 (2007) - [c31]Benjamin Doerr, Daniel Johannsen:
Refined runtime analysis of a basic ant colony optimization algorithm. IEEE Congress on Evolutionary Computation 2007: 501-507 - [c30]Benjamin Doerr, Edda Happ, Christian Klein:
A tight analysis of the (1 + 1)-EA for the single source shortest path problem. IEEE Congress on Evolutionary Computation 2007: 1890-1895 - [c29]Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann:
A rigorous view on neutrality. IEEE Congress on Evolutionary Computation 2007: 2591-2597 - [c28]Benjamin Doerr, Christian Klein, Tobias Storch:
Faster Evolutionary Algorithms by Superior Graph Representation. FOCI 2007: 245-250 - [c27]Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt:
On the runtime analysis of the 1-ANT ACO algorithm. GECCO 2007: 33-40 - [c26]Benjamin Doerr, Daniel Johannsen:
Adjacency list matchings: an ideal genotype for cycle covers. GECCO 2007: 1203-1210 - [c25]Benjamin Doerr:
Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. STACS 2007: 441-452 - 2006
- [j27]Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus:
Discrepancy of Symmetric Products of Hypergraphs. Electron. J. Comb. 13(1) (2006) - [j26]Benjamin Doerr:
Non-independent randomized rounding and coloring. Discret. Appl. Math. 154(4): 650-659 (2006) - [j25]Benjamin Doerr, Christian Klein:
Controlled Randomized Rounding. Electron. Notes Discret. Math. 25: 39-40 (2006) - [j24]Benjamin Doerr, Tobias Friedrich:
Quasirandomness in Graphs. Electron. Notes Discret. Math. 25: 61-64 (2006) - [j23]Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr:
Inserting Points Uniformly at Every Instance. IEICE Trans. Inf. Syst. 89-D(8): 2348-2356 (2006) - [j22]Benjamin Doerr, Ulf Lorenz:
Error Propagation in Game Trees. Math. Methods Oper. Res. 64(1): 79-93 (2006) - [j21]Benjamin Doerr:
Matrix rounding with respect to small submatrices. Random Struct. Algorithms 28(1): 107-112 (2006) - [j20]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved bounds and schemes for the declustering problem. Theor. Comput. Sci. 359(1-3): 123-132 (2006) - [c24]Joshua N. Cooper, Benjamin Doerr, Joel Spencer, Gábor Tardos:
Deterministic Random Walks. ANALCO 2006: 185-197 - [c23]Benjamin Doerr, Christian Klein:
Unbiased Rounding of Rational Matrices. FSTTCS 2006: 200-211 - [c22]Benjamin Doerr, Johannes Lengler, David Steurer:
The Interval Liar Game. ISAAC 2006: 318-327 - [c21]Benjamin Doerr, Tobias Friedrich:
Deterministic Random Walks on the Two-Dimensional Grid. ISAAC 2006: 474-483 - [c20]Benjamin Doerr, Nils Hebbinghaus, Frank Neumann:
Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. PPSN 2006: 978-987 - [c19]Benjamin Doerr:
Generating Randomized Roundings with Cardinality Constraints and Derandomizations. STACS 2006: 571-583 - [c18]Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
Unbiased Matrix Rounding. SWAT 2006: 102-112 - [i4]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved Bounds and Schemes for the Declustering Problem. CoRR abs/cs/0603012 (2006) - [i3]Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
Unbiased Matrix Rounding. CoRR abs/cs/0604068 (2006) - [i2]Benjamin Doerr, Mahmoud Fouz:
Hereditary Discrepancies in Different Numbers of Colors II. CoRR abs/cs/0611126 (2006) - [i1]Nils Hebbinghaus, Benjamin Doerr, Frank Neumann:
Speeding up Evolutionary Algorithms by Restricted Mutation Operators. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j19]Benjamin Doerr, Michael Gnewuch, Anand Srivastav:
Bounds and constructions for the star-discrepancy via ?-covers. J. Complex. 21(5): 691-709 (2005) - [c17]Benjamin Doerr:
Matrix rounding with low error in small submatrices. SODA 2005: 1067-1068 - [c16]Benjamin Doerr:
Roundings Respecting Hard Constraints. STACS 2005: 617-628 - [c15]Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav:
On the Minimum Load Coloring Problem. WAOA 2005: 15-26 - [c14]Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
Rounding of Sequences and Matrices, with Applications. WAOA 2005: 96-109 - 2004
- [j18]Benjamin Doerr:
Linear Discrepancy of Totally Unimodular Matrices. Comb. 24(1): 117-125 (2004) - [j17]Benjamin Doerr, Anand Srivastav, Petra Wehr:
Discrepancy of Cartesian Products of Arithmetic Progressions. Electron. J. Comb. 11(1) (2004) - [j16]Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav:
Coloring Graphs with Minimal Edge Load. Electron. Notes Discret. Math. 17: 9-13 (2004) - [j15]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
An Improved Discrepancy Approach to Declustering. Electron. Notes Discret. Math. 17: 129-133 (2004) - [j14]Benjamin Doerr:
Global roundings of sequences. Inf. Process. Lett. 92(3): 113-116 (2004) - [j13]Benjamin Doerr:
Nonindependent Randomized Rounding and an Application to Digital Halftoning. SIAM J. Comput. 34(2): 299-317 (2004) - [j12]Benjamin Doerr:
Typical rounding problems. Theor. Comput. Sci. 312(2-3): 463-477 (2004) - [j11]Benjamin Doerr:
European tenure games. Theor. Comput. Sci. 313(3): 339-351 (2004) - [c13]Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav:
Coloring Graphs with Minimal Edge Load. CTW 2004: 16-20 - [c12]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
An Improved Discrepancy Approach to Declustering. CTW 2004: 114-118 - [c11]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved Bounds and Schemes for the Declustering Problem. MFCS 2004: 760-771 - [c10]Benjamin Doerr:
Matrix rounding and approximation. SODA 2004: 575-576 - 2003
- [j10]Benjamin Doerr, Anand Srivastav:
Multicolour Discrepancies. Comb. Probab. Comput. 12(4): 365-399 (2003) - [c9]Benjamin Doerr:
Non-independent randomized rounding. SODA 2003: 506-507 - 2002
- [j9]Benjamin Doerr:
Discrepancy in different numbers of colors. Discret. Math. 250(1-3): 63-70 (2002) - [j8]Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen:
On the discrepancy of combinatorial rectangles. Random Struct. Algorithms 21(3-4): 205-215 (2002) - [c8]Benjamin Doerr:
Typical Rounding Problems. APPROX 2002: 81-93 - [c7]Benjamin Doerr, Henning Schnieder:
Non-independent Randomized Rounding and an Application to Digital Halftoning. ESA 2002: 399-410 - [c6]Benjamin Doerr:
Antirandomizing the Wrong Game. ICALP 2002: 876-887 - [c5]Benjamin Doerr:
Balanced Coloring: Equally Easy for All Numbers of Colors? STACS 2002: 112-120 - 2001
- [j7]Geir Agnarsson, Benjamin Doerr, Tomasz Schoen:
Coloring t-dimensional m-Boxes. Discret. Math. 226(1-3): 21-33 (2001) - [j6]Benjamin Doerr, Anand Srivastav:
Multi-Color Discrepancies - Extended Abstract -. Electron. Notes Discret. Math. 7: 78-81 (2001) - [j5]Benjamin Doerr, Anand Srivastav:
Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. Electron. Notes Discret. Math. 8: 27-30 (2001) - [j4]Benjamin Doerr:
Vector Balancing Games with Aging. Electron. Notes Discret. Math. 10: 90-92 (2001) - [j3]Benjamin Doerr:
Vector Balancing Games with Aging. J. Comb. Theory A 95(2): 219-233 (2001) - [c4]Benjamin Doerr:
Structured Randomized Rounding and Coloring. FCT 2001: 461-471 - [c3]Benjamin Doerr:
Lattice approximation and linear discrepency of totally unimodular matrices. SODA 2001: 119-125 - [c2]Benjamin Doerr, Anand Srivastav:
Recursive Randomized Coloring Beats Fair Dice Random Colorings. STACS 2001: 183-194 - 2000
- [j2]Benjamin Doerr:
Linear Discrepancy of Basic Totally Unimodular Matrices. Electron. J. Comb. 7 (2000) - [j1]Benjamin Doerr:
Linear And Hereditary Discrepancy. Comb. Probab. Comput. 9(4): 349-354 (2000)
1990 – 1999
- 1999
- [c1]Benjamin Doerr, Anand Srivastav:
Approximation of Multi-color Discrepancy. RANDOM-APPROX 1999: 39-50
Coauthor Index
Carola Doerr
aka: Carola Winzen
aka: Carola Winzen
[j114] [c175] [i104] [j108] [c169] [d2] [i94] [j98] [c160] [c151] [c149] [p3] [d1] [i80] [i76] [j91] [j89] [c142] [c136] [c133] [c132] [i71] [i70] [i62] [j87] [j86] [i59] [i56] [i52] [c114] [j82] [j81] [j79] [c112] [c109] [c108] [c106] [c105] [c104] [i44] [j78] [j75] [c101] [c100] [c99] [c97] [i43] [i41] [i40] [j74] [j73] [j70] [j68] [j66] [c95] [c93] [c92] [i38] [j63] [j60] [c91] [c86] [c85] [c81] [i32] [j59] [j57] [j55] [c80] [c77] [c74] [c72] [i29] [i27] [i26] [i25] [i23] [i22] [c71] [c68] [c66] [c65] [c63] [i21] [i20] [i18] [i17] [i16] [c57] [c55] [c51] [i11] [i9] [i8]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-21 00:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
