Benjamin Doerr

发表

Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem

Benjamin Doerr, Edda Happ, Christian Klein, 2011, Evolutionary Computation.

Significance-Based Estimation-of-Distribution Algorithms

Benjamin Doerr, Martin S. Krejca, 2020, IEEE Transactions on Evolutionary Computation.

Adaptive Drift Analysis

Leslie Ann Goldberg, Benjamin Doerr, L. A. Goldberg, 2011, Algorithmica.

Improved bounds and schemes for the declustering problem

Benjamin Doerr, Nils Hebbinghaus, Sören Werth, 2006, Theor. Comput. Sci..

From black-box complexity to designing new genetic algorithms

Benjamin Doerr, Carola Doerr, Franziska Ebel, 2015, Theor. Comput. Sci..

Does comma selection help to cope with local optima?

Benjamin Doerr, 2020, GECCO.

An Elementary Analysis of the Probability That a Binomial Random Variable Exceeds Its Expectation pdf

Benjamin Doerr, Benjamin Doerr, 2017, Statistics & Probability Letters.

Recursive Randomized Coloring Beats Fair Dice Random Colorings

Anand Srivastav, Benjamin Doerr, 2001, STACS.

Lessons from the black-box: fast crossover-based genetic algorithms

Benjamin Doerr, Carola Doerr, Franziska Ebel, 2013, GECCO '13.

Simple and Optimal Fault-Tolerant Rumor Spreading

Shay Moran, Benjamin Doerr, Shlomo Moran, 2012 .

A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading

Mahmoud Fouz, Benjamin Doerr, 2009, Electron. Notes Discret. Math..

Significance-Based Estimation-of-Distribution Algorithms

Benjamin Doerr, Martin S. Krejca, Benjamin Doerr, 2018, IEEE Transactions on Evolutionary Computation.

Reducing the arity in unbiased black-box complexity

Benjamin Doerr, Carola Doerr, 2014, Theor. Comput. Sci..

Discrepancy of Cartesian Products of Arithmetic Progressions

Anand Srivastav, Benjamin Doerr, Petra Wehr, 2004, Electron. J. Comb..

Mutation Rate Matters Even When Optimizing Monotonic Functions

Thomas Jansen, Dirk Sudholt, Christine Zarges, 2013, Evolutionary Computation.

The Runtime of the Compact Genetic Algorithm on Jump Functions pdf

Benjamin Doerr, Benjamin Doerr, 2019, Algorithmica.

First Steps Towards a Runtime Analysis When Starting With a Good Solution pdf

Benjamin Doerr, Maxim Buzdalov, Denis Antipov, 2020, PPSN.

Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness

Thomas Sauerwald, Tobias Friedrich, Benjamin Doerr, 2009, ICALP.

Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2016, PPSN.

Guest Editorial: Theory of Evolutionary Computation

Benjamin Doerr, Carsten Witt, 2016, Algorithmica.

The $(1 + (\lambda, \lambda))$ GA Is Even Faster on Multimodal Problems

Benjamin Doerr, Denis Antipov, Vitalii Karavaev, 2020 .

Quasirandom Rumor Spreading on Expanders

Thomas Sauerwald, Tobias Friedrich, Benjamin Doerr, 2009, Electron. Notes Discret. Math..

Structured Randomized Rounding and Coloring

Benjamin Doerr, 2001, FCT.

Unbiased Matrix Rounding

Tobias Friedrich, Benjamin Doerr, Christian Klein, 2007, Electron. Notes Discret. Math..

Exponential upper bounds for the runtime of randomized search heuristics

Benjamin Doerr, 2021, Theor. Comput. Sci..

Discrepancy of Symmetric Products of Hypergraphs

Michael Gnewuch, Benjamin Doerr, Nils Hebbinghaus, 2006, Electron. J. Comb..

A tight analysis of the (1 + 1)-EA for the single source shortest path problem

Benjamin Doerr, Edda Happ, Christian Klein, 2007, IEEE Congress on Evolutionary Computation.

Analyzing randomized search heuristics via stochastic domination

Benjamin Doerr, Benjamin Doerr, 2019, Theor. Comput. Sci..

Quasirandom rumor spreading: An experimental analysis pdf

Thomas Sauerwald, Tobias Friedrich, Marvin Künnemann, 2008, JEAL.

Playing Mastermind with Constant-Size Memory

Benjamin Doerr, Carola Doerr, 2012, Theory of Computing Systems.

Error Propagation in Game Trees

Benjamin Doerr, Ulf Lorenz, Benjamin Doerr, 2006, Math. Methods Oper. Res..

The Impact of Random Initialization on the Runtime of Randomized Search Heuristics

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2014, Algorithmica.

Improved analysis methods for crossover-based algorithms

Benjamin Doerr, Madeleine Theile, Benjamin Doerr, 2009, GECCO.

Introducing Quasirandomness to Computer Science

Benjamin Doerr, 2009, Efficient Algorithms.

The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time

Benjamin Doerr, Timo Kötzing, Johannes Lengler, 2020, Theor. Comput. Sci..

Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem

Benjamin Doerr, Denis Antipov, Vitalii Karavaev, 2019, GECCO.

Algorithmic construction of low-discrepancy point sets via dependent randomized rounding

Magnus Wahlström, Michael Gnewuch, Benjamin Doerr, 2010, J. Complex..

