Benjamin Doerr

522 papers A* 35A 94B 22C 4Misc 1Journal 280Unranked 80

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Difficulties of the NSGA-II With the Many-Objective LeadingOnes Problem. IEEE Trans. Evol. Comput. Benjamin Doerr, Dimitri Korkotashvili, Martin S. Krejca
2026	A*	`conf`	Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer. AAAI Benjamin Doerr, Martin S. Krejca, Milan Stankovic
2026	J	`jnl`	Position: Don't be Afraid of Over-Smoothing And Over-Squashing. CoRR Niklas Kormann, Benjamin Doerr, Johannes F. Lutzeyer
2026	J	`jnl`	Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark. IEEE Trans. Evol. Comput. Marcel Chwialkowski, Benjamin Doerr, Martin S. Krejca
2026	A*	`conf`	Superior Runtime Guarantees for the MOEA/D Multi-Objective Optimizer via Weighted-Sum Decomposition. AAAI Danyang Zhang, Zerong Zhong, Weijie Zheng, Benjamin Doerr
2025	A*	`conf`	(1+1) Genetic Programming with Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error. AAAI Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
2025	J	`jnl`	Approximation Guarantees for the Nondominated Sorting Genetic Algorithm II (NSGA-II). IEEE Trans. Evol. Comput. Weijie Zheng, Benjamin Doerr
2025	J	`jnl`	Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 25092). Dagstuhl Reports Josu Ceberio Uribe, Benjamin Doerr, John A. W. McCall, Carsten Witt, Marcus Schmidbauer
2025	A*	`conf`	Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It. IJCAI Denis Antipov, Benjamin Doerr
2025	J	`jnl`	First Steps Toward a Runtime Analysis When Starting With a Good Solution. ACM Trans. Evol. Learn. Optim. Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2025	A*	`conf`	From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms (Journal Track). AAAI Weijie Zheng, Benjamin Doerr
2025	J	`jnl`	HIEGNet: A Heterogenous Graph Neural Network Including the Immune Environment in Glomeruli Classification. CoRR Niklas Kormann, Masoud Ramuz, Zeeshan Nisar, Nadine S. Schaadt, Hendrik Annuth, Benjamin Doerr, Friedrich Feuerhake, Thomas Andrew Lampert, Johannes F. Lutzeyer
2025	—	`conf`	Hot off the Press: First Steps Towards a Runtime Analysis When Starting With a Good Solution. GECCO Companion Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2025	—	`conf`	Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. GECCO Companion Simon Wietheger, Benjamin Doerr
2025	—	`conf`	Hot off the Press: Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions. GECCO Companion Benjamin Doerr, Martin S. Krejca, Noé Weeks
2025	—	`conf`	Hot off the Press: Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces. GECCO Companion Benjamin Doerr, Martin S. Krejca, Günter Rudolph
2025	—	`conf`	Hot off the Press: Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem. GECCO Companion Renzhong Deng, Weijie Zheng, Mingfeng Li, Jie Liu, Benjamin Doerr
2025	—	`conf`	Hot off the Press: Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark. GECCO Companion Marcel Chwialkowski, Benjamin Doerr, Martin S. Krejca
2025	—	`conf`	Hot off the Press: Speeding Up the NSGA-II With a Simple Tie-Breaking Rule. GECCO Companion Benjamin Doerr, Tudor Ivan, Martin S. Krejca
2025	J	`jnl`	Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer. CoRR Benjamin Doerr, Martin S. Krejca, Milan Stankovic
2025	A*	`conf`	Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II. IJCAI Yasser Alghouass, Benjamin Doerr, Martin S. Krejca, Mohammed Lagmah
2025	J	`jnl`	Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II. CoRR Yasser Alghouass, Benjamin Doerr, Martin S. Krejca, Mohammed Lagmah
2025	A*	`conf`	Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces. AAAI Benjamin Doerr, Martin S. Krejca, Günter Rudolph
2025	J	`jnl`	Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark. CoRR Marcel Chwialkowski, Benjamin Doerr, Martin S. Krejca
2025	A*	`conf`	Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy. IJCAI Mingfeng Li, Weijie Zheng, Benjamin Doerr
2025	J	`jnl`	Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy. CoRR Mingfeng Li, Weijie Zheng, Benjamin Doerr
2025	A*	`conf`	Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator. IJCAI Abderrahim Bendahi, Benjamin Doerr, Adrien Fradin, Johannes F. Lutzeyer
2025	J	`jnl`	Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator. CoRR Abderrahim Bendahi, Benjamin Doerr, Adrien Fradin, Johannes F. Lutzeyer
2025	J	`jnl`	Speeding Up the NSGA-II via Dynamic Population Sizes. CoRR Benjamin Doerr, Martin S. Krejca, Simon Wietheger
2025	A*	`conf`	Speeding Up the NSGA-II with a Simple Tie-Breaking Rule. AAAI Benjamin Doerr, Tudor Ivan, Martin S. Krejca
2025	A*	`conf`	The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III). IJCAI Renzhong Deng, Weijie Zheng, Benjamin Doerr
2025	J	`jnl`	The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III). CoRR Renzhong Deng, Weijie Zheng, Benjamin Doerr
2025	J	`jnl`	The Runtime of Randomized Local Search on the generalized Needle problem. IEEE Trans. Evol. Comput. Benjamin Doerr, Andrew James Kelley
2025	A*	`conf`	Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm. IJCAI Benjamin Doerr, Martin S. Krejca, Andre Opris
2025	J	`jnl`	Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm. CoRR Benjamin Doerr, Martin S. Krejca, Andre Opris
2025	—	`conf`	Tutorial: A Gentle Introduction to Theory (for Non-Theoreticians). GECCO Companion Benjamin Doerr
2024	A	`conf`	A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. GECCO Benjamin Doerr, Joshua D. Knowles, Aneta Neumann, Frank Neumann
2024	J	`jnl`	A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. CoRR Benjamin Doerr, Joshua D. Knowles, Aneta Neumann, Frank Neumann
2024	—	`conf`	A Gentle Introduction to Theory (for Non-Theoreticians). GECCO Companion Benjamin Doerr
2024	—	`conf`	A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). GECCO Companion Simon Wietheger, Benjamin Doerr
2024	A	`conf`	Already Moderate Population Sizes Provably Yield Strong Robustness to Noise. GECCO Denis Antipov, Benjamin Doerr, Alexandra Ivanova
2024	J	`jnl`	Already Moderate Population Sizes Provably Yield Strong Robustness to Noise. CoRR Denis Antipov, Benjamin Doerr, Alexandra Ivanova
2024	J	`jnl`	An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics. Algorithmica Henry Bambury, Antoine Bultel, Benjamin Doerr
2024	J	`jnl`	Choosing the right algorithm with hints from complexity theory. Inf. Comput. Shouda Wang, Weijie Zheng, Benjamin Doerr
2024	J	`jnl`	Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem. CoRR Benjamin Doerr, Dimitri Korkotashvili, Martin S. Krejca
2024	J	`jnl`	Estimation-of-distribution algorithms for multi-valued decision variables. Theor. Comput. Sci. Firas Ben Jedidia, Benjamin Doerr, Martin S. Krejca
2024	J	`jnl`	Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It. CoRR Denis Antipov, Benjamin Doerr
2024	J	`jnl`	Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. Algorithmica Benjamin Doerr, Andrew James Kelley
2024	—	`conf`	Hot off the Press: Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. GECCO Companion Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle, Sebastian Will
2024	—	`conf`	Hot off the Press: Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives. GECCO Companion Weijie Zheng, Benjamin Doerr
2024	—	`conf`	Hot off the Press: Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. GECCO Companion Weijie Zheng, Benjamin Doerr
2024	—	`conf`	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 Sacha Cerf, Benjamin Doerr, Benjamin Hebras, Yakob Kahane, Simon Wietheger
2024	A*	`conf`	How to Use the Metropolis Algorithm for Multi-Objective Optimization? AAAI Weijie Zheng, Mingfeng Li, Renzhong Deng, Benjamin Doerr
2024	—	`conf`	How to Use the Metropolis Algorithm for Multi-Objective Optimization? GECCO Companion Weijie Zheng, Mingfeng Li, Renzhong Deng, Benjamin Doerr
2024	J	`jnl`	Hyper-Heuristics Can Profit From Global Variation Operators. CoRR Benjamin Doerr, Johannes F. Lutzeyer
2024	J	`jnl`	Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution. Algorithmica Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2024	J	`jnl`	Lower Bounds from Fitness Levels Made Easy. Algorithmica Benjamin Doerr, Timo Kötzing
2024	—	`conf`	Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. PPSN (4) Simon Wietheger, Benjamin Doerr
2024	J	`jnl`	Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. CoRR Simon Wietheger, Benjamin Doerr
2024	J	`jnl`	Overcome the Difficulties of NSGA-II via Truthful Crowding Distance with Theoretical Guarantees. CoRR Weijie Zheng, Benjamin Doerr
2024	J	`jnl`	Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions. CoRR Benjamin Doerr, Martin S. Krejca, Noé Weeks
2024	—	`conf`	Proven Runtime Guarantees for How the MOEA/D: Computes the Pareto Front from the Subproblem Solutions. PPSN (3) Benjamin Doerr, Martin S. Krejca, Noé Weeks
2024	J	`jnl`	Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces. CoRR Benjamin Doerr, Martin S. Krejca, Günter Rudolph
2024	J	`jnl`	Runtime Analysis for Permutation-based Evolutionary Algorithms. Algorithmica Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim
2024	—	`conf`	Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem. PPSN (3) Renzhong Deng, Weijie Zheng, Mingfeng Li, Jie Liu, Benjamin Doerr
2024	J	`jnl`	Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency for Many Objectives. IEEE Trans. Evol. Comput. Weijie Zheng, Benjamin Doerr
2024	A*	`conf`	Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations. AAAI Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, Martin S. Krejca
2024	—	`conf`	Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations. GECCO Companion Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, Martin S. Krejca
2024	A*	`conf`	Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. AAAI Weijie Zheng, Benjamin Doerr
2024	J	`jnl`	Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Algorithmica Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
2024	J	`jnl`	Speeding Up the NSGA-II With a Simple Tie-Breaking Rule. CoRR Benjamin Doerr, Tudor Ivan, Martin S. Krejca
2024	A	`conf`	Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics. GECCO Benjamin Doerr, Martin S. Krejca, Nguyen Vu
2024	J	`jnl`	Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics. CoRR Benjamin Doerr, Martin S. Krejca, Nguyen Vu
2024	J	`jnl`	The Runtime of Random Local Search on the Generalized Needle Problem. CoRR Benjamin Doerr, Andrew James Kelley
2023	J	`jnl`	(1+1) Genetic Programming With Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error. CoRR Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
2023	J	`jnl`	(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error. Artif. Intell. Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
2023	J	`jnl`	A First Runtime Analysis of the NSGA-II on a Multimodal Problem. IEEE Trans. Evol. Comput. Benjamin Doerr, Zhongdi Qu
2023	—	`conf`	A Gentle Introduction to Theory (for Non-Theoreticians). GECCO Companion Benjamin Doerr
2023	A*	`conf`	A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). IJCAI Simon Wietheger, Benjamin Doerr
2023	J	`jnl`	Bivariate Estimation-of-Distribution Algorithms Can Find an Exponential Number of Optima. CoRR Benjamin Doerr, Martin S. Krejca
2023	J	`jnl`	Bivariate estimation-of-distribution algorithms can find an exponential number of optima. Theor. Comput. Sci. Benjamin Doerr, Martin S. Krejca
2023	A	`conf`	Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables. GECCO Firas Ben Jedidia, Benjamin Doerr, Martin S. Krejca
2023	J	`jnl`	Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables. CoRR Firas Ben Jedidia, Benjamin Doerr, Martin S. Krejca
2023	A	`conf`	Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. GECCO Benjamin Doerr, Andrew James Kelley
2023	J	`jnl`	Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. CoRR Benjamin Doerr, Andrew James Kelley
2023	J	`jnl`	From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms. J. Mach. Learn. Res. Weijie Zheng, Benjamin Doerr
2023	A*	`conf`	From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. AAAI Benjamin Doerr, Zhongdi Qu
2023	—	`conf`	Hot off the Press: A First Runtime Analysis of the NSGA-II on a Multimodal Problem. GECCO Companion Benjamin Doerr, Zhongdi Qu
2023	—	`conf`	Hot off the Press: From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. GECCO Companion Benjamin Doerr, Zhongdi Qu
2023	—	`conf`	Hot off the Press: Runtime Analysis for the NSGA-II - Provable Speed-Ups From Crossover. GECCO Companion Benjamin Doerr, Zhongdi Qu
2023	A	`conf`	How Well Does the Metropolis Algorithm Cope With Local Optima? GECCO Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt
2023	J	`jnl`	How Well Does the Metropolis Algorithm Cope With Local Optima? CoRR Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt
2023	A	`conf`	How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs. GECCO Benjamin Doerr, Arthur Dremaux, Johannes F. Lutzeyer, Aurélien Stumpf
2023	J	`jnl`	How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs. CoRR Benjamin Doerr, Arthur Dremaux, Johannes F. Lutzeyer, Aurélien Stumpf
2023	J	`jnl`	Larger Offspring Populations Help the (1 + (λ, λ)) Genetic Algorithm to Overcome the Noise. CoRR Alexandra Ivanova, Denis Antipov, Benjamin Doerr
2023	A	`conf`	Larger Offspring Populations Help the (1 + (λ, λlambda)) Genetic Algorithm to Overcome the Noise. GECCO Alexandra Ivanova, Denis Antipov, Benjamin Doerr
2023	J	`jnl`	Lasting Diversity and Superior Runtime Guarantees for the (μ+1) Genetic Algorithm. CoRR Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, Martin S. Krejca
2023	J	`jnl`	Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II). Artif. Intell. Weijie Zheng, Benjamin Doerr
2023	J	`jnl`	Randomized Rumor Spreading Revisited (Long Version). CoRR Benjamin Doerr, Anatolii Kostrygin
2023	A*	`conf`	Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. IJCAI Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle, Sebastian Will
2023	J	`jnl`	Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. CoRR Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle, Sebastian Will
2023	A*	`conf`	Runtime Analysis for the NSGA-II: Provable Speed-Ups from Crossover. AAAI Benjamin Doerr, Zhongdi Qu
2023	J	`jnl`	Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. CoRR Weijie Zheng, Benjamin Doerr
2023	J	`jnl`	Stagnation detection meets fast mutation. Theor. Comput. Sci. Benjamin Doerr, Amirhossein Rajabi
2023	A*	`conf`	The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. IJCAI Sacha Cerf, Benjamin Doerr, Benjamin Hebras, Yakob Kahane, Simon Wietheger
2023	J	`jnl`	The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. CoRR Sacha Cerf, Benjamin Doerr, Benjamin Hebras, Yakob Kahane, Simon Wietheger
2023	J	`jnl`	Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives. Evol. Comput. Weijie Zheng, Benjamin Doerr
2022	A*	`conf`	A First Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II). AAAI Weijie Zheng, Yufei Liu, Benjamin Doerr
2022	—	`conf`	A First Runtime Analysis of the NSGA-II on a Multimodal Problem. PPSN (2) Benjamin Doerr, Zhongdi Qu
2022	J	`jnl`	A First Runtime Analysis of the NSGA-II on a Multimodal Problem. CoRR Zhongdi Qu, Benjamin Doerr
2022	J	`jnl`	A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). CoRR Benjamin Doerr, Simon Wietheger
2022	J	`jnl`	A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions. Algorithmica Denis Antipov, Benjamin Doerr, Vitalii Karavaev
2022	—	`conf`	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 Weijie Zheng, Yufei Liu, Benjamin Doerr
2022	—	`conf`	A gentle introduction to theory (for non-theoreticians). GECCO Companion Benjamin Doerr
2022	J	`jnl`	A sharp discrepancy bound for jittered sampling. Math. Comput. Benjamin Doerr
2022	J	`jnl`	Automated Algorithm Selection for Radar Network Configuration. CoRR Quentin Renau, Johann Dréo, Alain Peres, Yann Semet, Carola Doerr, Benjamin Doerr
2022	A	`conf`	Automated algorithm selection for radar network configuration. GECCO Quentin Renau, Johann Dréo, Alain Peres, Yann Semet, Carola Doerr, Benjamin Doerr
2022	J	`jnl`	Better Approximation Guarantees for the NSGA-II by Using the Current Crowding Distance. CoRR Weijie Zheng, Benjamin Doerr
2022	A	`conf`	Better approximation guarantees for the NSGA-II by using the current crowding distance. GECCO Weijie Zheng, Benjamin Doerr
2022	—	`conf`	Choosing the right algorithm with hints from complexity theory: (hot-off-the-press track at GECCO 2022). GECCO Companion Shouda Wang, Weijie Zheng, Benjamin Doerr
2022	J	`jnl`	Does Comma Selection Help to Cope with Local Optima? Algorithmica Benjamin Doerr
2022	J	`jnl`	Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182). Dagstuhl Reports Josu Ceberio Uribe, Benjamin Doerr, Carsten Witt, Vicente P. Soloviev
2022	J	`jnl`	Fast Mutation in Crossover-Based Algorithms. Algorithmica Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2022	J	`jnl`	Fixed-Target Runtime Analysis. Algorithmica Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov
2022	J	`jnl`	From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms. CoRR Weijie Zheng, Benjamin Doerr
2022	J	`jnl`	From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. CoRR Benjamin Doerr, Zhongdi Qu
2022	—	`conf`	General Univariate Estimation-of-Distribution Algorithms. PPSN (2) Benjamin Doerr, Marc Dufay
2022	J	`jnl`	General Univariate Estimation-of-Distribution Algorithms. CoRR Benjamin Doerr, Marc Dufay
2022	—	`conf`	Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022). GECCO Companion Denis Antipov, Benjamin Doerr
2022	J	`jnl`	Runtime Analysis for Permutation-based Evolutionary Algorithms. CoRR Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim
2022	J	`jnl`	Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Three or More Objectives. CoRR Weijie Zheng, Benjamin Doerr
2022	J	`jnl`	Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. CoRR Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
2022	A	`conf`	Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. GECCO Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
2022	B	`conf`	Stagnation Detection Meets Fast Mutation. EvoCOP Benjamin Doerr, Amirhossein Rajabi
2022	J	`jnl`	Stagnation Detection meets Fast Mutation. CoRR Benjamin Doerr, Amirhossein Rajabi
2022	J	`jnl`	The $(1+(λ, λ))$ Global SEMO Algorithm. CoRR Benjamin Doerr, Omar El Hadri, Adrien Pinard
2022	A	`conf`	The (1 + (λ, λ)) global SEMO algorithm. GECCO Benjamin Doerr, Omar El Hadri, Adrien Pinard
2022	J	`jnl`	The First Mathematical Proof That Crossover Gives Super-Constant Performance Gains For the NSGA-II. CoRR Benjamin Doerr, Zhongdi Qu
2022	J	`jnl`	Towards a Stronger Theory for Permutation-based Evolutionary Algorithms. CoRR Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim
2022	A	`conf`	Towards a stronger theory for permutation-based evolutionary algorithms. GECCO Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim
2021	J	`jnl`	A First Mathematical Runtime Analysis of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). CoRR Weijie Zheng, Yufei Liu, Benjamin Doerr
2021	J	`jnl`	A Sharp Discrepancy Bound for Jittered Sampling. CoRR Benjamin Doerr
2021	J	`jnl`	A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization. ACM Trans. Evol. Learn. Optim. Benjamin Doerr, Frank Neumann
2021	J	`jnl`	A Tight Runtime Analysis for the (μ + λ ) EA. Algorithmica Denis Antipov, Benjamin Doerr
2021	—	`conf`	A gentle introduction to theory (for non-theoreticians). GECCO Companion Benjamin Doerr
2021	A	`conf`	A rigorous runtime analysis of the 2-MMAS GECCO Riade Benbaki, Ziyad Benomar, Benjamin Doerr
2021	J	`jnl`	A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes. Theor. Comput. Sci. Benjamin Doerr, Martin S. Krejca
2021	J	`jnl`	An Extended Jump Function Benchmark for the Analysis of Randomized Search Heuristics. CoRR Henry Bambury, Antoine Bultel, Benjamin Doerr
2021	A*	`conf`	Choosing the Right Algorithm With Hints From Complexity Theory. IJCAI Shouda Wang, Weijie Zheng, Benjamin Doerr
2021	J	`jnl`	Choosing the Right Algorithm With Hints From Complexity Theory. CoRR Shouda Wang, Weijie Zheng, Benjamin Doerr
2021	J	`jnl`	Exponential upper bounds for the runtime of randomized search heuristics. Theor. Comput. Sci. Benjamin Doerr
2021	A	`conf`	Generalized jump functions. GECCO Henry Bambury, Antoine Bultel, Benjamin Doerr
2021	J	`jnl`	Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution. CoRR Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2021	A	`conf`	Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. GECCO Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2021	J	`jnl`	Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift. Evol. Comput. Benjamin Doerr
2021	J	`jnl`	Lower Bounds from Fitness Levels Made Easy. CoRR Benjamin Doerr, Timo Kötzing
2021	A	`conf`	Lower bounds from fitness levels made easy. GECCO Benjamin Doerr, Timo Kötzing
2021	J	`jnl`	Multiplicative Up-Drift. Algorithmica Benjamin Doerr, Timo Kötzing
2021	J	`jnl`	On Negative Dependence Properties of Latin Hypercube Samples and Scrambled Nets. CoRR Benjamin Doerr, Michael Gnewuch
2021	J	`jnl`	On negative dependence properties of Latin hypercube samples and scrambled nets. J. Complex. Benjamin Doerr, Michael Gnewuch
2021	J	`jnl`	Precise Runtime Analysis for Plateau Functions. ACM Trans. Evol. Learn. Optim. Denis Antipov, Benjamin Doerr
2021	J	`jnl`	Runtime Analysis for Self-adaptive Mutation Rates. Algorithmica Benjamin Doerr, Carsten Witt, Jing Yang
2021	J	`jnl`	Runtime analysis of evolutionary algorithms via symmetry arguments. Inf. Process. Lett. Benjamin Doerr
2021	—	`conf`	Runtime analysis via symmetry arguments: (hot-off-the-press track at GECCO 2021). GECCO Companion Benjamin Doerr
2021	J	`jnl`	Self-Adjusting Mutation Rates with Provably Optimal Success Rules. Algorithmica Benjamin Doerr, Carola Doerr, Johannes Lengler
2021	J	`jnl`	The Runtime of the Compact Genetic Algorithm on Jump Functions. Algorithmica Benjamin Doerr
2021	J	`jnl`	The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis. Evol. Comput. Benjamin Doerr, Martin S. Krejca
2021	J	`jnl`	The recovery of ridge functions on the hypercube suffers from the curse of dimensionality. J. Complex. Benjamin Doerr, Sebastian Mayer
2021	A*	`conf`	Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives. AAAI Benjamin Doerr, Weijie Zheng
2021	—	`conf`	Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives: (hot-off-the-press track at GECCO 2021). GECCO Companion Benjamin Doerr, Weijie Zheng
2021	B	`conf`	Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions. EvoApplications Quentin Renau, Johann Dréo, Carola Doerr, Benjamin Doerr
2021	J	`jnl`	Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions. CoRR Quentin Renau, Johann Dréo, Carola Doerr, Benjamin Doerr
2020	J	`jnl`	A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes. CoRR Benjamin Doerr, Martin S. Krejca
2020	J	`jnl`	A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization. CoRR Benjamin Doerr, Frank Neumann
2020	—	`conf`	A gentle introduction to theory (for non-theoreticians). GECCO Companion Benjamin Doerr
2020	A	`conf`	Bivariate estimation-of-distribution algorithms can find an exponential number of optima. GECCO Benjamin Doerr, Martin S. Krejca
2020	J	`jnl`	Does Comma Selection Help To Cope With Local Optima. CoRR Benjamin Doerr
2020	A	`conf`	Does comma selection help to cope with local optima? GECCO Benjamin Doerr
2020	—	`conf`	Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy. PPSN (2) Quentin Renau, Carola Doerr, Johann Dréo, Benjamin Doerr
2020	J	`jnl`	Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy. CoRR Quentin Renau, Carola Doerr, Johann Dréo, Benjamin Doerr
2020	—	`conf`	Exponential Upper Bounds for the Runtime of Randomized Search Heuristics. PPSN (2) Benjamin Doerr
2020	J	`jnl`	Exponential Upper Bounds for the Runtime of Randomized Search Heuristics. CoRR Benjamin Doerr
2020	J	`jnl`	Fast Mutation in Crossover-based Algorithms. CoRR Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2020	A	`conf`	Fast mutation in crossover-based algorithms. GECCO Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2020	J	`jnl`	First Steps Towards a Runtime Analysis When Starting With a Good Solution. CoRR Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2020	—	`conf`	First Steps Towards a Runtime Analysis When Starting with a Good Solution. PPSN (2) Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2020	J	`jnl`	Fixed-Target Runtime Analysis. CoRR Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov
2020	A	`conf`	Fixed-target runtime analysis. GECCO Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov
2020	J	`jnl`	From Understanding Genetic Drift to a Smart-Restart Parameter-less Compact Genetic Algorithm. CoRR Benjamin Doerr, Weijie Zheng
2020	A	`conf`	From understanding genetic drift to a smart-restart parameter-less compact genetic algorithm. GECCO Benjamin Doerr, Weijie Zheng
2020	J	`jnl`	Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. IEEE Trans. Inf. Theory Benjamin Doerr, Marvin Künnemann
2020	J	`jnl`	Lower Bounds for Non-Elitist Evolutionary Algorithms Via Negative Multiplicative Drift. CoRR Benjamin Doerr
2020	—	`conf`	Lower Bounds for Non-elitist Evolutionary Algorithms via Negative Multiplicative Drift. PPSN (2) Benjamin Doerr
2020	J	`jnl`	Optimal parameter choices via precise black-box analysis. Theor. Comput. Sci. Benjamin Doerr, Carola Doerr, Jing Yang
2020	A*	`conf`	Optimization of Chance-Constrained Submodular Functions. AAAI Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2020	—	`ch.`	Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. Theory of Evolutionary Computation Benjamin Doerr
2020	J	`jnl`	Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments. CoRR Benjamin Doerr
2020	—	`conf`	Runtime Analysis of a Heavy-Tailed (1+(λ , λ )) Genetic Algorithm on Jump Functions. PPSN (2) Denis Antipov, Benjamin Doerr
2020	J	`jnl`	Runtime Analysis of a Heavy-Tailed (1+(λ, λ)) Genetic Algorithm on Jump Functions. CoRR Denis Antipov, Benjamin Doerr
2020	J	`jnl`	Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms. IEEE Trans. Evol. Comput. Benjamin Doerr, Weijie Zheng
2020	—	`conf`	Sharp bounds for genetic drift in estimation of distribution algorithms (Hot-off-the-press track at GECCO 2020). GECCO Companion Benjamin Doerr, Weijie Zheng
2020	J	`jnl`	Significance-Based Estimation-of-Distribution Algorithms. IEEE Trans. Evol. Comput. Benjamin Doerr, Martin S. Krejca
2020	A	`conf`	The (1 + ( GECCO Denis Antipov, Benjamin Doerr, Vitalii Karavaev
2020	J	`jnl`	The (1 + (λ, λ)) GA Is Even Faster on Multimodal Problems. CoRR Denis Antipov, Benjamin Doerr, Vitalii Karavaev
2020	J	`jnl`	The Univariate Marginal Distribution Algorithm Copes Well With Deception and Epistasis. CoRR Benjamin Doerr, Martin S. Krejca
2020	B	`conf`	The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis. EvoCOP Benjamin Doerr, Martin S. Krejca
2020	J	`jnl`	The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time. Theor. Comput. Sci. Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler
2020	—	`conf`	The univariate marginal distribution algorithm copes well with deception and epistasis. GECCO Companion Benjamin Doerr, Martin S. Krejca
2020	J	`jnl`	Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives. CoRR Benjamin Doerr, Weijie Zheng
2020	—	`book`	Theory of Evolutionary Computation - Recent Developments in Discrete Optimization Theory of Evolutionary Computation Benjamin Doerr, Frank Neumann
2020	—	`ch.`	Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices. Theory of Evolutionary Computation Benjamin Doerr, Carola Doerr
2020	J	`jnl`	Working principles of binary differential evolution. Theor. Comput. Sci. Benjamin Doerr, Weijie Zheng
2019	J	`jnl`	A Tight Runtime Analysis for the cGA on Jump Functions - EDAs Can Cross Fitness Valleys at No Extra Cost. CoRR Benjamin Doerr
2019	A	`conf`	A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones. FOGA Denis Antipov, Benjamin Doerr, Vitalii Karavaev
2019	A	`conf`	A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost. GECCO Benjamin Doerr
2019	J	`jnl`	An Exponential Lower Bound for the Runtime of the cGA on Jump Functions. CoRR Benjamin Doerr
2019	A	`conf`	An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. FOGA Benjamin Doerr
2019	J	`jnl`	Analyzing randomized search heuristics via stochastic domination. Theor. Comput. Sci. Benjamin Doerr
2019	J	`jnl`	Evolving Boolean Functions with Conjunctions and Disjunctions via Genetic Programming. CoRR Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
2019	A	`conf`	Evolving boolean functions with conjunctions and disjunctions via genetic programming. GECCO Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
2019	—	`conf`	Expressiveness and robustness of landscape features. GECCO (Companion) Quentin Renau, Johann Dréo, Carola Doerr, Benjamin Doerr
2019	J	`jnl`	Fast Re-Optimization via Structural Diversity. CoRR Benjamin Doerr, Carola Doerr, Frank Neumann
2019	A	`conf`	Fast re-optimization via structural diversity. GECCO Benjamin Doerr, Carola Doerr, Frank Neumann
2019	—	`conf`	Fixed-target runtime analysis of the (1 + 1) EA with resampling. GECCO (Companion) Dmitry Vinokurov, Maxim Buzdalov, Arina Buzdalova, Benjamin Doerr, Carola Doerr
2019	J	`jnl`	Island Models Meet Rumor Spreading. Algorithmica Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck
2019	J	`jnl`	Multiplicative Up-Drift. CoRR Benjamin Doerr, Timo Kötzing
2019	A	`conf`	Multiplicative up-drift. GECCO Benjamin Doerr, Timo Kötzing
2019	J	`jnl`	Optimization of Chance-Constrained Submodular Functions. CoRR Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2019	J	`jnl`	Self-Adjusting Mutation Rates with Provably Optimal Success Rules. CoRR Benjamin Doerr, Carola Doerr, Johannes Lengler
2019	A	`conf`	Self-adjusting mutation rates with provably optimal success rules. GECCO Benjamin Doerr, Carola Doerr, Johannes Lengler
2019	J	`jnl`	Sharp Bounds for Genetic Drift in EDAs. CoRR Benjamin Doerr, Weijie Zheng
2019	J	`jnl`	Solving Problems with Unknown Solution Length at Almost No Extra Cost. Algorithmica Benjamin Doerr, Carola Doerr, Timo Kötzing
2019	J	`jnl`	The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. Algorithmica Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang
2019	J	`jnl`	The Efficiency Threshold for the Offspring Population Size of the (μ, λ) EA. CoRR Denis Antipov, Benjamin Doerr, Quentin Yang
2019	J	`jnl`	The Runtime of the Compact Genetic Algorithm on Jump Functions. CoRR Benjamin Doerr
2019	A	`conf`	The efficiency threshold for the offspring population size of the ( GECCO Denis Antipov, Benjamin Doerr, Quentin Yang
2019	J	`jnl`	The query complexity of a permutation-based variant of Mastermind. Discret. Appl. Math. Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
2019	—	`conf`	Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem. GECCO (Companion) Vitalii Karavaev, Denis Antipov, Benjamin Doerr
2019	—	`conf`	Theory for non-theoreticians: introductory tutorial. GECCO (Companion) Benjamin Doerr
2019	A	`conf`	When resampling to cope with noise, use median, not mean. GECCO Benjamin Doerr, Andrew M. Sutton
2018	J	`jnl`	A Tight Runtime Analysis for the (μ+ λ) EA. CoRR Denis Antipov, Benjamin Doerr
2018	A	`conf`	A new analysis method for evolutionary optimization of dynamic and noisy objective functions. GECCO Raphaël Dang-Nhu, Thibault Dardinier, Benjamin Doerr, Gautier Izacard, Dorian Nogneng
2018	A	`conf`	A tight runtime analysis for the (μ + λ) EA. GECCO Denis Antipov, Benjamin Doerr, Jiefeng Fang, Tangi Hetet
2018	J	`jnl`	Better Runtime Guarantees Via Stochastic Domination. CoRR Benjamin Doerr
2018	B	`conf`	Better Runtime Guarantees via Stochastic Domination. EvoCOP Benjamin Doerr
2018	—	`conf`	Better runtime guarantees via stochastic domination (hot-off-the-press track at GECCO 2018). GECCO (Companion) Benjamin Doerr
2018	J	`jnl`	Bounding Bloat in Genetic Programming. CoRR Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler
2018	A	`conf`	On the runtime analysis of selection hyper-heuristics with adaptive learning periods. GECCO Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker
2018	J	`jnl`	Optimal Parameter Choices via Precise Black-Box Analysis. CoRR Benjamin Doerr, Carola Doerr, Jing Yang
2018	J	`jnl`	Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ, λ)) Genetic Algorithm. Algorithmica Benjamin Doerr, Carola Doerr
2018	—	`conf`	Precise Runtime Analysis for Plateaus. PPSN (2) Denis Antipov, Benjamin Doerr
2018	J	`jnl`	Precise Runtime Analysis for Plateaus. CoRR Denis Antipov, Benjamin Doerr
2018	J	`jnl`	Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. CoRR Benjamin Doerr
2018	J	`jnl`	Runtime Analysis for Self-adaptive Mutation Rates. CoRR Benjamin Doerr, Carsten Witt, Jing Yang
2018	A	`conf`	Runtime analysis for self-adaptive mutation rates. GECCO Benjamin Doerr, Carsten Witt, Jing Yang
2018	J	`jnl`	Significance-based Estimation-of-Distribution Algorithms. CoRR Benjamin Doerr, Martin S. Krejca
2018	A	`conf`	Significance-based estimation-of-distribution algorithms. GECCO Benjamin Doerr, Martin S. Krejca
2018	J	`jnl`	Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables. Algorithmica Benjamin Doerr, Carola Doerr, Timo Kötzing
2018	J	`jnl`	The Query Complexity of a Permutation-Based Variant of Mastermind. CoRR Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
2018	—	`conf`	Theory for non-theoreticians: tutorial. GECCO (Companion) Benjamin Doerr
2018	J	`jnl`	Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices. CoRR Benjamin Doerr, Carola Doerr
2018	J	`jnl`	Working Principles of Binary Differential Evolution. CoRR Benjamin Doerr, Weijie Zheng
2018	A	`conf`	Working principles of binary differential evolution. GECCO Weijie Zheng, Guangwen Yang, Benjamin Doerr
2017	J	`jnl`	An Elementary Analysis of the Probability That a Binomial Random Variable Exceeds Its Expectation. CoRR Benjamin Doerr
2017	A	`conf`	Bounding bloat in genetic programming. GECCO Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler
2017	J	`jnl`	Detecting structural breaks in time series via genetic algorithms. Soft Comput. Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt
2017	J	`jnl`	Fast Genetic Algorithms. CoRR Benjamin Doerr, Huu Phuoc Le, Régis Makhmara, Ta Duy Nguyen
2017	A	`conf`	Fast genetic algorithms. GECCO Benjamin Doerr, Huu Phuoc Le, Régis Makhmara, Ta Duy Nguyen
2017	A	`conf`	Island models meet rumor spreading. GECCO Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck
2017	A*	`conf`	Randomized Rumor Spreading Revisited. ICALP Benjamin Doerr, Anatolii Kostrygin
2017	J	`jnl`	Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas. CoRR Maxim Buzdalov, Benjamin Doerr
2017	A	`conf`	Runtime analysis of the (1 + ( GECCO Maxim Buzdalov, Benjamin Doerr
2017	A	`conf`	The (1+ GECCO Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang
2017	J	`jnl`	The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. CoRR Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang
2017	—	`conf`	The unrestricted black-box complexity of jump functions. GECCO (Companion) Maxim Buzdalov, Benjamin Doerr, Mikhail Kever
2017	—	`conf`	Theory for non-theoreticians. GECCO (Companion) Benjamin Doerr
2017	J	`jnl`	Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica Benjamin Doerr, Frank Neumann, Andrew M. Sutton
2017	A	`conf`	Unknown solution length problems with no asymptotically optimal run time. GECCO Benjamin Doerr, Carola Doerr, Timo Kötzing
2016	J	`jnl`	Guest Editorial: Theory of Evolutionary Computation. Algorithmica Benjamin Doerr, Carsten Witt
2016	—	`ch.`	How to Generate Randomized Roundings with Dependencies and How to Derandomize Them. Algorithm Engineering Benjamin Doerr, Magnus Wahlström
2016	A*	`conf`	Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. ICALP Benjamin Doerr, Marvin Künnemann
2016	J	`jnl`	Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. CoRR Benjamin Doerr, Marvin Künnemann
2016	A	`conf`	Optimal Parameter Choices via Precise Black-Box Analysis. GECCO Benjamin Doerr, Carola Doerr, Jing Yang
2016	J	`jnl`	Optimal Parameter Settings for the $(1+(λ, λ))$ Genetic Algorithm. CoRR Benjamin Doerr
2016	A	`conf`	Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm. GECCO Benjamin Doerr
2016	J	`jnl`	Playing Mastermind With Many Colors. J. ACM Benjamin Doerr, Carola Doerr, Reto Spöhel, Henning Thomas
2016	A	`conf`	Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables. PPSN Benjamin Doerr, Carola Doerr, Timo Kötzing
2016	A	`conf`	Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax. GECCO Benjamin Doerr, Wanru Gao, Frank Neumann
2016	J	`jnl`	Simple and optimal randomized fault-tolerant rumor spreading. Distributed Comput. Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran
2016	J	`jnl`	The Impact of Random Initialization on the Runtime of Randomized Search Heuristics. Algorithmica Benjamin Doerr, Carola Doerr
2016	A	`conf`	The Right Mutation Strength for Multi-Valued Decision Variables. GECCO Benjamin Doerr, Carola Doerr, Timo Kötzing
2016	J	`jnl`	The Right Mutation Strength for Multi-Valued Decision Variables. CoRR Benjamin Doerr, Carola Doerr, Timo Kötzing
2016	J	`jnl`	The Unrestricted Black-Box Complexity of Jump Functions. Evol. Comput. Maxim Buzdalov, Benjamin Doerr, Mikhail Kever
2016	—	`conf`	Theory for Non-Theoreticians. GECCO (Companion) Benjamin Doerr, Carola Doerr
2016	A	`conf`	Tutorials at PPSN 2016. PPSN 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
2016	A	`conf`	k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation. PPSN Benjamin Doerr, Carola Doerr, Jing Yang
2015	J	`jnl`	A Tight Runtime Analysis of the $(1+(λ, λ))$ Genetic Algorithm on OneMax. CoRR Benjamin Doerr, Carola Doerr
2015	A	`conf`	A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax. GECCO Benjamin Doerr, Carola Doerr
2015	J	`jnl`	From black-box complexity to designing new genetic algorithms. Theor. Comput. Sci. Benjamin Doerr, Carola Doerr, Franziska Ebel
2015	A	`conf`	Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. GECCO Benjamin Doerr, Frank Neumann, Andrew M. Sutton
2015	A	`conf`	Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization. GECCO Axel de Perthuis de Laillevault, Benjamin Doerr, Carola Doerr
2015	J	`jnl`	Online Checkpointing with Improved Worst-Case Guarantees. INFORMS J. Comput. Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan
2015	A	`conf`	Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings. GECCO Benjamin Doerr, Carola Doerr
2015	J	`jnl`	Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings. CoRR Benjamin Doerr, Carola Doerr
2015	J	`jnl`	Optimising Spatial and Tonal Data for PDE-based Inpainting. CoRR Laurent Hoeltgen, Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Simon Setzer, Daniel Johannsen, Frank Neumann, Benjamin Doerr
2015	J	`jnl`	Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances. Theor. Comput. Sci. Benjamin Doerr, Marvin Künnemann
2015	B	`conf`	Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem. EvoCOP Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2015	A	`conf`	Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. GECCO Benjamin Doerr, Carola Doerr, Timo Kötzing
2015	J	`jnl`	Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. CoRR Benjamin Doerr, Carola Doerr, Timo Kötzing
2015	J	`jnl`	Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). Dagstuhl Reports Benjamin Doerr, Nikolaus Hansen, Christian Igel, Lothar Thiele
2015	J	`jnl`	Unbiased Black-Box Complexities of Jump Functions. Evol. Comput. Benjamin Doerr, Carola Doerr, Timo Kötzing
2015	B	`conf`	Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ. EvoCOP Maxim Buzdalov, Mikhail Kever, Benjamin Doerr
2014	J	`jnl`	A lower bound for the discrepancy of a random point set. J. Complex. Benjamin Doerr
2014	—	`conf`	Black-box complexity: from complexity theory to playing mastermind. GECCO (Companion) Benjamin Doerr, Carola Doerr
2014	J	`jnl`	Editorial for the Special Issue on Theoretical Foundations of Evolutionary Computation. IEEE Trans. Evol. Comput. Frank Neumann, Benjamin Doerr, Per Kristian Lehre, Pauline C. Haddow
2014	A	`conf`	Monotonic functions in EC: anything but monotone! GECCO Sylvain Colin, Benjamin Doerr, Gaspard Férey
2014	J	`jnl`	Playing Mastermind with Constant-Size Memory. Theory Comput. Syst. Benjamin Doerr, Carola Winzen
2014	J	`jnl`	Quasirandom Rumor Spreading. ACM Trans. Algorithms Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
2014	J	`jnl`	Randomized Rounding in the Presence of a Cardinality Constraint. ACM J. Exp. Algorithmics Benjamin Doerr, Magnus Wahlström
2014	J	`jnl`	Ranking-Based Black-Box Complexity. Algorithmica Benjamin Doerr, Carola Winzen
2014	J	`jnl`	Reducing the arity in unbiased black-box complexity. Theor. Comput. Sci. Benjamin Doerr, Carola Winzen
2014	J	`jnl`	The Price of Anarchy for Selfish Ring Routing is Two. ACM Trans. Economics and Comput. Xujin Chen, Benjamin Doerr, Carola Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee
2014	A	`conf`	The impact of random initialization on the runtime of randomized search heuristics. GECCO Benjamin Doerr, Carola Doerr
2014	J	`jnl`	The unbiased black-box complexity of partition is polynomial. Artif. Intell. Benjamin Doerr, Carola Doerr, Timo Kötzing
2014	—	`conf`	Tight Analysis of Randomized Rumor Spreading in Complete Graphs. ANALCO Benjamin Doerr, Marvin Künnemann
2014	J	`jnl`	Unbiased Black-Box Complexities of Jump Functions - How to Cross Large Plateaus. CoRR Benjamin Doerr, Carola Doerr, Timo Kötzing
2014	A	`conf`	Unbiased black-box complexities of jump functions: how to cross large plateaus. GECCO Benjamin Doerr, Carola Doerr, Timo Kötzing
2013	A	`conf`	A method to derive fixed budget results from expected optimisation times. GECCO Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges
2013	J	`jnl`	Adaptive Drift Analysis. Algorithmica Benjamin Doerr, Leslie Ann Goldberg
2013	J	`jnl`	Black-box complexities of combinatorial problems. Theor. Comput. Sci. Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen
2013	—	`conf`	Black-box complexity: from complexity theory to playing mastermind. GECCO (Companion) Benjamin Doerr, Carola Doerr
2013	J	`jnl`	Collecting Coupons with Random Initial Stake. CoRR Benjamin Doerr, Carola Doerr
2013	J	`jnl`	Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042). Dagstuhl Reports Benjamin Doerr, Robert Elsässer, Pierre Fraigniaud
2013	J	`jnl`	Evolutionary Algorithms and Dynamic Programming CoRR Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen
2013	—	`conf`	Evolutionary algorithms for the detection of structural breaks in time series: extended abstract. GECCO (Companion) Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt
2013	A	`conf`	How the (1+λ) evolutionary algorithm optimizes linear functions. GECCO Benjamin Doerr, Marvin Künnemann
2013	J	`jnl`	Improved Approximation Algorithms for the Min-Max Selecting Items Problem CoRR Benjamin Doerr
2013	J	`jnl`	Improved approximation algorithms for the Min-Max Selecting Items problem. Inf. Process. Lett. Benjamin Doerr
2013	A	`conf`	Lessons from the black-box: fast crossover-based genetic algorithms. GECCO Benjamin Doerr, Carola Doerr, Franziska Ebel
2013	B	`conf`	Lower bounds for the runtime of a global multi-objective evolutionary algorithm. IEEE Congress on Evolutionary Computation Benjamin Doerr, Bojana Kodric, Marco Voigt
2013	J	`jnl`	More effective crossover operators for the all-pairs shortest path problem. Theor. Comput. Sci. Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2013	J	`jnl`	Mutation Rate Matters Even When Optimizing Monotonic Functions. Evol. Comput. Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
2013	J	`jnl`	Online Checkpointing with Improved Worst-Case Guarantees CoRR Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan
2013	—	`conf`	Online Checkpointing with Improved Worst-Case Guarantees. ICALP (1) Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan
2013	C	`conf`	Online checkpointing with improved worst-case guarantees. CTW Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan
2013	A*	`conf`	Playing Mastermind with Many Colors. SODA Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen
2013	B	`conf`	Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations. IEEE Congress on Evolutionary Computation Benjamin Doerr, Marvin Künnemann
2013	J	`jnl`	Strong robustness of randomized rumor spreading protocols. Discret. Appl. Math. Benjamin Doerr, Anna Huber, Ariel Levavi
2013	—	`conf`	The Query Complexity of Finding a Hidden Permutation. Space-Efficient Data Structures, Streams, and Algorithms Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
2013	J	`jnl`	Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271). Dagstuhl Reports Benjamin Doerr, Nikolaus Hansen, Jonathan L. Shapiro, L. Darrell Whitley
2013	A	`conf`	When do evolutionary algorithms optimize separable functions in parallel? FOGA Benjamin Doerr, Dirk Sudholt, Carsten Witt
2013	J	`jnl`	Winkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions CoRR Benjamin Doerr
2012	J	`jnl`	A Lower Bound for the Discrepancy of a Random Point Set CoRR Benjamin Doerr
2012	A	`conf`	Ants easily solve stochastic shortest path problems. GECCO Benjamin Doerr, Ashish Ranjan Hota, Timo Kötzing
2012	—	`conf`	Asynchronous Rumor Spreading in Preferential Attachment Graphs. SWAT Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
2012	J	`jnl`	Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes CoRR Benjamin Doerr, Carola Winzen
2012	—	`conf`	Black-box complexity: from complexity theory to playing mastermind. GECCO (Companion) Benjamin Doerr
2012	J	`jnl`	Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. Benjamin Doerr, Edda Happ, Christian Klein
2012	—	`conf`	Experimental Analysis of Rumor Spreading in Social Networks. MedAlg Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
2012	J	`jnl`	Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity CoRR Benjamin Doerr, Shay Moran, Shlomo Moran, Carola Winzen
2012	J	`jnl`	Memory-restricted black-box complexity of OneMax. Inf. Process. Lett. Benjamin Doerr, Carola Winzen
2012	J	`jnl`	More Effective Crossover Operators for the All-Pairs Shortest Path Problem CoRR Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2012	J	`jnl`	Multiplicative Drift Analysis. Algorithmica Benjamin Doerr, Daniel Johannsen, Carola Winzen
2012	J	`jnl`	Non-existence of linear universal drift functions. Theor. Comput. Sci. Benjamin Doerr, Daniel Johannsen, Carola Winzen
2012	A	`conf`	Playing Mastermind With Constant-Size Memory. STACS Benjamin Doerr, Carola Winzen
2012	J	`jnl`	Playing Mastermind with Many Colors CoRR Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen
2012	C	`conf`	Playing Mastermind with Many Colors. CTW Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen
2012	J	`jnl`	Reducing the Arity in Unbiased Black-Box Complexity CoRR Benjamin Doerr, Carola Winzen
2012	A	`conf`	Reducing the arity in unbiased black-box complexity. GECCO Benjamin Doerr, Carola Winzen
2012	A	`conf`	Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet. GECCO Benjamin Doerr, Sebastian Pohl
2012	J	`jnl`	The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electron. Colloquium Comput. Complex. Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn
2012	—	`conf`	The Price of Anarchy for Selfish Ring Routing Is Two. WINE Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen
2012	J	`jnl`	The Price of Anarchy for Selfish Ring Routing is Two CoRR Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen
2012	J	`jnl`	Why rumors spread so quickly in social networks. Commun. ACM Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
2011	J	`jnl`	Adaptive Drift Analysis CoRR Benjamin Doerr, Leslie Ann Goldberg
2011	—	`ch.`	Analyzing Randomized Search Heuristics: Tools from Probability Theory. Theory of Randomized Search Heuristics Benjamin Doerr
2011	—	`conf`	Asymptotically Optimal Randomized Rumor Spreading. ICALP (2) Benjamin Doerr, Mahmoud Fouz
2011	J	`jnl`	Asymptotically Optimal Randomized Rumor Spreading. Electron. Notes Discret. Math. Benjamin Doerr, Mahmoud Fouz
2011	J	`jnl`	Black-Box Complexities of Combinatorial Problems CoRR Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen
2011	—	`conf`	Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes. Artificial Evolution Benjamin Doerr, Carola Winzen
2011	A	`conf`	Black-box complexities of combinatorial problems. GECCO Benjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen
2011	A	`conf`	Dependent Randomized Rounding: The Bipartite Case. ALENEX Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
2011	—	`conf`	Drift analysis. GECCO (Companion) Benjamin Doerr
2011	J	`jnl`	Evolutionary algorithms and dynamic programming. Theor. Comput. Sci. Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen
2011	A	`conf`	Faster black-box algorithms through higher arity operators. FOGA Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen
2011	—	`conf`	Memory-Constrained Algorithms for Shortest Path Problem. CCCG Tetsuo Asano, Benjamin Doerr
2011	J	`jnl`	Memory-Restricted Black-Box Complexity. Electron. Colloquium Comput. Complex. Benjamin Doerr, Carola Winzen
2011	J	`jnl`	Multiplicative Drift Analysis CoRR Benjamin Doerr, Daniel Johannsen, Carola Winzen
2011	—	`conf`	Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. SSVM Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, Benjamin Doerr
2011	J	`jnl`	Playing Mastermind With Constant-Size Memory CoRR Benjamin Doerr, Carola Winzen
2011	J	`jnl`	Quasi-random rumor spreading: Reducing randomness can be costly. Inf. Process. Lett. Benjamin Doerr, Mahmoud Fouz
2011	J	`jnl`	Quasirandom rumor spreading: An experimental analysis. ACM J. Exp. Algorithmics Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
2011	A	`conf`	Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. FOGA Benjamin Doerr, Daniel Johannsen, Martin Schmidt
2011	J	`jnl`	Runtime analysis of the 1-ANT ant colony optimizer. Theor. Comput. Sci. Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt
2011	A	`conf`	Sharp bounds by probability-generating functions and variable drift. GECCO Benjamin Doerr, Mahmoud Fouz, Carsten Witt
2011	J	`jnl`	Social Networks Spread Rumors in Sublogarithmic Time. Electron. Notes Discret. Math. Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
2011	A*	`conf`	Social networks spread rumors in sublogarithmic time. STOC Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
2011	B	`conf`	Stabilizing consensus with the power of two choices. SPAA Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler
2011	J	`jnl`	Theory of Evolutionary Computation. Algorithmica Benjamin Doerr, Thomas Jansen
2011	—	`book`	Theory of Randomized Search Heuristics: Foundations and Recent Developments. Theory of Randomized Search Heuristics Anne Auger, Benjamin Doerr
2011	J	`jnl`	Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem. Evol. Comput. Benjamin Doerr, Edda Happ, Christian Klein
2011	A	`conf`	Too fast unbiased black-box algorithms. GECCO Benjamin Doerr, Timo Kötzing, Carola Winzen
2011	J	`jnl`	Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity CoRR Benjamin Doerr, Carola Winzen
2011	Misc	`conf`	Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. CSR Benjamin Doerr, Carola Winzen
2010	—	`conf`	Adaptive Drift Analysis. PPSN (1) Benjamin Doerr, Leslie Ann Goldberg
2010	J	`jnl`	Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. J. Complex. Benjamin Doerr, Michael Gnewuch, Magnus Wahlström
2010	J	`jnl`	Asymptotically Optimal Randomized Rumor Spreading CoRR Benjamin Doerr, Mahmoud Fouz
2010	A	`conf`	Brief Announcement: Stabilizing Consensus with the Power of Two Choices. DISC Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler
2010	J	`jnl`	Deterministic Random Walks on Regular Trees CoRR Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2010	J	`jnl`	Deterministic random walks on regular trees. Random Struct. Algorithms Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2010	—	`conf`	Drift Analysis with Tail Bounds. PPSN (1) Benjamin Doerr, Leslie Ann Goldberg
2010	B	`conf`	Drift analysis and linear functions revisited. IEEE Congress on Evolutionary Computation Benjamin Doerr, Daniel Johannsen, Carola Winzen
2010	A	`conf`	Edge-based representation beats vertex-based representation in shortest path problems. GECCO Benjamin Doerr, Daniel Johannsen
2010	J	`jnl`	Editorial. Algorithmica Benjamin Doerr, Frank Neumann, Ingo Wegener
2010	J	`jnl`	Faster Black-Box Algorithms Through Higher Arity Operators CoRR Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen
2010	J	`jnl`	Hereditary Discrepancies in Different Numbers of Colors II. SIAM J. Discret. Math. Benjamin Doerr, Mahmoud Fouz
2010	J	`jnl`	In Memoriam: Ingo Wegener. Algorithmica Benjamin Doerr, Frank Neumann
2010	—	`conf`	More Effective Crossover Operators for the All-Pairs Shortest Path Problem. PPSN (1) Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2010	A	`conf`	Multiplicative drift analysis. GECCO Benjamin Doerr, Daniel Johannsen, Carola Winzen
2010	J	`jnl`	Non-Existence of Linear Universal Drift Functions CoRR Benjamin Doerr, Daniel Johannsen, Carola Winzen
2010	—	`conf`	Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. PPSN (1) Süntje Böttcher, Benjamin Doerr, Frank Neumann
2010	J	`jnl`	Optimizing Monotone Functions Can Be Difficult CoRR Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
2010	—	`conf`	Optimizing Monotone Functions Can Be Difficult. PPSN (1) Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
2010	J	`jnl`	Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly CoRR Benjamin Doerr, Mahmoud Fouz
2010	J	`jnl`	Quasirandom Rumor Spreading CoRR Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
2010	J	`jnl`	Quasirandom Rumor Spreading: An Experimental Analysis CoRR Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
2010	A	`conf`	Quasirandom evolutionary algorithms. GECCO Benjamin Doerr, Mahmoud Fouz, Carsten Witt
2010	J	`jnl`	Randomized Rounding for Routing and Covering Problems: Experiments and Improvements CoRR Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
2010	B	`conf`	Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. SEA Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
2010	J	`jnl`	Strong Robustness of Randomized Rumor Spreading Protocols CoRR Benjamin Doerr, Anna Huber, Ariel Levavi
2009	J	`jnl`	A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading. Electron. Notes Discret. Math. Benjamin Doerr, Mahmoud Fouz
2009	—	`conf`	BBOB: Nelder-Mead with resize and halfruns. GECCO (Companion) Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, Magnus Wahlström
2009	A	`conf`	Computing single source shortest paths using single-objective fitness. FOGA Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann
2009	J	`jnl`	Deterministic Random Walks on the Two-Dimensional Grid. Comb. Probab. Comput. Benjamin Doerr, Tobias Friedrich
2009	A	`conf`	Evolutionary algorithms and dynamic programming. GECCO Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile
2009	A	`conf`	Improved analysis methods for crossover-based algorithms. GECCO Benjamin Doerr, Madeleine Theile
2009	—	`conf`	Introducing Quasirandomness to Computer Science. Efficient Algorithms Benjamin Doerr
2009	J	`jnl`	Quasirandom Rumor Spreading on Expanders. Electron. Notes Discret. Math. Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
2009	A	`conf`	Quasirandom Rumor Spreading: An Experimental Analysis. ALENEX Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
2009	—	`conf`	Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. ICALP (1) Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
2009	A	`conf`	Randomized Rounding in the Presence of a Cardinality Constraint. ALENEX Benjamin Doerr, Magnus Wahlström
2009	—	`conf`	Stabilizing Consensus with the Power of Two Choices. Algorithmic Methods for Distributed Cooperative Systems Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler
2009	B	`conf`	Strong Robustness of Randomized Rumor Spreading Protocols. ISAAC Benjamin Doerr, Anna Huber, Ariel Levavi
2009	J	`jnl`	Tight Bounds for Quasirandom Rumor Spreading. Electron. J. Comb. Spyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou
2008	A	`conf`	Comparing global and local mutations on bit strings. GECCO Benjamin Doerr, Thomas Jansen, Christian Klein
2008	J	`jnl`	Component-by-component construction of low-discrepancy point sets of small size. Monte Carlo Methods Appl. Benjamin Doerr, Michael Gnewuch, Peter Kritzer, Friedrich Pillichshammer
2008	A	`conf`	Crossover can provably be useful in evolutionary computation. GECCO Benjamin Doerr, Edda Happ, Christian Klein
2008	A*	`conf`	Deterministic random walks on regular trees. SODA Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2008	B	`conf`	Directed trees: A powerful representation for sorting and ordering problems. IEEE Congress on Evolutionary Computation Benjamin Doerr, Edda Happ
2008	A	`conf`	How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. PPSN Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang
2008	A*	`conf`	Quasirandom rumor spreading. SODA Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
2007	B	`conf`	A rigorous view on neutrality. IEEE Congress on Evolutionary Computation Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann
2007	B	`conf`	A tight analysis of the (1 + 1)-EA for the single source shortest path problem. IEEE Congress on Evolutionary Computation Benjamin Doerr, Edda Happ, Christian Klein
2007	A	`conf`	Adjacency list matchings: an ideal genotype for cycle covers. GECCO Benjamin Doerr, Daniel Johannsen
2007	J	`jnl`	Deterministic Random Walks on Regular Trees. Electron. Notes Discret. Math. Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2007	J	`jnl`	Deterministic random walks on the integers. Eur. J. Comb. Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer, Gábor Tardos
2007	—	`conf`	Faster Evolutionary Algorithms by Superior Graph Representation. FOCI Benjamin Doerr, Christian Klein, Tobias Storch
2007	J	`jnl`	Matrix approximation and Tusnády's problem. Eur. J. Comb. Benjamin Doerr
2007	J	`jnl`	On the minimum load coloring problem. J. Discrete Algorithms Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
2007	A	`conf`	On the runtime analysis of the 1-ANT ACO algorithm. GECCO Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt
2007	J	`jnl`	Partial Colorings of Unimodular Hypergraphs. Electron. Notes Discret. Math. Benjamin Doerr
2007	A	`conf`	Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. STACS Benjamin Doerr
2007	B	`conf`	Refined runtime analysis of a basic ant colony optimization algorithm. IEEE Congress on Evolutionary Computation Benjamin Doerr, Daniel Johannsen
2007	J	`jnl`	Roundings Respecting Hard Constraints. Theory Comput. Syst. Benjamin Doerr
2007	J	`jnl`	Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. Evol. Comput. Benjamin Doerr, Nils Hebbinghaus, Frank Neumann
2007	J	`jnl`	The Interval Liar Game. Electron. Notes Discret. Math. Benjamin Doerr, Johannes Lengler, David Steurer
2007	J	`jnl`	Unbiased Matrix Rounding. Electron. Notes Discret. Math. Tobias Friedrich, Benjamin Doerr, Christian Klein, Ralf Osbild
2006	J	`jnl`	Controlled Randomized Rounding. Electron. Notes Discret. Math. Benjamin Doerr, Christian Klein
2006	B	`conf`	Deterministic Random Walks on the Two-Dimensional Grid. ISAAC Benjamin Doerr, Tobias Friedrich
2006	—	`conf`	Deterministic Random Walks. ANALCO Joshua N. Cooper, Benjamin Doerr, Joel Spencer, Gábor Tardos
2006	J	`jnl`	Discrepancy of Symmetric Products of Hypergraphs. Electron. J. Comb. Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus
2006	J	`jnl`	Error Propagation in Game Trees. Math. Methods Oper. Res. Benjamin Doerr, Ulf Lorenz
2006	A	`conf`	Generating Randomized Roundings with Cardinality Constraints and Derandomizations. STACS Benjamin Doerr
2006	J	`jnl`	Hereditary Discrepancies in Different Numbers of Colors II CoRR Benjamin Doerr, Mahmoud Fouz
2006	J	`jnl`	Improved Bounds and Schemes for the Declustering Problem CoRR Benjamin Doerr, Nils Hebbinghaus, Sören Werth
2006	J	`jnl`	Improved bounds and schemes for the declustering problem. Theor. Comput. Sci. Benjamin Doerr, Nils Hebbinghaus, Sören Werth
2006	J	`jnl`	Inserting Points Uniformly at Every Instance. IEICE Trans. Inf. Syst. Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr
2006	J	`jnl`	Matrix rounding with respect to small submatrices. Random Struct. Algorithms Benjamin Doerr
2006	J	`jnl`	Non-independent randomized rounding and coloring. Discret. Appl. Math. Benjamin Doerr
2006	J	`jnl`	Quasirandomness in Graphs. Electron. Notes Discret. Math. Benjamin Doerr, Tobias Friedrich
2006	A	`conf`	Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. PPSN Benjamin Doerr, Nils Hebbinghaus, Frank Neumann
2006	J	`jnl`	Speeding up Evolutionary Algorithms by Restricted Mutation Operators. Electron. Colloquium Comput. Complex. Nils Hebbinghaus, Benjamin Doerr, Frank Neumann
2006	B	`conf`	The Interval Liar Game. ISAAC Benjamin Doerr, Johannes Lengler, David Steurer
2006	J	`jnl`	Unbiased Matrix Rounding CoRR Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
2006	—	`conf`	Unbiased Matrix Rounding. SWAT Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
2006	—	`conf`	Unbiased Rounding of Rational Matrices. FSTTCS Benjamin Doerr, Christian Klein
2005	J	`jnl`	Bounds and constructions for the star-discrepancy via ?-covers. J. Complex. Benjamin Doerr, Michael Gnewuch, Anand Srivastav
2005	A*	`conf`	Matrix rounding with low error in small submatrices. SODA Benjamin Doerr
2005	B	`conf`	On the Minimum Load Coloring Problem. WAOA Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
2005	B	`conf`	Rounding of Sequences and Matrices, with Applications. WAOA Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
2005	A	`conf`	Roundings Respecting Hard Constraints. STACS Benjamin Doerr
2004	C	`conf`	An Improved Discrepancy Approach to Declustering. CTW Benjamin Doerr, Nils Hebbinghaus, Sören Werth
2004	J	`jnl`	An Improved Discrepancy Approach to Declustering. Electron. Notes Discret. Math. Benjamin Doerr, Nils Hebbinghaus, Sören Werth
2004	C	`conf`	Coloring Graphs with Minimal Edge Load. CTW Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav
2004	J	`jnl`	Coloring Graphs with Minimal Edge Load. Electron. Notes Discret. Math. Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav
2004	J	`jnl`	Discrepancy of Cartesian Products of Arithmetic Progressions. Electron. J. Comb. Benjamin Doerr, Anand Srivastav, Petra Wehr
2004	J	`jnl`	European tenure games. Theor. Comput. Sci. Benjamin Doerr
2004	J	`jnl`	Global roundings of sequences. Inf. Process. Lett. Benjamin Doerr
2004	B	`conf`	Improved Bounds and Schemes for the Declustering Problem. MFCS Benjamin Doerr, Nils Hebbinghaus, Sören Werth
2004	J	`jnl`	Linear Discrepancy of Totally Unimodular Matrices. Comb. Benjamin Doerr
2004	A*	`conf`	Matrix rounding and approximation. SODA Benjamin Doerr
2004	J	`jnl`	Nonindependent Randomized Rounding and an Application to Digital Halftoning. SIAM J. Comput. Benjamin Doerr
2004	J	`jnl`	Typical rounding problems. Theor. Comput. Sci. Benjamin Doerr
2003	J	`jnl`	Multicolour Discrepancies. Comb. Probab. Comput. Benjamin Doerr, Anand Srivastav
2003	A*	`conf`	Non-independent randomized rounding. SODA Benjamin Doerr
2002	A*	`conf`	Antirandomizing the Wrong Game. ICALP Benjamin Doerr
2002	A	`conf`	Balanced Coloring: Equally Easy for All Numbers of Colors? STACS Benjamin Doerr
2002	J	`jnl`	Discrepancy in different numbers of colors. Discret. Math. Benjamin Doerr
2002	A	`conf`	Non-independent Randomized Rounding and an Application to Digital Halftoning. ESA Benjamin Doerr, Henning Schnieder
2002	J	`jnl`	On the discrepancy of combinatorial rectangles. Random Struct. Algorithms Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen
2002	—	`conf`	Typical Rounding Problems. APPROX Benjamin Doerr
2001	J	`jnl`	Coloring Discret. Math. Geir Agnarsson, Benjamin Doerr, Tomasz Schoen
2001	A*	`conf`	Lattice approximation and linear discrepency of totally unimodular matrices. SODA Benjamin Doerr
2001	J	`jnl`	Multi-Color Discrepancies - Extended Abstract -. Electron. Notes Discret. Math. Benjamin Doerr, Anand Srivastav
2001	J	`jnl`	Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. Electron. Notes Discret. Math. Benjamin Doerr, Anand Srivastav
2001	A	`conf`	Recursive Randomized Coloring Beats Fair Dice Random Colorings. STACS Benjamin Doerr, Anand Srivastav
2001	B	`conf`	Structured Randomized Rounding and Coloring. FCT Benjamin Doerr
2001	J	`jnl`	Vector Balancing Games with Aging. Electron. Notes Discret. Math. Benjamin Doerr
2001	J	`jnl`	Vector Balancing Games with Aging. J. Comb. Theory A Benjamin Doerr
2000	J	`jnl`	Linear And Hereditary Discrepancy. Comb. Probab. Comput. Benjamin Doerr
2000	J	`jnl`	Linear Discrepancy of Basic Totally Unimodular Matrices. Electron. J. Comb. Benjamin Doerr
1999	—	`conf`	Approximation of Multi-color Discrepancy. RANDOM-APPROX Benjamin Doerr, Anand Srivastav