#### Filter Results:

- Full text PDF available (144)

#### Publication Year

1974

2017

- This year (12)
- Last 5 years (82)
- Last 10 years (150)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Benjamin Doerr, Daniel Johannsen, Carola Doerr
- Algorithmica
- 2010

Drift analysis is one of the strongest tools in the analysis of evolutionary algorithms. Its main weakness is that it is often very hard to find a good drift function.
In this paper, we make progress in this direction. We prove a multiplicative version of the classical drift theorem. This allows easier analyses in those settings, where the optimization… (More)

In the standard consensus problem there are <i>n</i> processes with possibly different input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the <i>stabilizing consensus problem</i> [2]. In this problem, we do not require that… (More)

- Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
- Electronic Notes in Discrete Mathematics
- 2011

With the prevalence of social networks, it has become increasingly important to understand their features and limitations. It has been observed that information spreads extremely fast in social networks. We study the performance of randomized rumor spreading protocols on graphs in the preferential attachment model. The well-known random phone call model of… (More)

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

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

We conduct a rigorous analysis of the (1 + 1) evolutionary algorithm for the single source shortest path problem proposed by Scharnow, Tinnefeld and Wegener (Journal of Mathematical Modelling and Algorithms, 2004). We prove a tight bound of Θ(n max{log(n), l}) on the optimization time, where l is the maximum number of edges of a shortest path with minimum… (More)

- Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
- ACM Trans. Algorithms
- 2008

We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading").
In the classical model, in each round each informed node chooses a neighbor at random and informs it. Results of Frieze and Grimmett (Discrete Appl. Math. 1985) show that this simple protocol succeeds in… (More)

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

- Benjamin Doerr, Edda Happ, Christian Klein
- Theor. Comput. Sci.
- 2008

We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoretical analysis proving the usefulness of crossover for a non-artificial problem.

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

Successful applications of evolutionary algorithms show that certain variation operators can lead to good solutions much faster than other ones. We examine this behavior observed in practice from a theoretical point of view and investigate the effect of an asymmetric mutation operator in evolutionary algorithms with respect to the runtime behavior.… (More)

- Benjamin Doerr, Mahmoud Fouz, Carsten Witt
- GECCO
- 2010

Motivated by recent successful applications of the concept of quasirandomness, we investigate to what extent such ideas can be used in evolutionary computation. To this aim, we propose different variations of the classical (1+1) evolutionary algorithm, all imitating the property that the (1+1) EA over intervals of time touches all bits roughly the same… (More)