Quasirandom evolutionary algorithms

Mahmoud Fouz, Benjamin Doerr, Carsten Witt, 2010, GECCO '10.

Balanced Coloring: Equally Easy for All Numbers of Colors?

Benjamin Doerr, 2002, STACS.

Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators

Frank Neumann, Benjamin Doerr, Nils Hebbinghaus, 2007, Evolutionary Computation.

Drift analysis

Benjamin Doerr, Benjamin Doerr, 2011, GECCO.

Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem

Marvin Künnemann, Benjamin Doerr, 2020, IEEE Transactions on Information Theory.

Artificial Immune Systems can Beat Evolutionary Algorithms in Combinatorial Optimisation

Thomas Jansen, Christine Zarges, Benjamin Doerr, 2016, GECCO '16.

Adjacency list matchings: an ideal genotype for cycle covers

Benjamin Doerr, Daniel Johannsen, Benjamin Doerr, 2007, GECCO '07.

Multiplicative drift analysis

Benjamin Doerr, Daniel Johannsen, Carola Doerr, 2010, GECCO.

Bounds and constructions for the star-discrepancy via ?-covers

Anand Srivastav, Michael Gnewuch, Benjamin Doerr, 2005, J. Complex..

Too fast unbiased black-box algorithms

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2011, GECCO '11.

Adaptive Drift Analysis

Leslie Ann Goldberg, Benjamin Doerr, 2010, PPSN.

Asymptotically Optimal Randomized Rumor Spreading

Mahmoud Fouz, Benjamin Doerr, 2011, ICALP.

Evolving boolean functions with conjunctions and disjunctions via genetic programming

Pietro Simone Oliveto, Benjamin Doerr, Andrei Lissovoi, 2019, GECCO.

Tight Analysis of Randomized Rumor Spreading in Complete Graphs

Marvin Künnemann, Benjamin Doerr, Benjamin Doerr, 2014, ANALCO.

Component-by-component construction of low-discrepancy point sets of small size

Peter Kritzer, Michael Gnewuch, Benjamin Doerr, 2008, Monte Carlo Methods Appl..

Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm

Benjamin Doerr, Benjamin Doerr, 2016, GECCO.

Discrepancy in different numbers of colors

Benjamin Doerr, 2002, Discret. Math..

On the minimum load coloring problem

Anand Srivastav, Benjamin Doerr, Andreas Baltz, 2005, J. Discrete Algorithms.

Optimal Parameter Settings for the $(1+(\lambda, \lambda))$ Genetic Algorithm

Benjamin Doerr, Benjamin Doerr, 2016 .

Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting

Frank Neumann, Joachim Weickert, Benjamin Doerr, 2011, SSVM.

Faster black-box algorithms through higher arity operators pdf

Per Kristian Lehre, Markus Wagner, Benjamin Doerr, 2010, FOGA '11.

Dependent Randomized Rounding: The Bipartite Case

Magnus Wahlström, Marvin Künnemann, Benjamin Doerr, 2011, ALENEX.

Speeding up Evolutionary Algorithms by Restricted Mutation Operators

Frank Neumann, Benjamin Doerr, Nils Hebbinghaus, 2006, Electron. Colloquium Comput. Complex..

Simple and optimal randomized fault-tolerant rumor spreading

Shay Moran, Benjamin Doerr, Shlomo Moran, 2014, Distributed Computing.

Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization

Benjamin Doerr, Carola Doerr, Axel de Perthuis de Laillevault, 2015, GECCO.

Analyzing Randomized Search Heuristics: Tools from Probability Theory

Benjamin Doerr, Benjamin Doerr, 2011, Theory of Randomized Search Heuristics.

Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments

Benjamin Doerr, 2021, Inf. Process. Lett..

Inserting Points Uniformly at Every Instance

Tetsuo Asano, Benjamin Doerr, Naoki Katoh, 2006, IEICE Trans. Inf. Syst..

The Unrestricted Black-Box Complexity of Jump Functions

Benjamin Doerr, Maxim Buzdalov, Mikhail Kever, 2016, Evolutionary Computation.

Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning

Benjamin Doerr, Benjamin Doerr, 2006 .

Bivariate estimation-of-distribution algorithms can find an exponential number of optima

Benjamin Doerr, Martin S. Krejca, Benjamin Doerr, 2020, GECCO.

Playing Mastermind with Constant-Size Memory

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2011, Theory of Computing Systems.

Monotonic functions in EC: anything but monotone!

Benjamin Doerr, Gaspard Férey, Sylvain Colin, 2014, GECCO.

Bounding bloat in genetic programming

Benjamin Doerr, Timo Kötzing, Johannes Lengler, 2017, GECCO.

Brief Announcement: Stabilizing Consensus with the Power of Two Choices

Christian Scheideler, Thomas Sauerwald, Leslie Ann Goldberg, 2010, DISC.

A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones

Benjamin Doerr, Denis Antipov, Vitalii Karavaev, 2019, FOGA '19.

Non-existence of linear universal drift functions

Benjamin Doerr, Daniel Johannsen, Carola Doerr, 2010, Theor. Comput. Sci..

Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators

Frank Neumann, Benjamin Doerr, Nils Hebbinghaus, 2006, PPSN.

Controlled Randomized Rounding

