Personal information

No personal information available

Activities

Collapse all

Works (31)

Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)

IEEE Transactions on Evolutionary Computation
2024 | Journal article
DOI: 10.1109/TEVC.2024.3402996
Contributors: Weijie Zheng; Benjamin Doerr
Source: check_circle
Crossref

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms

2024 | Book chapter
DOI: 10.1007/978-3-031-70085-9_10
Contributors: Simon Wietheger; Benjamin Doerr
Source: check_circle
Crossref

Proven Runtime Guarantees for How the MOEA/D: Computes the Pareto Front from the Subproblem Solutions

2024 | Book chapter
DOI: 10.1007/978-3-031-70071-2_13
Contributors: Benjamin Doerr; Martin S. Krejca; Noé Weeks
Source: check_circle
Crossref

The Runtime of Randomized Local Search on the Generalized Needle Problem

IEEE Transactions on Evolutionary Computation
2024 | Journal article
DOI: 10.1109/TEVC.2024.3453776
Contributors: Benjamin Doerr; Andrew Kelley
Source: check_circle
Crossref

Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency for Many Objectives

IEEE Transactions on Evolutionary Computation
2024-10 | Journal article
DOI: 10.1109/TEVC.2023.3320278
Contributors: Weijie Zheng; Benjamin Doerr
Source: check_circle
Crossref

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

ACM Transactions on Evolutionary Learning and Optimization
2024-07 | Journal article
DOI: 10.1145/3675783
Contributors: Denis Antipov; Maxim Buzdalov; Benjamin Doerr
Source: check_circle
Crossref

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis

2024-07-14 | Conference paper
DOI: 10.1145/3638529.3654169
Contributors: Benjamin Doerr; Joshua Knowles; Aneta Neumann; Frank Neumann
Source: check_circle
Crossref

A Gentle Introduction to Theory (for Non-Theoreticians)

2024-07-14 | Conference paper
DOI: 10.1145/3638530.3648402
Contributors: Benjamin Doerr
Source: check_circle
Crossref

A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III)

2024-07-14 | Conference paper
DOI: 10.1145/3638530.3664062
Contributors: Simon Wietheger; Benjamin Doerr
Source: check_circle
Crossref

Already Moderate Population Sizes Provably Yield Strong Robustness to Noise

2024-07-14 | Conference paper
DOI: 10.1145/3638529.3654196
Contributors: Denis Antipov; Benjamin Doerr; Alexandra Ivanova
Source: check_circle
Crossref

Hot off the Press: Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise

2024-07-14 | Conference paper
DOI: 10.1145/3638530.3664070
Contributors: Matthieu Dinot; Benjamin Doerr; Ulysse Hennebelle; Sebastian Will
Source: check_circle
Crossref

Hot off the Press: Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives

2024-07-14 | Conference paper
DOI: 10.1145/3638530.3664061
Contributors: Weijie Zheng; Benjamin Doerr
Source: check_circle
Crossref

Hot off the Press: Runtime Analysis of the SMS-EMOA for Many-Objective Optimization

2024-07-14 | Conference paper
DOI: 10.1145/3638530.3664064
Contributors: Weijie Zheng; Benjamin Doerr
Source: check_circle
Crossref

Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem

2024-07-14 | Conference paper
DOI: 10.1145/3638530.3664080
Contributors: Sacha Cerf; Benjamin Doerr; Benjamin Hebras; Yakob Kahane; Simon Wietheger
Source: check_circle
Crossref

How to Use the Metropolis Algorithm for Multi-Objective Optimization?

2024-07-14 | Conference paper
DOI: 10.1145/3638530.3664078
Contributors: Weijie Zheng; Mingfeng Li; Renzhong Deng; Benjamin Doerr
Source: check_circle
Crossref

Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations

2024-07-14 | Conference paper
DOI: 10.1145/3638530.3664065
Contributors: Benjamin Doerr; Aymen Echarghaoui; Mohammed Jamal; Martin S. Krejca
Source: check_circle
Crossref

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics

2024-07-14 | Conference paper
DOI: 10.1145/3638529.3654140
Contributors: Benjamin Doerr; Martin S. Krejca; Nguyen Vu
Source: check_circle
Crossref

An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics

Algorithmica
2024-01 | Journal article
DOI: 10.1007/s00453-022-00977-1
Contributors: Henry Bambury; Antoine Bultel; Benjamin Doerr
Source: check_circle
Crossref

A First Runtime Analysis of the NSGA-II on a Multimodal Problem

IEEE Transactions on Evolutionary Computation
2023 | Journal article
DOI: 10.1109/TEVC.2023.3250552
Contributors: Benjamin Doerr; Zhongdi Qu
Source: check_circle
Crossref

Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)

Artificial Intelligence
2023-12 | Journal article
DOI: 10.1016/j.artint.2023.104016
Contributors: Weijie Zheng; Benjamin Doerr
Source: check_circle
Crossref

Larger Offspring Populations Help the (1 + (λ, λ)) Genetic Algorithm to Overcome the Noise

2023-07-15 | Conference paper
DOI: 10.1145/3583131.3590514
Contributors: Alexandra Ivanova; Denis Antipov; Benjamin Doerr
Source: check_circle
Crossref

Does Comma Selection Help to Cope with Local Optima?

Algorithmica
2022-06 | Journal article
DOI: 10.1007/s00453-021-00896-7
Contributors: Benjamin Doerr
Source: check_circle
Crossref

The Runtime of the Compact Genetic Algorithm on Jump Functions

Algorithmica
2021-10-13 | Journal article
DOI: 10.1007/s00453-020-00780-w
Contributors: Benjamin Doerr
Source: check_circle
Crossref

Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms

IEEE Transactions on Evolutionary Computation
2020-12 | Journal article
DOI: 10.1109/TEVC.2020.2987361
Contributors: Benjamin Doerr; Weijie Zheng
Source: check_circle
Crossref

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

IEEE Transactions on Information Theory
2020-09 | Journal article
DOI: 10.1109/TIT.2020.2978385
Contributors: Benjamin Doerr; Marvin Kunnemann
Source: check_circle
Crossref

Analyzing randomized search heuristics via stochastic domination

Theoretical Computer Science
2019-06 | Journal article
DOI: 10.1016/j.tcs.2018.09.024
Contributors: Benjamin Doerr
Source: check_circle
Crossref

The query complexity of a permutation-based variant of Mastermind

Discrete Applied Mathematics
2019-05 | Journal article
DOI: 10.1016/j.dam.2019.01.007
Contributors: Peyman Afshani; Manindra Agrawal; Benjamin Doerr; Carola Doerr; Kasper Green Larsen; Kurt Mehlhorn
Source: check_circle
Crossref

An elementary analysis of the probability that a binomial random variable exceeds its expectation

Statistics & Probability Letters
2018-08 | Journal article
DOI: 10.1016/j.spl.2018.03.016
Contributors: Benjamin Doerr
Source: check_circle
Crossref

The unbiased black-box complexity of partition is polynomial

Artificial Intelligence
2014-11 | Journal article
DOI: 10.1016/j.artint.2014.07.009
Contributors: Benjamin Doerr; Carola Doerr; Timo Kötzing
Source: check_circle
Crossref

Deterministic Random Walks on the Integers

Discrete Mathematics & Theoretical Computer Science
2005-01-01 | Journal article
DOI: 10.46298/dmtcs.3436
Contributors: Joshua Cooper; Benjamin Doerr; Joel Spencer; Gábor Tardos
Source: check_circle
Crossref

Discrepancy of Products of Hypergraphs

Discrete Mathematics & Theoretical Computer Science
2005-01-01 | Journal article
DOI: 10.46298/dmtcs.3463
Contributors: Benjamin Doerr; Michael Gnewuch; Nils Hebbinghaus
Source: check_circle
Crossref
How many people are using ORCID?