Benjamin Doerr

Benjamin Doerr's AcademicInfluence.com Rankings

Benjamin Doerr

Computer Science

#7351

World Rank

#7742

Historical Rank

Database

#4407

World Rank

#4583

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Benjamin Doerr's Degrees

PhD Computer Science Paderborn University
Masters Computer Science Paderborn University
Bachelors Computer Science Paderborn University

Similar Degrees You Can Earn

Why Is Benjamin Doerr Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Benjamin Doerr's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Why rumors spread so quickly in social networks (2012) (310)
Theory of Randomized Search Heuristics: Foundations and Recent Developments (2011) (301)
Multiplicative Drift Analysis (2010) (266)
From black-box complexity to designing new genetic algorithms (2015) (165)
Fast genetic algorithms (2017) (164)
Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem (2010) (146)
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics (2018) (145)
Crossover can provably be useful in evolutionary computation (2008) (145)
Social networks spread rumors in sublogarithmic time (2011) (138)
Theory of Evolutionary Computation: Recent Developments in Discrete Optimization (2020) (111)
Adaptive Drift Analysis (2010) (109)
Optimal Parameter Choices via Precise Black-Box Analysis (2016) (99)
Stabilizing consensus with the power of two choices (2011) (97)
Analyzing Randomized Search Heuristics: Tools from Probability Theory (2011) (88)
Quasirandom rumor spreading (2008) (78)
Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings (2015) (74)
Deterministic Random Walks on the Two-Dimensional Grid (2006) (72)
The (1+λ) evolutionary algorithm with self-adjusting mutation rate (2017) (71)
Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting (2011) (69)
Mutation Rate Matters Even When Optimizing Monotonic Functions (2013) (69)
Optimal Static and Self-Adjusting Parameter Choices for the $$(1+(\lambda ,\lambda ))$$(1+(λ,λ)) Genetic Algorithm (2017) (68)
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness (2009) (67)
Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices (2018) (66)
Sharp bounds by probability-generating functions and variable drift (2011) (66)
Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances (2015) (60)
Computing single source shortest paths using single-objective fitness (2009) (58)
Faster black-box algorithms through higher arity operators (2010) (58)
k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation (2016) (54)
On the runtime analysis of the 1-ANT ACO algorithm (2007) (54)
Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas (2017) (54)
On the runtime analysis of selection hyper-heuristics with adaptive learning periods (2018) (53)
Adjacency list matchings: an ideal genotype for cycle covers (2007) (53)
More Effective Crossover Operators for the All-Pairs Shortest Path Problem (2010) (52)
Lessons from the black-box: fast crossover-based genetic algorithms (2013) (52)
Ants easily solve stochastic shortest path problems (2012) (50)
Drift analysis and linear functions revisited (2010) (48)
Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators (2007) (48)
A method to derive fixed budget results from expected optimisation times (2013) (47)
Runtime Analysis for Self-adaptive Mutation Rates (2018) (46)
Drift Analysis with Tail Bounds (2010) (46)
Deterministic random walks on the integers (2006) (46)
Faster Evolutionary Algorithms by Superior Graph Representation (2007) (44)
Better Runtime Guarantees via Stochastic Domination (2018) (44)
Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem (2011) (43)
Quasirandom evolutionary algorithms (2010) (43)
Deterministic random walks on regular trees (2007) (43)
Does Comma Selection Help to Cope with Local Optima? (2020) (42)
Multicolour Discrepancies (2003) (42)
Playing Mastermind with Constant-Size Memory (2011) (41)
Bounds and constructions for the star-discrepancy via ?-covers (2005) (41)
Playing Mastermind With Many Colors (2012) (39)
Self-Adjusting Mutation Rates with Provably Optimal Success Rules (2019) (39)
The ($$1+\lambda $$1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate (2018) (39)
Asymptotically Optimal Randomized Rumor Spreading (2010) (38)
Analyzing randomized search heuristics via stochastic domination (2019) (38)
A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost (2019) (38)
Improved analysis methods for crossover-based algorithms (2009) (38)
Fast Mutation in Crossover-Based Algorithms (2020) (36)
The Runtime of the Compact Genetic Algorithm on Jump Functions (2019) (36)
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics (2014) (36)
Evolutionary algorithms and dynamic programming (2009) (35)
Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization (2015) (35)
Ranking-Based Black-Box Complexity (2011) (35)
Significance-Based Estimation-of-Distribution Algorithms (2018) (35)
A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax (2015) (34)
Refined runtime analysis of a basic ant colony optimization algorithm (2007) (34)
Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables (2018) (33)
Black-box complexities of combinatorial problems (2011) (33)
When do evolutionary algorithms optimize separable functions in parallel? (2013) (31)
Runtime Analysis of a Heavy-Tailed (1+(λ, λ)) Genetic Algorithm on Jump Functions (2020) (31)
Edge-based representation beats vertex-based representation in shortest path problems (2010) (31)
The (1 + (λ,λ)) GA is even faster on multimodal problems (2020) (31)
The Query Complexity of Finding a Hidden Permutation (2013) (31)
Runtime analysis of the 1-ANT ant colony optimizer (2011) (30)
A new analysis method for evolutionary optimization of dynamic and noisy objective functions (2018) (29)
Multiplicative Up-Drift (2019) (29)
Memory-Constrained Algorithms for Shortest Path Problem (2011) (28)
Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy (2020) (27)
An Elementary Analysis of the Probability That a Binomial Random Variable Exceeds Its Expectation (2017) (27)
Reducing the arity in unbiased black-box complexity (2012) (27)
A tight runtime analysis for the (μ + λ) EA (2018) (26)
Optimising Spatial and Tonal Data for PDE-based Inpainting (2015) (26)
Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm (2016) (26)
Asynchronous Rumor Spreading in Preferential Attachment Graphs (2012) (26)
A tight analysis of the (1 + 1)-EA for the single source shortest path problem (2007) (26)
Component-by-component construction of low-discrepancy point sets of small size (2008) (26)
Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators (2006) (25)
A lower bound for the discrepancy of a random point set (2012) (25)
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity (2011) (24)
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (2010) (23)
Working principles of binary differential evolution (2018) (23)
Strengthening participation through decentralisation: findings on local economic development in Kyrgyzstan (2006) (23)
A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones (2019) (23)
The efficiency threshold for the offspring population size of the (µ, λ) EA (2019) (22)
Generating Randomized Roundings with Cardinality Constraints and Derandomizations (2006) (22)
Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives: (hot-off-the-press track at GECCO 2021) (2020) (22)
Linear and Hereditary Discrepancy (2000) (22)
Tight Bounds for Quasirandom Rumor Spreading (2009) (22)
Bounding bloat in genetic programming (2017) (22)
Strong robustness of randomized rumor spreading protocols (2009) (22)
Discrepancy of Cartesian Products of Arithmetic Progressions (2004) (21)
A first mathematical runtime analysis of the non-dominated sorting genetic algorithm II (NSGA-II): (hot-off-the-press track at GECCO 2022) (2022) (21)
Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms (2020) (21)
Solving Problems with Unknown Solution Length at Almost No Extra Cost (2015) (21)
Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding (2008) (21)
GECCO 2007: Genetic and Evolutionary Computation Conference (2007) (21)
Comparing global and local mutations on bit strings (2008) (21)
How the (1+λ) evolutionary algorithm optimizes linear functions (2013) (20)
Health Risk Appraisal: Process, Problems, and Prospects for Nursing Practice and Research (1981) (20)
The Right Mutation Strength for Multi-Valued Decision Variables (2016) (20)
First Steps Towards a Runtime Analysis When Starting With a Good Solution (2020) (20)
Why Rumors Spread Fast in Social Networks (2012) (20)
Optimization of Chance-Constrained Submodular Functions (2019) (20)
Discrepancy of Symmetric Products of Hypergraphs (2006) (20)
Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution (2021) (20)
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas (2017) (20)
Experimental Analysis of Rumor Spreading in Social Networks (2012) (20)
When resampling to cope with noise, use median, not mean (2019) (20)
A First Runtime Analysis of the NSGA-II on a Multimodal Problem (2022) (19)
Theory of Evolutionary Computation (2011) (19)
Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax (2016) (19)
Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet (2012) (19)
Quasirandom rumor spreading: An experimental analysis (2009) (19)
Lattice approximation and linear discrepency of totally unimodular matrices (2001) (19)
Detecting structural breaks in time series via genetic algorithms (2017) (18)
Lower bounds for the runtime of a global multi-objective evolutionary algorithm (2013) (18)
Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes (2011) (18)
Expressiveness and robustness of landscape features (2019) (18)
Inserting Points Uniformly at Every Instance (2006) (17)
The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis (2020) (17)
Too fast unbiased black-box algorithms (2011) (17)
The unbiased black-box complexity of partition is polynomial (2014) (17)
Tight Analysis of Randomized Rumor Spreading in Complete Graphs (2014) (17)
A rigorous view on neutrality (2007) (16)
Generalized jump functions (2021) (16)
Precise Runtime Analysis for Plateaus (2018) (16)
Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables (2016) (16)
Monotonic functions in EC: anything but monotone! (2014) (15)
Quasirandom Rumor Spreading on Expanders (2009) (15)
Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations (2013) (15)
Directed trees: A powerful representation for sorting and ordering problems (2008) (15)
Optimizing Monotone Functions Can Be Difficult (2010) (15)
Fixed-Target Runtime Analysis (2020) (15)
Unbiased Black-Box Complexities of Jump Functions (2014) (15)
The Unrestricted Black-Box Complexity of Jump Functions (2016) (15)
A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima (2021) (15)
Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples (2009) (14)
Deterministic Random Walks (2006) (14)
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets (2011) (14)
A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem (2007) (14)
Memory-restricted black-box complexity of OneMax (2012) (14)
The Query Complexity of a Permutation-Based Variant of Mastermind (2018) (14)
From understanding genetic drift to a smart-restart parameter-less compact genetic algorithm (2020) (14)
Linear Discrepancy of Totally Unimodular Matrices*† (2004) (14)
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization (2020) (14)
Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation (2015) (13)
Unbiased black-box complexities of jump functions: how to cross large plateaus (2014) (13)
Lower bounds from fitness levels made easy (2021) (13)
Better approximation guarantees for the NSGA-II by using the current crowding distance (2022) (13)
Unknown solution length problems with no asymptotically optimal run time (2017) (13)
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}$$( (2017) (13)
Improved approximation algorithms for the Min-Max Selecting Items problem (2013) (12)
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions (2008) (12)
Randomized Rounding in the Presence of a Cardinality Constraint (2009) (12)
Choosing the right algorithm with hints from complexity theory: (hot-off-the-press track at GECCO 2022) (2021) (12)
Balanced partitions of vector sequences (2004) (12)
Nonindependent Randomized Rounding and an Application to Digital Halftoning (2005) (12)
BBOB: Nelder-Mead with resize and halfruns (2009) (12)
Unbiased Matrix Rounding (2006) (12)
Approximation of Multi-color Discrepancy (1999) (11)
Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift (2020) (11)
Fast re-optimization via structural diversity (2019) (11)
Island Models Meet Rumor Spreading (2017) (11)
Recursive Randomized Coloring Beats Fair Dice Random Colorings (2001) (11)
Stagnation Detection meets Fast Mutation (2022) (10)
Randomly Rounding Rationals with Cardinality Constraints and Derandomizations (2007) (10)
Evolving boolean functions with conjunctions and disjunctions via genetic programming (2019) (10)
Improved bounds and schemes for the declustering problem (2004) (10)
A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions (2020) (10)
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements (2010) (10)
On the minimum load coloring problem (2005) (10)
Randomized Rumor Spreading Revisited (2017) (9)
A Sharp Discrepancy Bound for Jittered Sampling (2021) (9)
Discrepancy in different numbers of colors (2002) (9)
Exponential Upper Bounds for the Runtime of Randomized Search Heuristics (2020) (9)
Bivariate estimation-of-distribution algorithms can find an exponential number of optima (2020) (9)
MULTI – COLOR DISCREPANCIES (2004) (9)
Probabilistic Lower Bounds for the Discrepancy of Latin Hypercube Samples (2017) (8)
A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading (2009) (8)
Roundings Respecting Hard Constraints (2005) (8)
Non-independent randomized rounding (2003) (8)
On the discrepancy of combinatorial rectangles (2002) (8)
Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions (2021) (8)
Genetic and Evolutionary Computation Conference 2008 : GECCO 2008 (2008) (7)
Non-existence of linear universal drift functions (2010) (7)
Precise Runtime Analysis for Plateau Functions (2018) (7)
Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem (2019) (7)
From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds (2022) (7)
The Efficiency Threshold for the Offspring Population Size of the ($\mu$, $\lambda$) EA (2019) (7)
A Tight Runtime Analysis of the $(1+(\lambda, \lambda))$ Genetic Algorithm on OneMax (2015) (7)
Cudahy high school survey and focus groups: assessment of the needs of a teen population. A community-campus collaboration. (2000) (7)
A Tight Runtime Analysis for the (μ+λ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(\mu + \lambda )}$$\end{documen (2020) (7)
Sharp Bounds for Genetic Drift in EDAs (2019) (6)
A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes (2020) (6)
Fixed-target runtime analysis of the (1 + 1) EA with resampling (2019) (6)
Simple and optimal randomized fault-tolerant rumor spreading (2012) (6)
Global roundings of sequences (2004) (6)
On the influence of pheromone updates in ACO algorithms (2007) (6)
Quasi-random rumor spreading: Reducing randomness can be costly (2010) (6)
Drift analysis (2011) (5)
The hereditary discrepancy is nearly independent of the number of colors (2004) (5)
Error Propagation in Game Trees (2006) (5)
Structured Randomized Rounding and Coloring (2001) (5)
Probabilistic Lower Discrepancy Bounds for Latin Hypercube Samples (2018) (5)
The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time (2020) (5)
Vector Balancing Games with Aging (2001) (5)
Online Checkpointing with Improved Worst-Case Guarantees (2013) (5)
The Price of Anarchy for Selfish Ring Routing is Two (2012) (5)
Balanced Coloring: Equally Easy for All Numbers of Colors? (2002) (5)
Black-box complexity: from complexity theory to playing mastermind (2014) (5)
Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives. (2020) (4)
Brief Announcement: Stabilizing Consensus with the Power of Two Choices (2010) (4)
Rounding of Sequences and Matrices, with Applications (2005) (4)
Optimal Parameter Settings for the $(1+(\lambda, \lambda))$ Genetic Algorithm (2016) (4)
The (1 + (λ, λ)) global SEMO algorithm (2022) (4)
Dependent Randomized Rounding: The Bipartite Case (2011) (4)
The recovery of ridge functions on the hypercube suffers from the curse of dimensionality (2019) (4)
Does Comma Selection Help to Cope with Local Optima? (2022) (3)
An Extended Jump Function Benchmark for the Analysis of Randomized Search Heuristics (2021) (3)
Beyond community assessment into the real world of learning aggregate practice. (1998) (3)
Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211) (2015) (3)
Fast Mutation in Crossover-Based Algorithms (2022) (3)
Linear Discrepancy of Basic Totally Unimodular Matrices (2000) (3)
Speeding up Evolutionary Algorithms by Restricted Mutation Operators (2006) (3)
Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ (2015) (3)
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III) (2022) (3)
Playing Mastermind with Constant-Size Memory (2012) (3)
Introducing Quasirandomness to Computer Science (2009) (3)
The First Mathematical Proof That Crossover Gives Super-Constant Performance Gains For the NSGA-II (2022) (3)
Memory-Restricted Black-Box Complexity (2011) (3)
Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem (2015) (3)
European tenure games (2004) (3)
Coloring t-dimensional m-Boxes (2001) (2)
Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042) (2013) (2)
Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments (2020) (2)
Unbiased Rounding of Rational Matrices (2006) (2)
Lasting Diversity and Superior Runtime Guarantees for the (μ+1) Genetic Algorithm (2023) (2)
Better runtime guarantees via stochastic domination (hot-off-the-press track at GECCO 2018) (2018) (2)
Towards a stronger theory for permutation-based evolutionary algorithms (2022) (2)
Fixed-Target Runtime Analysis (2021) (2)
The $(1 + (\lambda, \lambda))$ GA Is Even Faster on Multimodal Problems (2020) (2)
Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover (2022) (2)
Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271) (2013) (2)
Non-independent Randomized Rounding and an Application to Digital Halftoning (2002) (2)
GECCO ’14: Proceedings of the 2014 conference on Genetic and evolutionary computation (2014) (1)
Runtime Analysis for Self-adaptive Mutation Rates (2020) (1)
Matrix rounding and approximation (2004) (1)
Theory for non-theoreticians (2017) (1)
Hereditary Discrepancies in Different Numbers of Colors II (2006) (1)
On Negative Dependence Properties of Latin Hypercube Samples and Scrambled Nets (2021) (1)
Adaptive Drift Analysis (2011) (1)
Matrix approximation and Tusnády's problem (2007) (1)
Runtime Analysis for Permutation-based Evolutionary Algorithms (2022) (1)
Theory for Non-Theoreticians (2016) (1)
Solving Problems with Unknown Solution Length at Almost No Extra Cost (2018) (1)
Matrix rounding with low error in small submatrices (2005) (1)
Lp linear discrepancy of totally unimodular matrices (2007) (1)
How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs (2023) (1)
Matrix rounding with respect to small submatrices (2006) (1)
Artificial Immune Systems can Beat Evolutionary Algorithms in Combinatorial Optimisation (2016) (1)
How Well Does the Metropolis Algorithm Cope With Local Optima? (2023) (1)
A gentle introduction to theory (for non-theoreticians) (2020) (1)
The Deterministic and Randomized Query Complexity of a Simple Guessing Game (2012) (1)
An Improved Discrepancy Approach to Declustering (2004) (1)
Detecting structural breaks in time series via genetic algorithms (2016) (1)
How to Generate Randomized Roundings with Dependencies and How to Derandomize Them (2016) (1)
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Three or More Objectives (2022) (1)
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem (2016) (1)
Island Models Meet Rumor Spreading (2018) (1)
Multiplicative Drift Analysis (2012) (1)
Exploratory Landscape Analysis Feature Values for the 24 Noiseless BBOB Functions (2021) (1)
Runtime Analysis of a Heavy-Tailed $(1+(\lambda,\lambda))$ Genetic Algorithm on Jump Functions (2020) (1)
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics (2015) (1)
Collecting Coupons with Random Initial Stake (2013) (1)
Discrepancy of Products of Hypergraphs (2005) (1)
General Univariate Estimation-of-Distribution Algorithms (2022) (0)
A rigorous runtime analysis of the 2-MMAS ib on jump functions (2021) (0)
Mathematik in den Naturwissenschaften Leipzig Discrepancy of Symmetric Products of Hypergraphs (2006) (0)
Simple and optimal randomized fault-tolerant rumor spreading (2014) (0)
The (1+λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1+\lambda $$\end{document}) Evolutionary Algorithm with Self-A (2018) (0)
Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables (2017) (0)
Î Blockinøóö Èöøøøøóòòòò Ûûøø Ìñôóööð ×ô Blockinø× (2006) (0)
Quasirandomness in Graphs (2006) (0)
Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) (2021) (0)
Non-independent randomized rounding and coloring (2006) (0)
Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables (2023) (0)
Automated algorithm selection for radar network configuration (2022) (0)
Partial Colorings of Unimodular Hypergraphs (2007) (0)
Black-box complexity: from complexity theory to playing mastermind (2012) (0)
Tutorials at PPSN 2016 (2016) (0)
Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract (2001) (0)
Î Blockinøóö Ððò Blockin Blockinòò Ññ× Ûûøø Òò (2001) (0)
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem (2022) (0)
Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning (2006) (0)
Multi-Color Discrepancies - Extended Abstract - (2001) (0)
Ìýôô Blockin Blockinð Êóùòòòòò Èöóóððñ× (2006) (0)
Randomized Rumor Spreading Revisited (Long Version) (2023) (0)
Coloring Graphs with Minimal Edge Load (2004) (0)
In Memoriam: Ingo Wegener (2010) (0)
Session details: Track 15: theory (2009) (0)
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas (2016) (0)
ON THE DISCREPANCYOF COMBINATORIAL RECTANGLESNOGA (0)
C O ] 1 4 Fe b 20 06 Deterministic Random Walks on the Integers ∗ (2014) (0)
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives (2022) (0)
Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022) (2022) (0)
Black-box complexity: from complexity theory to playing mastermind (2013) (0)
Evolutionary algorithms for the detection of structural breaks in time series: extended abstract (2013) (0)
Guest Editorial: Theory of Evolutionary Computation (2016) (0)
Session details: Track 15: theory (2009) (0)
Posterior Inferior Cerebellar Infarct in a Younger Adult Male with Vertigo and Ataxia (2017) (0)
× Blockinööôôò Blockiný Ò ««ööòø Aeùñö× Óó Óðóö× (2006) (0)
Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182) (2022) (0)
Guest Editorial: Theory of Evolutionary Computation (2016) (0)
Estimation-of-Distribution Algorithms: Theory and Applications (2022) (0)
Åùðøø¹¹óðóö × Blockinööôôò Blockin Blockin Blockin× Üøøòòòò ×øöö Blockinø Òòòññò Óöö Òòòò Ëööú×øøú (0)
On the minimum load coloring problem : Extended abtract (2006) (0)
A gentle introduction to theory (for non-theoreticians) (2022) (0)
Controlled Randomized Rounding (2006) (0)
Antirandomizing the Wrong Game (2002) (0)
Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity (2012) (0)
Theory for non-theoreticians: introductory tutorial (2019) (0)
From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms (2022) (0)
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus (2023) (0)
1. Executive Summary (2000) (0)
The Interval Liar Game (2006) (0)
Runtime analysis via symmetry arguments: (hot-off-the-press track at GECCO 2021) (2021) (0)
Eliminating the "Robotic" Idea of an Unmotivated Student: How Ontario Junior Secondary School Science Teachers Foster Students' Self-Regulated Learning Skills (2017) (0)
INVITED PAPER Special Section on Invited Papers from New Horizons in Computing Inserting Points Uniformly at Every Instance (2006) (0)
Theory for non-theoreticians: tutorial (2018) (0)
Ranking-Based Black-Box Complexity (2012) (0)
Structured Randomized Rounding and Coloring Extended Abstract (2001) (0)
Ääøøø Ôôöóüüññøøóò Òò Ääòòòö × Blockinööôôò Blockiný Óó Ìóøøððý Íòòñóùððö Ååøöö Blockin Blockin× Üøøòòòò ×øöö Blockinø Òòòññò Óöö £ý (2001) (0)
A gentle introduction to theory (for non-theoreticians) (2021) (0)
Simple and Optimal Fault-Tolerant Rumor Spreading (2012) (0)
Expressiveness and robustness of landscape features (student workshop paper) (2020) (0)
Typical rounding problems (2002) (0)
Winkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions (2013) (0)
(1+1) Genetic Programming With Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error (2023) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Benjamin Doerr?

Benjamin Doerr is affiliated with the following schools:

Polytechnic Institute of Paris

Benjamin Doerr's Academic­Influence.com Rankings