Benjamin Doerr, Christian Klein, 2006, Electron. Notes Discret. Math..

Optimizing Monotone Functions Can Be Difficult pdf

Thomas Jansen, Dirk Sudholt, Christine Zarges, 2010, PPSN.

The Price of Anarchy for Selfish Ring Routing Is Two

Xiao-Dong Hu, Rob van Stee, Benjamin Doerr, 2012, WINE.

The efficiency threshold for the offspring population size of the (µ, λ) EA

Benjamin Doerr, Denis Antipov, Quentin Yang, 2019, GECCO.

Rounding of Sequences and Matrices, with Applications

Tobias Friedrich, Benjamin Doerr, Christian Klein, 2005, WAOA.

Working principles of binary differential evolution

Weijie Zheng, Benjamin Doerr, Benjamin Doerr, 2018, GECCO.

Deterministic Random Walks on Regular Trees

Joshua N. Cooper, Joel H. Spencer, Tobias Friedrich, 2007, Electron. Notes Discret. Math..

The Efficiency Threshold for the Offspring Population Size of the ($\mu$, $\lambda$) EA

Benjamin Doerr, Denis Antipov, Quentin Yang, 2019, 1904.06981.

Social networks spread rumors in sublogarithmic time

Mahmoud Fouz, Tobias Friedrich, Benjamin Doerr, 2011, STOC '11.

Stabilizing consensus with the power of two choices

Christian Scheideler, Thomas Sauerwald, Leslie Ann Goldberg, 2011, SPAA '11.

Non-independent randomized rounding and coloring

Benjamin Doerr, 2006, Discret. Appl. Math..

Vector Balancing Games with Aging

Benjamin Doerr, 2001, J. Comb. Theory, Ser. A.

On the minimum load coloring problem

Anand Srivastav, Benjamin Doerr, Andreas Baltz, 2007, J. Discrete Algorithms.

Online Checkpointing with Improved Worst-Case Guarantees

Karl Bringmann, Benjamin Doerr, Adrian Neumann, 2015, INFORMS J. Comput..

Online Checkpointing with Improved Worst-Case Guarantees

Karl Bringmann, Benjamin Doerr, Adrian Neumann, 2013, ICALP.

Matrix rounding and approximation

Benjamin Doerr, Benjamin Doerr, 2004, SODA '04.

Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem

Frank Neumann, Benjamin Doerr, Süntje Böttcher, 2010, PPSN.

Unbiased Matrix Rounding

Tobias Friedrich, Benjamin Doerr, Christian Klein, 2006, Electron. Notes Discret. Math..

Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy pdf

Benjamin Doerr, Carola Doerr, Johann Dreo, 2020, PPSN.

On the influence of pheromone updates in ACO algorithms

Dirk Sudholt, Frank Neumann, Benjamin Doerr, 2007 .

On the runtime analysis of the 1-ANT ACO algorithm

Dirk Sudholt, Frank Neumann, Benjamin Doerr, 2007, GECCO '07.

Playing Mastermind with Many Colors

Benjamin Doerr, Carola Doerr, Reto Spöhel, 2013, SODA.

Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation

Frank Neumann, Andrew M. Sutton, Benjamin Doerr, 2015, GECCO.

Runtime Analysis for Self-adaptive Mutation Rates

Benjamin Doerr, Jing Yang, Carsten Witt, 2018, Algorithmica.

Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes pdf

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2011, Artificial Evolution.

A new analysis method for evolutionary optimization of dynamic and noisy objective functions

Dorian Nogneng, Benjamin Doerr, Thibault Dardinier, 2018, GECCO.

Unbiased Rounding of Rational Matrices

Benjamin Doerr, Christian Klein, 2006, FSTTCS.

The Deterministic and Randomized Query Complexity of a Simple Guessing Game

Kurt Mehlhorn, Kasper Green Larsen, Benjamin Doerr, 2012, Electron. Colloquium Comput. Complex..

Drift Analysis with Tail Bounds

Leslie Ann Goldberg, Benjamin Doerr, L. A. Goldberg, 2010, PPSN.

The Query Complexity of Finding a Hidden Permutation

Kurt Mehlhorn, Kasper Green Larsen, Benjamin Doerr, 2013, Space-Efficient Data Structures, Streams, and Algorithms.

Social Networks Spread Rumors in Sublogarithmic Time

Mahmoud Fouz, Tobias Friedrich, Benjamin Doerr, 2011, Electron. Notes Discret. Math..

Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ

Benjamin Doerr, Maxim Buzdalov, Mikhail Kever, 2015, EvoCOP.

The unrestricted black-box complexity of jump functions

Benjamin Doerr, Maxim Buzdalov, Mikhail Kever, 2017, GECCO.

Tutorials at PPSN 2016

Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, 2016, PPSN.

Evolutionary algorithms and dynamic programming

Anton V. Eremeev, Frank Neumann, Benjamin Doerr, 2011, Theor. Comput. Sci..

Asymptotically Optimal Randomized Rumor Spreading

Mahmoud Fouz, Benjamin Doerr, Benjamin Doerr, 2010, Electron. Notes Discret. Math..

How Single Ant ACO Systems Optimize Pseudo-Boolean Functions

Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang, 2008, PPSN.

Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem

Benjamin Doerr, Maxim Buzdalov, Denis Antipov, 2015, EvoCOP.

Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract

Anand Srivastav, Benjamin Doerr, Benjamin Doerr, 2001, Electron. Notes Discret. Math..

Evolutionary algorithms and dynamic programming

Anton V. Eremeev, Benjamin Doerr, Frank Neumann, 2009, GECCO.

Black-box complexities of combinatorial problems

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2013, Theor. Comput. Sci..

Theory for Non-Theoreticians

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2016, GECCO.

Black-box complexity: from complexity theory to playing mastermind

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2014, GECCO.

Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2015, GECCO.

k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation

Benjamin Doerr, Jing Yang, Carola Doerr, 2016, PPSN.

Quasirandom rumor spreading: An experimental analysis

Thomas Sauerwald, Tobias Friedrich, Marvin Künnemann, 2009, JEAL.

Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ,λ))\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2017, Algorithmica.

Matrix rounding with low error in small submatrices

Benjamin Doerr, 2005, SODA '05.

Faster Evolutionary Algorithms by Superior Graph Representation

Benjamin Doerr, Christian Klein, Tobias Storch, 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

Non-independent randomized rounding

Benjamin Doerr, 2003, SODA '03.

Lattice approximation and linear discrepency of totally unimodular matrices

Benjamin Doerr, Benjamin Doerr, 2001, SODA '01.

The (1+λ) evolutionary algorithm with self-adjusting mutation rate

Benjamin Doerr, Jing Yang, Carsten Witt, 2017, GECCO.

Theory for non-theoreticians: introductory tutorial

Benjamin Doerr, Benjamin Doerr, Benjamin Doerr, 2019, GECCO.

Fast re-optimization via structural diversity

Frank Neumann, Benjamin Doerr, Carola Doerr, 2019, GECCO.

Precise Runtime Analysis for Plateaus

Benjamin Doerr, Denis Antipov, Benjamin Doerr, 2018, PPSN.

Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax

Wanru Gao, Frank Neumann, Benjamin Doerr, 2016, GECCO.

Randomly Rounding Rationals with Cardinality Constraints and Derandomizations

Benjamin Doerr, 2007, STACS.

Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations

Marvin Künnemann, Benjamin Doerr, Benjamin Doerr, 2013, 2013 IEEE Congress on Evolutionary Computation.

Memory-Constrained Algorithms for Shortest Path Problem

Tetsuo Asano, Benjamin Doerr, 2011, CCCG.

Island Models Meet Rumor Spreading

Tobias Friedrich, Benjamin Doerr, Timo Kötzing, 2018, Algorithmica.

Directed trees: A powerful representation for sorting and ordering problems

Benjamin Doerr, Edda Happ, Benjamin Doerr, 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

Multiplicative Up-Drift

Benjamin Doerr, Timo Kötzing, Benjamin Doerr, 2019, Algorithmica.

A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes pdf

Benjamin Doerr, Martin S. Krejca, Martin Krejca, 2020, Theor. Comput. Sci..

Detecting structural breaks in time series via genetic algorithms

Benjamin Doerr, Carsten Witt, Paul Fischer, 2017, Soft Comput..

Optimization of Chance-Constrained Submodular Functions pdf

Andrew M. Sutton, Benjamin Doerr, Carola Doerr, 2019, AAAI.

Memory-restricted black-box complexity of OneMax

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2012, Inf. Process. Lett..

GECCO 2007: Genetic and Evolutionary Computation Conference

Thomas Stützle, Riccardo Poli, Mauro Birattari, 2007 .

How the (1+λ) evolutionary algorithm optimizes linear functions

Marvin Künnemann, Benjamin Doerr, Benjamin Doerr, 2013, GECCO '13.

Quasirandom rumor spreading

Thomas Sauerwald, Tobias Friedrich, Benjamin Doerr, 2008, SODA '08.

Linear Discrepancy of Totally Unimodular Matrices*†

Benjamin Doerr, Benjamin Doerr, 2004, Comb..

Roundings Respecting Hard Constraints

Benjamin Doerr, 2006, Theory of Computing Systems.

N E ] 2 0 A pr 2 02 0 Fixed-Target Runtime Analysis ∗

Benjamin Doerr, Maxim Buzdalov, Carola Doerr, 2020 .

Ranking-Based Black-Box Complexity

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2011, Algorithmica.

A tight runtime analysis for the (μ + λ) EA

Benjamin Doerr, Denis Antipov, Jiefeng Fang, 2018, GECCO.

Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity pdf

Shay Moran, Benjamin Doerr, Shlomo Moran, 2012, ArXiv.

On the discrepancy of combinatorial rectangles

Noga Alon, Benjamin Doerr, Tomasz Luczak, 2002, Random Struct. Algorithms.

Sharp bounds by probability-generating functions and variable drift

Mahmoud Fouz, Benjamin Doerr, Carsten Witt, 2011, GECCO '11.

Theory for non-theoreticians: tutorial

Benjamin Doerr, Benjamin Doerr, 2018, GECCO.

A Tight Runtime Analysis of the $(1+(\lambda, \lambda))$ Genetic Algorithm on OneMax

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2015, 1506.05937.

Linear Discrepancy of Basic Totally Unimodular Matrices

Benjamin Doerr, 2000, Electron. J. Comb..

Evolutionary algorithms for the detection of structural breaks in time series: extended abstract

Benjamin Doerr, Carsten Witt, Paul Fischer, 2013, GECCO '13 Companion.

The Impact of Random Initialization on the Runtime of Randomized Search Heuristics

Benjamin Doerr, Carola Doerr, 2015, Algorithmica.

A rigorous view on neutrality

Frank Neumann, Michael Gnewuch, Benjamin Doerr, 2007, 2007 IEEE Congress on Evolutionary Computation.

Sharp bounds for genetic drift in estimation of distribution algorithms (Hot-off-the-press track at GECCO 2020)

Weijie Zheng, Benjamin Doerr, Benjamin Doerr, 2020, GECCO Companion.

Probabilistic Tools for the Analysis of Randomized Optimization Heuristics pdf

Benjamin Doerr, Benjamin Doerr, 2018, Theory of Evolutionary Computation.

Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity

Benjamin Doerr, Carola Doerr, 2011, CSR.

Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet

Benjamin Doerr, Sebastian Pohl, Benjamin Doerr, 2012, GECCO '12.

Drift analysis and linear functions revisited

Benjamin Doerr, Daniel Johannsen, Carola Doerr, 2010, IEEE Congress on Evolutionary Computation.

Experimental Analysis of Rumor Spreading in Social Networks

Mahmoud Fouz, Tobias Friedrich, Benjamin Doerr, 2012, MedAlg.

Randomized Rumor Spreading Revisited

Benjamin Doerr, Anatolii Kostrygin, 2017, ICALP.

In Memoriam: Ingo Wegener

Frank Neumann, Benjamin Doerr, Benjamin Doerr, 2010, Algorithmica.

Theory of Evolutionary Algorithms

L. Darrell Whitley, Benjamin Doerr, Nikolaus Hansen, 2013 .

Crossover can provably be useful in evolutionary computation

Benjamin Doerr, Edda Happ, Christian Klein, 2008, GECCO '08.

A lower bound for the discrepancy of a random point set pdf

Benjamin Doerr, Benjamin Doerr, 2012, J. Complex..

Edge-based representation beats vertex-based representation in shortest path problems

Benjamin Doerr, Daniel Johannsen, Benjamin Doerr, 2010, GECCO '10.

When do evolutionary algorithms optimize separable functions in parallel?

Dirk Sudholt, Benjamin Doerr, Carsten Witt, 2013, FOGA XII '13.

Exponential Upper Bounds for the Runtime of Randomized Search Heuristics

Benjamin Doerr, 2020, PPSN.

From understanding genetic drift to a smart-restart parameter-less compact genetic algorithm

Weijie Zheng, Benjamin Doerr, 2020, GECCO.

Matrix rounding with respect to small submatrices

Benjamin Doerr, 2006, Random Struct. Algorithms.

The Query Complexity of a Permutation-Based Variant of Mastermind pdf

Kurt Mehlhorn, Kasper Green Larsen, Benjamin Doerr, 2019, Discret. Appl. Math..

The unbiased black-box complexity of partition is polynomial

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2014, Artif. Intell..

Memory-Restricted Black-Box Complexity

Benjamin Doerr, Carola Doerr, 2011, Electron. Colloquium Comput. Complex..

Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift

Benjamin Doerr, Benjamin Doerr, 2020, Evolutionary Computation.

Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042)

Pierre Fraigniaud, Robert Elsässer, Benjamin Doerr, 2013, Dagstuhl Reports.

More effective crossover operators for the all-pairs shortest path problem

Frank Neumann, Benjamin Doerr, Daniel Johannsen, 2013, Theor. Comput. Sci..

Matrix approximation and Tusnády's problem

Benjamin Doerr, Benjamin Doerr, 2007, Eur. J. Comb..

Deterministic random walks on the integers

Joshua N. Cooper, Joel H. Spencer, Gábor Tardos, 2007, Eur. J. Comb..

Lower bounds for the runtime of a global multi-objective evolutionary algorithm

Benjamin Doerr, Bojana Kodric, Marco Voigt, 2013, 2013 IEEE Congress on Evolutionary Computation.

Self-Adjusting Mutation Rates with Provably Optimal Success Rules

Benjamin Doerr, Carola Doerr, Johannes Lengler, 2019, Algorithmica.

The Interval Liar Game

David Steurer, Benjamin Doerr, Johannes Lengler, 2006, ISAAC.

Randomized Rounding for Routing and Covering Problems: Experiments and Improvements pdf

Magnus Wahlström, Marvin Künnemann, Benjamin Doerr, 2010, SEA.

Global roundings of sequences

Benjamin Doerr, Benjamin Doerr, 2004, Inf. Process. Lett..

Multi-Color Discrepancies - Extended Abstract -

Anand Srivastav, Benjamin Doerr, 2001, Electron. Notes Discret. Math..

Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets

Benjamin Doerr, Daniel Johannsen, Martin Schmidt, 2011, FOGA '11.

Hereditary Discrepancies in Different Numbers of Colors II pdf

Mahmoud Fouz, Benjamin Doerr, 2010, SIAM J. Discret. Math..

Deterministic Random Walks

Joshua N. Cooper, Joel H. Spencer, Gábor Tardos, 2006, ANALCO.

Better Runtime Guarantees via Stochastic Domination pdf

Benjamin Doerr, Benjamin Doerr, 2018, EvoCOP.

Better runtime guarantees via stochastic domination (hot-off-the-press track at GECCO 2018)

Benjamin Doerr, Benjamin Doerr, 2018, GECCO.

Comparing global and local mutations on bit strings

Thomas Jansen, Benjamin Doerr, Christian Klein, 2008, GECCO '08.

Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem pdf

Marvin Künnemann, Benjamin Doerr, 2016, ICALP.

Winkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions pdf

Benjamin Doerr, 2013, ArXiv.

Collecting Coupons with Random Initial Stake pdf

Benjamin Doerr, Carola Doerr, 2013, ArXiv.

Quasi-random rumor spreading: Reducing randomness can be costly

Mahmoud Fouz, Benjamin Doerr, 2011, Inf. Process. Lett..

Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms

Weijie Zheng, Benjamin Doerr, Benjamin Doerr, 2020, IEEE Transactions on Evolutionary Computation.

GECCO ’14: Proceedings of the 2014 conference on Genetic and evolutionary computation

Julian Togelius, Christine Zarges, Hitoshi Iba, 2014 .

Deterministic Random Walks on the Two-Dimensional Grid

Tobias Friedrich, Benjamin Doerr, 2009, Comb. Probab. Comput..

Reducing the arity in unbiased black-box complexity

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2012, GECCO '12.

Genetic and Evolutionary Computation Conference 2008 : GECCO 2008

Julian F. Miller, Giuliano Antoniol, Maarten Keijzer, 2008, GECCO 2008.

Randomized Rounding in the Presence of a Cardinality Constraint

Magnus Wahlström, Benjamin Doerr, 2009, ALENEX.

The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis pdf

Benjamin Doerr, Martin S. Krejca, Benjamin Doerr, 2020, Evolutionary Computation.

Improved approximation algorithms for the Min-Max Selecting Items problem pdf

Benjamin Doerr, 2013, Inf. Process. Lett..

Runtime Analysis of a Heavy-Tailed (1+(λ, λ)) Genetic Algorithm on Jump Functions pdf

Benjamin Doerr, Denis Antipov, Benjamin Doerr, 2020, PPSN.

Crossover can provably be useful in evolutionary computation

Benjamin Doerr, Edda Happ, Christian Klein, 2012, Theor. Comput. Sci..

A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost

Benjamin Doerr, Benjamin Doerr, 2019, GECCO.

Fixed-Target Runtime Analysis

Benjamin Doerr, Maxim Buzdalov, Denis Antipov, 2020, Algorithmica.

Runtime analysis of the 1-ANT ant colony optimizer

Dirk Sudholt, Frank Neumann, Benjamin Doerr, 2011, Theor. Comput. Sci..

Randomized Rounding in the Presence of a Cardinality Constraint

Magnus Wahlström, Benjamin Doerr, 2014, ACM J. Exp. Algorithmics.

Island models meet rumor spreading

Tobias Friedrich, Benjamin Doerr, Timo Kötzing, 2017, GECCO.

Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas

Frank Neumann, Andrew M. Sutton, Benjamin Doerr, 2016, Algorithmica.

Roundings Respecting Hard Constraints

Benjamin Doerr, 2005, STACS.

How to Generate Randomized Roundings with Dependencies and How to Derandomize Them

Magnus Wahlström, Benjamin Doerr, 2016, Algorithm Engineering.

Typical rounding problems

Benjamin Doerr, 2004, Theor. Comput. Sci..

BBOB: Nelder-Mead with resize and halfruns

Mahmoud Fouz, Magnus Wahlström, Benjamin Doerr, 2009, GECCO '09.

Coloring Graphs with Minimal Edge Load

Anand Srivastav, Benjamin Doerr, Andreas Baltz, 2004, Electron. Notes Discret. Math..

Partial Colorings of Unimodular Hypergraphs

Benjamin Doerr, 2007, Electron. Notes Discret. Math..

Quasirandomness in Graphs

Tobias Friedrich, Benjamin Doerr, 2006, Electron. Notes Discret. Math..

Theory of Randomized Search Heuristics: Foundations and Recent Developments

Anne Auger, Benjamin Doerr, A. Auger, 2011, Theory of Randomized Search Heuristics.

Theory of Evolutionary Computation

Thomas Jansen, Benjamin Doerr, Benjamin Doerr, 2011, Algorithmica.

Deterministic Random Walks on the Two-Dimensional Grid

Tobias Friedrich, Benjamin Doerr, 2006, ISAAC.

Generating Randomized Roundings with Cardinality Constraints and Derandomizations

Benjamin Doerr, 2006, STACS.

Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2018, Algorithmica.

Ants easily solve stochastic shortest path problems

Benjamin Doerr, Timo Kötzing, Ashish Hota, 2012, GECCO '12.

Fast genetic algorithms

Benjamin Doerr, Huu Phuoc Le, Ta Duy Nguyen, 2017, GECCO.

Refined runtime analysis of a basic ant colony optimization algorithm

Benjamin Doerr, Daniel Johannsen, Benjamin Doerr, 2007, 2007 IEEE Congress on Evolutionary Computation.

Antirandomizing the Wrong Game

Benjamin Doerr, 2002, ICALP.

Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)

Lothar Thiele, Christian Igel, Benjamin Doerr, 2015, Dagstuhl Reports.

European tenure games

Benjamin Doerr, 2004, Theor. Comput. Sci..

Vector Balancing Games with Aging

Benjamin Doerr, 2001, Electron. Notes Discret. Math..

Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances

Marvin Künnemann, Benjamin Doerr, Benjamin Doerr, 2015, Theor. Comput. Sci..

Unbiased black-box complexities of jump functions: how to cross large plateaus

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2014, GECCO.

Editorial for the Special Issue on Theoretical Foundations of Evolutionary Computation

Per Kristian Lehre, Frank Neumann, Pauline C. Haddow, 2014, IEEE Trans. Evol. Comput..

The Right Mutation Strength for Multi-Valued Decision Variables

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2016, GECCO.

Theory for non-theoreticians

Benjamin Doerr, Benjamin Doerr, 2017, GECCO.

Strong robustness of randomized rumor spreading protocols pdf

Anna Huber, Benjamin Doerr, Ariel Levavi, 2009, Discret. Appl. Math..

Improved Bounds and Schemes for the Declustering Problem pdf

Benjamin Doerr, Nils Hebbinghaus, Sören Werth, 2004, MFCS.

Multiplicative Drift Analysis

Benjamin Doerr, Daniel Johannsen, Carola Doerr, 2010, GECCO '10.

A tight runtime analysis for the (μ + λ) EA

Benjamin Doerr, Denis Antipov, Benjamin Doerr, 2018, GECCO.

The (1 + (λ,λ)) GA is even faster on multimodal problems

Benjamin Doerr, Denis Antipov, Vitalii Karavaev, 2020, GECCO.

Typical Rounding Problems

Benjamin Doerr, 2002, APPROX.

Optimal Parameter Choices via Precise Black-Box Analysis

Benjamin Doerr, Jing Yang, Carola Doerr, 2016, GECCO.

Approximation of Multi-color Discrepancy

Anand Srivastav, Benjamin Doerr, 1999, RANDOM-APPROX.

Strong robustness of randomized rumor spreading protocols

Anna Huber, Benjamin Doerr, Ariel Levavi, 2013, Discret. Appl. Math..

Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas

Benjamin Doerr, Maxim Buzdalov, Benjamin Doerr, 2017, GECCO.

Coloring t-dimensional m-Boxes

Benjamin Doerr, Geir Agnarsson, Tomasz Schoen, 2001, Discret. Math..

A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization pdf

Benjamin Doerr, Frank Neumann, 2020, ArXiv.

Black-box complexity: from complexity theory to playing mastermind

Benjamin Doerr, 2012, GECCO '12.

A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem

Benjamin Doerr, Edda Happ, Christian Klein, 2007 .

Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices pdf

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2018, Theory of Evolutionary Computation.

Unbiased Black-Box Complexities of Jump Functions

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2014, Evolutionary Computation.

A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2015, GECCO.

Unknown solution length problems with no asymptotically optimal run time

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2017, GECCO.

When resampling to cope with noise, use median, not mean

Andrew M. Sutton, Benjamin Doerr, Benjamin Doerr, 2019, GECCO.

An Improved Discrepancy Approach to Declustering

Benjamin Doerr, Nils Hebbinghaus, Sören Werth, 2004, Electron. Notes Discret. Math..

More Effective Crossover Operators for the All-Pairs Shortest Path Problem pdf

Frank Neumann, Benjamin Doerr, Daniel Johannsen, 2010, PPSN.

Computing single source shortest paths using single-objective fitness

Frank Neumann, Tobias Friedrich, Benjamin Doerr, 2009, FOGA '09.

The univariate marginal distribution algorithm copes well with deception and epistasis

Benjamin Doerr, Martin S. Krejca, 2020, GECCO Companion.

Black-box complexities of combinatorial problems

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2011, GECCO '11.

Fixed-target runtime analysis of the (1 + 1) EA with resampling

Benjamin Doerr, Arina Buzdalova, Maxim Buzdalov, 2019, GECCO.

Expressiveness and robustness of landscape features

Johann Dréo, Benjamin Doerr, Carola Doerr, 2019, GECCO.

Playing Mastermind With Many Colors

Benjamin Doerr, Carola Doerr, Reto Spöhel, 2012, SODA.

Tight Bounds for Quasirandom Rumor Spreading

Konstantinos Panagiotou, Anna Huber, Benjamin Doerr, 2009, Electron. J. Comb..

Asynchronous Rumor Spreading in Preferential Attachment Graphs

Mahmoud Fouz, Tobias Friedrich, Benjamin Doerr, 2012, SWAT.

The Interval Liar Game

David Steurer, Benjamin Doerr, Johannes Lengler, 2007, Electron. Notes Discret. Math..

Optimising Spatial and Tonal Data for PDE-based Inpainting pdf

Frank Neumann, Joachim Weickert, Laurent Hoeltgen, 2015, ArXiv.

A method to derive fixed budget results from expected optimisation times

Thomas Jansen, Christine Zarges, Benjamin Doerr, 2013, GECCO '13.

Linear And Hereditary Discrepancy

Benjamin Doerr, 2000, Comb. Probab. Comput..

Black-box complexity: from complexity theory to playing mastermind

Benjamin Doerr, Carola Doerr, Benjamin Doerr, 2013, GECCO.

Nonindependent Randomized Rounding and an Application to Digital Halftoning

Benjamin Doerr, 2004, SIAM J. Comput..

Deterministic random walks on regular trees pdf

Joshua N. Cooper, Joel H. Spencer, Tobias Friedrich, 2008, SODA '08.

Solving Problems with Unknown Solution Length at Almost No Extra Cost

Benjamin Doerr, Carola Doerr, Timo Kötzing, 2018, Algorithmica.

Why rumors spread so quickly in social networks

Mahmoud Fouz, Tobias Friedrich, Benjamin Doerr, 2012, Commun. ACM.

Multicolour Discrepancies

Anand Srivastav, Benjamin Doerr, 2003, Comb. Probab. Comput..

Non-independent Randomized Rounding and an Application to Digital Halftoning

Benjamin Doerr, Henning Schnieder, Benjamin Doerr, 2002, ESA.

The ($$1+\lambda $$1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate

Benjamin Doerr, Jing Yang, Carsten Witt, 2018, Algorithmica.

Sharp Bounds for Genetic Drift in EDAs pdf

Weijie Zheng, Benjamin Doerr, 2019, ArXiv.

On the runtime analysis of selection hyper-heuristics with adaptive learning periods

Pietro Simone Oliveto, Benjamin Doerr, Andrei Lissovoi, 2018, GECCO.

Generalized jump functions

Benjamin Doerr, Henry Bambury, Antoine Bultel, 2021, Annual Conference on Genetic and Evolutionary Computation.

Exploratory Landscape Analysis Feature Values for the 24 Noiseless BBOB Functions

Benjamin Doerr, Carola Doerr, Johann Dreo, 2021 .

Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift

Benjamin Doerr, Benjamin Doerr, 2020, Evolutionary Computation.

The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis

Benjamin Doerr, Martin S Krejca, 2021, Evolutionary Computation.

Precise Runtime Analysis for Plateau Functions

Benjamin Doerr, Denis Antipov, Benjamin Doerr, 2018, ACM Transactions on Evolutionary Learning and Optimization.

Exponential Upper Bounds for the Runtime of Randomized Search Heuristics

Benjamin Doerr, Benjamin Doerr, 2020, PPSN.

The Runtime of the Compact Genetic Algorithm on Jump Functions

Benjamin Doerr, Benjamin Doerr, 2019, Algorithmica.

Choosing the right algorithm with hints from complexity theory: (hot-off-the-press track at GECCO 2022) pdf

Benjamin Doerr, Shouda Wang, Weijie Zheng, 2021, IJCAI.

On Negative Dependence Properties of Latin Hypercube Samples and Scrambled Nets

Michael Gnewuch, Benjamin Doerr, Benjamin Doerr, 2021, Journal of Complexity.

The recovery of ridge functions on the hypercube suffers from the curse of dimensionality

Benjamin Doerr, Sebastian Mayer, 2021, J. Complex..

A first mathematical runtime analysis of the non-dominated sorting genetic algorithm II (NSGA-II): (hot-off-the-press track at GECCO 2022) pdf

Benjamin Doerr, Yufei Liu, Weijie Zheng, 2022, AAAI.

Self-Adjusting Mutation Rates with Provably Optimal Success Rules

Benjamin Doerr, Carola Doerr, Johannes Lengler, 2019, Algorithmica.

Multiplicative Up-Drift

Benjamin Doerr, Timo Kötzing, Benjamin Doerr, 2019, Algorithmica.

Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments

Benjamin Doerr, Benjamin Doerr, 2020, Inf. Process. Lett..

A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima

Benjamin Doerr, Riade Benbaki, Ziyad Benomar, 2021, GECCO.

A gentle introduction to theory (for non-theoreticians)

Benjamin Doerr, Benjamin Doerr, 2021, GECCO Companion.

Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution

Benjamin Doerr, Maxim Buzdalov, Denis Antipov, 2021, Annual Conference on Genetic and Evolutionary Computation.

Lower bounds from fitness levels made easy

Benjamin Doerr, Timo Kötzing, Benjamin Doerr, 2021, Annual Conference on Genetic and Evolutionary Computation.

Runtime analysis via symmetry arguments: (hot-off-the-press track at GECCO 2021)

Benjamin Doerr, Benjamin Doerr, 2021, GECCO Companion.

Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions pdf

Benjamin Doerr, Carola Doerr, Johann Dreo, 2021, EvoApplications.

An Extended Jump Function Benchmark for the Analysis of Randomized Search Heuristics pdf

Benjamin Doerr, Henry Bambury, Antoine Bultel, 2021, Algorithmica.

A Sharp Discrepancy Bound for Jittered Sampling pdf

Benjamin Doerr, 2021, ArXiv.

A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization

Frank Neumann, Benjamin Doerr, Benjamin Doerr, 2020, ACM Trans. Evol. Learn. Optim..

Probabilistic Lower Bounds for the Discrepancy of Latin Hypercube Samples

Michael Gnewuch, Benjamin Doerr, Carola Doerr, 2018 .

Balanced partitions of vector sequences

Benjamin Doerr, Imre B'ar'any, 2004 .

Discrepancy of Products of Hypergraphs

Stefan Felsner, Benjamin Doerr, Nils Hebbinghaus, 2005 .

Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples

Magnus Wahlström, Michael Gnewuch, Benjamin Doerr, 2009 .