Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark.

Benjamin Doerr École Polytechnique de Paris, Computer Science Laboratory (LIX), France Saarland University, Department of Computer Science, Saarbrücken, Germany Max Planck Institute for Informatics, Saarbrücken, Germany University of Kiel, Germany http://www.lix.polytechnique.fr/Labo/Benjamin.Doerr/ http://www.mpi-inf.mpg.de/~doerr/ https://scholar.google.com/citations?user=aXWFB2UdJUUC https://dl.acm.org/profile/81100319335 https://zbmath.org/authors/?q=ai:doerr.benjamin https://mathscinet.ams.org/mathscinet/MRAuthorID/667218 https://mathgenealogy.org/id.php?id=59124 https://orcid.org/0000-0002-9786-220X https://orcid.org/0000-0001-5283-4208 https://www.wikidata.org/entity/Q102233110 https://www.wikidata.org/entity/Q130906131 https://www.wikidata.org/entity/Q130909026

Marcel Chwialkowski Benjamin Doerr Martin S. Krejca Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark. 2026 February 311-320 30 IEEE Trans. Evol. Comput. 1 https://doi.org/10.1109/TEVC.2025.3549929 db/journals/tec/tec30.html#ChwialkowskiDK26 streams/journals/tec

Benjamin Doerr Martin S. Krejca Milan Stankovic Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer. 36855-36863 2026 AAAI https://doi.org/10.1609/aaai.v40i43.41012 conf/aaai/2026 db/conf/aaai/aaai2026.html#DoerrKS26 Danyang Zhang Zerong Zhong Weijie Zheng 0001 Benjamin Doerr Superior Runtime Guarantees for the MOEA/D Multi-Objective Optimizer via Weighted-Sum Decomposition. 37187-37194 2026 AAAI https://doi.org/10.1609/aaai.v40i43.41049 conf/aaai/2026 db/conf/aaai/aaai2026.html#ZhangZZD26

Niklas Kormann Benjamin Doerr Johannes F. Lutzeyer Position: Don't be Afraid of Over-Smoothing And Over-Squashing. 2026 January abs/2601.07419 CoRR https://doi.org/10.48550/arXiv.2601.07419 db/journals/corr/corr2601.html#abs-2601-07419 streams/journals/corr

Weijie Zheng 0001 Benjamin Doerr Approximation Guarantees for the Nondominated Sorting Genetic Algorithm II (NSGA-II). 891-905 2025 August 29 IEEE Trans. Evol. Comput. 4 https://doi.org/10.1109/TEVC.2024.3402996 db/journals/tec/tec29.html#ZhengD25 streams/journals/tec

Benjamin Doerr Andrew James Kelley The Runtime of Randomized Local Search on the generalized Needle problem. 1864-1872 2025 October 29 IEEE Trans. Evol. Comput. 5 https://doi.org/10.1109/TEVC.2024.3453776 db/journals/tec/tec29.html#DoerrK25 streams/journals/tec

Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr First Steps Toward a Runtime Analysis When Starting With a Good Solution. 14:1-14:41 2025 June 5 ACM Trans. Evol. Learn. Optim. 2 https://doi.org/10.1145/3675783 db/journals/telo/telo5.html#AntipovBD25 streams/journals/telo

Benjamin Doerr Martin S. Krejca Günter Rudolph Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces. 26955-26963 2025 AAAI https://doi.org/10.1609/aaai.v39i25.34901 conf/aaai/2025 db/conf/aaai/aaai2025.html#DoerrKR25 Benjamin Doerr Tudor Ivan Martin S. Krejca Speeding Up the NSGA-II with a Simple Tie-Breaking Rule. 26964-26972 2025 AAAI https://doi.org/10.1609/aaai.v39i25.34902 conf/aaai/2025 db/conf/aaai/aaai2025.html#DoerrIK25 Benjamin Doerr Andrei Lissovoi Pietro S. Oliveto (1+1) Genetic Programming with Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error. 28740 2025 AAAI https://doi.org/10.1609/aaai.v39i27.35131 conf/aaai/2025 db/conf/aaai/aaai2025.html#DoerrLO25 Weijie Zheng 0001 Benjamin Doerr From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms (Journal Track). 28746- 2025 AAAI https://doi.org/10.1609/aaai.v39i27.35137 conf/aaai/2025 db/conf/aaai/aaai2025.html#0001D25a Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr Hot off the Press: First Steps Towards a Runtime Analysis When Starting With a Good Solution. 11-12 2025 GECCO Companion https://doi.org/10.1145/3712255.3734241 conf/gecco/2025c db/conf/gecco/gecco2025c.html#Antipov0D25 Marcel Chwialkowski Benjamin Doerr Martin S. Krejca Hot off the Press: Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark. 15-16 2025 GECCO Companion https://doi.org/10.1145/3712255.3734224 conf/gecco/2025c db/conf/gecco/gecco2025c.html#ChwialkowskiDK25 Renzhong Deng Weijie Zheng 0001 Mingfeng Li Jie Liu Benjamin Doerr Hot off the Press: Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem. 17-18 2025 GECCO Companion https://doi.org/10.1145/3712255.3734252 conf/gecco/2025c db/conf/gecco/gecco2025c.html#Deng0LLD25 Benjamin Doerr Martin S. Krejca Noé Weeks Hot off the Press: Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions. 21-22 2025 GECCO Companion https://doi.org/10.1145/3712255.3734228 conf/gecco/2025c db/conf/gecco/gecco2025c.html#DoerrKW25 Benjamin Doerr Martin S. Krejca Günter Rudolph Hot off the Press: Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces. 23-24 2025 GECCO Companion https://doi.org/10.1145/3712255.3734225 conf/gecco/2025c db/conf/gecco/gecco2025c.html#DoerrKR25 Benjamin Doerr Tudor Ivan Martin S. Krejca Hot off the Press: Speeding Up the NSGA-II With a Simple Tie-Breaking Rule. 25-26 2025 GECCO Companion https://doi.org/10.1145/3712255.3734229 conf/gecco/2025c db/conf/gecco/gecco2025c.html#DoerrIK25 Simon Wietheger Benjamin Doerr Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. 85-86 2025 GECCO Companion https://doi.org/10.1145/3712255.3734251 conf/gecco/2025c db/conf/gecco/gecco2025c.html#WiethegerD25 Benjamin Doerr Tutorial: A Gentle Introduction to Theory (for Non-Theoreticians). 1042-1069 2025 GECCO Companion https://doi.org/10.1145/3712255.3716526 conf/gecco/2025c db/conf/gecco/gecco2025c.html#Doerr25 Yasser Alghouass Benjamin Doerr Martin S. Krejca Mohammed Lagmah Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II. 8833-8841 2025 IJCAI https://doi.org/10.24963/ijcai.2025/982 conf/ijcai/2025 db/conf/ijcai/ijcai2025.html#AlghouassDKL25 Denis Antipov Benjamin Doerr Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It. 8842-8849 2025 IJCAI https://doi.org/10.24963/ijcai.2025/983 conf/ijcai/2025 db/conf/ijcai/ijcai2025.html#AntipovD25 Abderrahim Bendahi Benjamin Doerr Adrien Fradin Johannes F. Lutzeyer Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator. 8850-8857 2025 IJCAI https://doi.org/10.24963/ijcai.2025/984 conf/ijcai/2025 db/conf/ijcai/ijcai2025.html#BendahiDFL25 Renzhong Deng Weijie Zheng 0001 Benjamin Doerr The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III). 8867-8875 2025 IJCAI https://doi.org/10.24963/ijcai.2025/986 conf/ijcai/2025 db/conf/ijcai/ijcai2025.html#Deng0D25 Benjamin Doerr Martin S. Krejca Andre Opris Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm. 8876-8884 2025 IJCAI https://doi.org/10.24963/ijcai.2025/987 conf/ijcai/2025 db/conf/ijcai/ijcai2025.html#DoerrKO25 Mingfeng Li Weijie Zheng 0001 Benjamin Doerr Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy. 8885-8893 2025 IJCAI https://doi.org/10.24963/ijcai.2025/988 conf/ijcai/2025 db/conf/ijcai/ijcai2025.html#Li0D25

Marcel Chwialkowski Benjamin Doerr Martin S. Krejca Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark. 2025 January abs/2501.16250 CoRR https://doi.org/10.48550/arXiv.2501.16250 db/journals/corr/corr2501.html#abs-2501-16250 streams/journals/corr

Renzhong Deng Weijie Zheng 0001 Benjamin Doerr The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III). 2025 April abs/2504.21552 CoRR https://doi.org/10.48550/arXiv.2504.21552 db/journals/corr/corr2504.html#abs-2504-21552 streams/journals/corr

Benjamin Doerr Martin S. Krejca Andre Opris Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm. 2025 May abs/2505.01266 CoRR https://doi.org/10.48550/arXiv.2505.01266 db/journals/corr/corr2505.html#abs-2505-01266 streams/journals/corr

Yasser Alghouass Benjamin Doerr Martin S. Krejca Mohammed Lagmah Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II. 2025 May abs/2505.01323 CoRR https://doi.org/10.48550/arXiv.2505.01323 db/journals/corr/corr2505.html#abs-2505-01323 streams/journals/corr

Mingfeng Li Weijie Zheng 0001 Benjamin Doerr Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy. 2025 May abs/2505.01647 CoRR https://doi.org/10.48550/arXiv.2505.01647 db/journals/corr/corr2505.html#abs-2505-01647 streams/journals/corr

Abderrahim Bendahi Benjamin Doerr Adrien Fradin Johannes F. Lutzeyer Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator. 2025 June abs/2506.01107 CoRR https://doi.org/10.48550/arXiv.2506.01107 db/journals/corr/corr2506.html#abs-2506-01107 streams/journals/corr

Niklas Kormann Masoud Ramuz Zeeshan Nisar Nadine S. Schaadt Hendrik Annuth Benjamin Doerr Friedrich Feuerhake Thomas Andrew Lampert Johannes F. Lutzeyer HIEGNet: A Heterogenous Graph Neural Network Including the Immune Environment in Glomeruli Classification. 2025 June abs/2506.02542 CoRR https://doi.org/10.48550/arXiv.2506.02542 db/journals/corr/corr2506.html#abs-2506-02542 streams/journals/corr

Benjamin Doerr Martin S. Krejca Simon Wietheger Speeding Up the NSGA-II via Dynamic Population Sizes. 2025 September abs/2509.01739 CoRR https://doi.org/10.48550/arXiv.2509.01739 db/journals/corr/corr2509.html#abs-2509-01739 streams/journals/corr

Benjamin Doerr Martin S. Krejca Milan Stankovic Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer. 2025 November abs/2511.07150 CoRR https://doi.org/10.48550/arXiv.2511.07150 db/journals/corr/corr2511.html#abs-2511-07150 streams/journals/corr

Josu Ceberio Uribe Benjamin Doerr John A. W. McCall Carsten Witt Marcus Schmidbauer Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 25092). 158-183 2025 February 15 Dagstuhl Reports 2 https://doi.org/10.4230/DagRep.15.2.158 db/journals/dagstuhl-reports/dagstuhl-reports15.html#UribeDMWS25 streams/journals/dagstuhl-reports

Henry Bambury Antoine Bultel Benjamin Doerr An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics. 1-32 2024 January 86 Algorithmica 1 https://doi.org/10.1007/s00453-022-00977-1 https://www.wikidata.org/entity/Q114229328 db/journals/algorithmica/algorithmica86.html#BamburyBD24

Benjamin Doerr Amirhossein Rajabi Carsten Witt Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. 64-89 2024 January 86 Algorithmica 1 https://doi.org/10.1007/s00453-023-01135-x db/journals/algorithmica/algorithmica86.html#DoerrRW24

Benjamin Doerr Yassine Ghannane Marouane Ibn Brahim Runtime Analysis for Permutation-based Evolutionary Algorithms. 90-129 2024 January 86 Algorithmica 1 https://doi.org/10.1007/s00453-023-01146-8 db/journals/algorithmica/algorithmica86.html#DoerrGB24

Benjamin Doerr Timo Kötzing Lower Bounds from Fitness Levels Made Easy. 367-395 2024 February 86 Algorithmica 2 https://doi.org/10.1007/s00453-022-00952-w db/journals/algorithmica/algorithmica86.html#DoerrK24

Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution. 442-484 2024 February 86 Algorithmica 2 https://doi.org/10.1007/s00453-023-01098-z db/journals/algorithmica/algorithmica86.html#AntipovBD24

Benjamin Doerr Andrew James Kelley Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. 2479-2518 2024 August 86 Algorithmica 8 https://doi.org/10.1007/s00453-024-01232-5 db/journals/algorithmica/algorithmica86.html#DoerrK24a streams/journals/algorithmica

Shouda Wang Weijie Zheng 0001 Benjamin Doerr Choosing the right algorithm with hints from complexity theory. 105125 2024 January 296 Inf. Comput. https://doi.org/10.1016/j.ic.2023.105125 db/journals/iandc/iandc296.html#WangZD24

Firas Ben Jedidia Benjamin Doerr Martin S. Krejca Estimation-of-distribution algorithms for multi-valued decision variables. 114622 2024 1003 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2024.114622 db/journals/tcs/tcs1003.html#JedidiaDK24

Weijie Zheng 0001 Benjamin Doerr Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency for Many Objectives. 1442-1454 2024 October 28 IEEE Trans. Evol. Comput. 5 https://doi.org/10.1109/TEVC.2023.3320278 db/journals/tec/tec28.html#ZhengD24 streams/journals/tec

Benjamin Doerr Aymen Echarghaoui Mohammed Jamal Martin S. Krejca Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations. 20683-20691 2024 AAAI https://doi.org/10.1609/aaai.v38i18.30055 conf/aaai/2024 db/conf/aaai/aaai2024.html#DoerrEJK24 Weijie Zheng 0001 Benjamin Doerr Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. 20874-20882 2024 AAAI https://doi.org/10.1609/aaai.v38i18.30077 conf/aaai/2024 db/conf/aaai/aaai2024.html#0001D24 Weijie Zheng 0001 Mingfeng Li Renzhong Deng Benjamin Doerr How to Use the Metropolis Algorithm for Multi-Objective Optimization? 20883-20891 2024 AAAI https://doi.org/10.1609/aaai.v38i18.30078 conf/aaai/2024 db/conf/aaai/aaai2024.html#0001LDD24 Denis Antipov Benjamin Doerr Alexandra Ivanova Already Moderate Population Sizes Provably Yield Strong Robustness to Noise. 2024 GECCO https://doi.org/10.1145/3638529.3654196 conf/gecco/2024 db/conf/gecco/gecco2024.html#AntipovDI24 Sacha Cerf Benjamin Doerr Benjamin Hebras Yakob Kahane Simon Wietheger 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 GECCO Companion https://doi.org/10.1145/3638530.3664080 https://www.wikidata.org/entity/Q130923580 conf/gecco/2024c db/conf/gecco/gecco2024c.html#CerfDHKW24 27-28 Matthieu Dinot Benjamin Doerr Ulysse Hennebelle Sebastian Will Hot off the Press: Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. 2024 GECCO Companion https://doi.org/10.1145/3638530.3664070 conf/gecco/2024c db/conf/gecco/gecco2024c.html#DinotDHW24 33-34 Benjamin Doerr Aymen Echarghaoui Mohammed Jamal Martin S. Krejca Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations. 2024 GECCO Companion https://doi.org/10.1145/3638530.3664065 conf/gecco/2024c db/conf/gecco/gecco2024c.html#DoerrEJK24 35-36 Benjamin Doerr Joshua D. Knowles Aneta Neumann Frank Neumann 0001 A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. 2024 GECCO https://doi.org/10.1145/3638529.3654169 https://www.wikidata.org/entity/Q130908887 conf/gecco/2024 db/conf/gecco/gecco2024.html#DoerrKN024 Simon Wietheger Benjamin Doerr A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). 2024 GECCO Companion https://doi.org/10.1145/3638530.3664062 https://www.wikidata.org/entity/Q130911175 conf/gecco/2024c db/conf/gecco/gecco2024c.html#WiethegerD24 63-64 Weijie Zheng 0001 Benjamin Doerr Hot off the Press: Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives. 2024 GECCO Companion https://doi.org/10.1145/3638530.3664061 conf/gecco/2024c db/conf/gecco/gecco2024c.html#0001D24 67-68 Weijie Zheng 0001 Benjamin Doerr Hot off the Press: Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. 2024 GECCO Companion https://doi.org/10.1145/3638530.3664064 conf/gecco/2024c db/conf/gecco/gecco2024c.html#0001D24a 69-70 Weijie Zheng 0001 Mingfeng Li Renzhong Deng Benjamin Doerr How to Use the Metropolis Algorithm for Multi-Objective Optimization? 2024 GECCO Companion https://doi.org/10.1145/3638530.3664078 https://www.wikidata.org/entity/Q130906132 conf/gecco/2024c db/conf/gecco/gecco2024c.html#0001LDD24 71-72 Benjamin Doerr A Gentle Introduction to Theory (for Non-Theoreticians). 2024 GECCO Companion https://doi.org/10.1145/3638530.3648402 conf/gecco/2024c db/conf/gecco/gecco2024c.html#Doerr24 800-829 Benjamin Doerr Martin S. Krejca Nguyen Vu Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics. 2024 GECCO https://doi.org/10.1145/3638529.3654140 conf/gecco/2024 db/conf/gecco/gecco2024.html#DoerrKV24 Simon Wietheger Benjamin Doerr Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. 153-168 2024 PPSN (4) https://doi.org/10.1007/978-3-031-70085-9_10 conf/ppsn/2024-4 db/conf/ppsn/ppsn2024-4.html#WiethegerD24 streams/conf/ppsn Benjamin Doerr Martin S. Krejca Noé Weeks Proven Runtime Guarantees for How the MOEA/D: Computes the Pareto Front from the Subproblem Solutions. 197-212 2024 PPSN (3) https://doi.org/10.1007/978-3-031-70071-2_13 conf/ppsn/2024-3 db/conf/ppsn/ppsn2024-3.html#DoerrKW24 streams/conf/ppsn Renzhong Deng Weijie Zheng 0001 Mingfeng Li Jie Liu Benjamin Doerr Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem. 264-279 2024 PPSN (3) https://doi.org/10.1007/978-3-031-70071-2_17 conf/ppsn/2024-3 db/conf/ppsn/ppsn2024-3.html#DengZLLD24 streams/conf/ppsn Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr Code and data for "First Steps Towards a Runtime Analysis When Starting With a Good Solution". 2024 June https://doi.org/10.5281/zenodo.11622895 Zenodo streams/repo/zenodo Benjamin Doerr Tudor Ivan Martin S. Krejca Speeding Up the NSGA-II With a Simple Tie-Breaking Rule (Code). 2024 December https://doi.org/10.5281/zenodo.14501034 Zenodo streams/repo/zenodo Benjamin Doerr Martin S. Krejca Günter Rudolph Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces (Code). 2024 December https://doi.org/10.5281/zenodo.14506854 Zenodo streams/repo/zenodo

Benjamin Doerr Andrew James Kelley The Runtime of Random Local Search on the Generalized Needle Problem. 2024 abs/2403.08153 CoRR https://doi.org/10.48550/arXiv.2403.08153 db/journals/corr/corr2403.html#abs-2403-08153

Denis Antipov Benjamin Doerr Alexandra Ivanova Already Moderate Population Sizes Provably Yield Strong Robustness to Noise. 2024 abs/2404.02090 CoRR https://doi.org/10.48550/arXiv.2404.02090 db/journals/corr/corr2404.html#abs-2404-02090

Benjamin Doerr Joshua D. Knowles Aneta Neumann Frank Neumann 0001 A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. 2024 abs/2404.03838 CoRR https://doi.org/10.48550/arXiv.2404.03838 db/journals/corr/corr2404.html#abs-2404-03838

Benjamin Doerr Martin S. Krejca Nguyen Vu Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics. 2024 abs/2404.04018 CoRR https://doi.org/10.48550/arXiv.2404.04018 db/journals/corr/corr2404.html#abs-2404-04018

Simon Wietheger Benjamin Doerr Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. 2024 abs/2404.12746 CoRR https://doi.org/10.48550/arXiv.2404.12746 db/journals/corr/corr2404.html#abs-2404-12746

Benjamin Doerr Martin S. Krejca Noé Weeks Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions. 2024 abs/2405.01014 CoRR https://doi.org/10.48550/arXiv.2405.01014 db/journals/corr/corr2405.html#abs-2405-01014

Benjamin Doerr Johannes F. Lutzeyer Hyper-Heuristics Can Profit From Global Variation Operators. 2024 abs/2407.14237 CoRR https://doi.org/10.48550/arXiv.2407.14237 db/journals/corr/corr2407.html#abs-2407-14237 streams/journals/corr

Weijie Zheng 0001 Benjamin Doerr Overcome the Difficulties of NSGA-II via Truthful Crowding Distance with Theoretical Guarantees. 2024 abs/2407.17687 CoRR https://doi.org/10.48550/arXiv.2407.17687 db/journals/corr/corr2407.html#abs-2407-17687 streams/journals/corr

Denis Antipov Benjamin Doerr Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It. 2024 abs/2409.00306 CoRR https://doi.org/10.48550/arXiv.2409.00306 db/journals/corr/corr2409.html#abs-2409-00306 streams/journals/corr

Benjamin Doerr Dimitri Korkotashvili Martin S. Krejca Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem. 2024 abs/2411.10017 CoRR https://doi.org/10.48550/arXiv.2411.10017 db/journals/corr/corr2411.html#abs-2411-10017 streams/journals/corr

Benjamin Doerr Martin S. Krejca Günter Rudolph Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces. 2024 abs/2412.11684 CoRR https://doi.org/10.48550/arXiv.2412.11684 db/journals/corr/corr2412.html#abs-2412-11684 streams/journals/corr

Benjamin Doerr Tudor Ivan Martin S. Krejca Speeding Up the NSGA-II With a Simple Tie-Breaking Rule. 2024 abs/2412.11931 CoRR https://doi.org/10.48550/arXiv.2412.11931 db/journals/corr/corr2412.html#abs-2412-11931 streams/journals/corr

Benjamin Doerr Andrei Lissovoi Pietro S. Oliveto (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error. 103906 2023 June 319 Artif. Intell. https://doi.org/10.1016/j.artint.2023.103906 db/journals/ai/ai319.html#DoerrLO23

Weijie Zheng 0001 Benjamin Doerr Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II). 104016 2023 December 325 Artif. Intell. https://doi.org/10.1016/j.artint.2023.104016 db/journals/ai/ai325.html#ZhengD23

Weijie Zheng 0001 Benjamin Doerr Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives. 337-373 2023 Winter 31 Evol. Comput. 4 https://doi.org/10.1162/evco_a_00328 db/journals/ec/ec31.html#ZhengD23

Weijie Zheng 0001 Benjamin Doerr From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms. 292:1-292:40 2023 24 J. Mach. Learn. Res. http://jmlr.org/papers/v24/22-0628.html db/journals/jmlr/jmlr24.html#0001D23

Benjamin Doerr Amirhossein Rajabi Stagnation detection meets fast mutation. 113670 2023 February 946 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2022.12.020 db/journals/tcs/tcs946.html#DoerrR23

Benjamin Doerr Martin S. Krejca Bivariate estimation-of-distribution algorithms can find an exponential number of optima. 114074 2023 September 971 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2023.114074 db/journals/tcs/tcs971.html#DoerrK23

Benjamin Doerr Zhongdi Qu A First Runtime Analysis of the NSGA-II on a Multimodal Problem. 1288-1297 2023 October 27 IEEE Trans. Evol. Comput. 5 https://doi.org/10.1109/TEVC.2023.3250552 db/journals/tec/tec27.html#DoerrQ23

Benjamin Doerr Zhongdi Qu Runtime Analysis for the NSGA-II: Provable Speed-Ups from Crossover. 12399-12407 2023 AAAI https://doi.org/10.1609/aaai.v37i10.26461 conf/aaai/2023 db/conf/aaai/aaai2023.html#DoerrQ23 Benjamin Doerr Zhongdi Qu From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. 12408-12416 2023 AAAI https://doi.org/10.1609/aaai.v37i10.26462 conf/aaai/2023 db/conf/aaai/aaai2023.html#DoerrQ23a Benjamin Doerr Zhongdi Qu Hot off the Press: A First Runtime Analysis of the NSGA-II on a Multimodal Problem. 15-16 2023 GECCO Companion https://doi.org/10.1145/3583133.3595839 conf/gecco/2023c db/conf/gecco/gecco2023c.html#DoerrQ23 Benjamin Doerr Zhongdi Qu Hot off the Press: From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. 17-18 2023 GECCO Companion https://doi.org/10.1145/3583133.3595840 conf/gecco/2023c db/conf/gecco/gecco2023c.html#DoerrQ23a Benjamin Doerr Zhongdi Qu Hot off the Press: Runtime Analysis for the NSGA-II - Provable Speed-Ups From Crossover. 19-20 2023 GECCO Companion https://doi.org/10.1145/3583133.3595845 conf/gecco/2023c db/conf/gecco/gecco2023c.html#DoerrQ23b Firas Ben Jedidia Benjamin Doerr Martin S. Krejca Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables. 230-238 2023 GECCO https://doi.org/10.1145/3583131.3590523 conf/gecco/2023 db/conf/gecco/gecco2023.html#JedidiaDK23 Alexandra Ivanova Denis Antipov Benjamin Doerr Larger Offspring Populations Help the (1 + (λ, λlambda)) Genetic Algorithm to Overcome the Noise. 919-928 2023 GECCO https://doi.org/10.1145/3583131.3590514 https://www.wikidata.org/entity/Q130924476 conf/gecco/2023 db/conf/gecco/gecco2023.html#IvanovaAD23 Benjamin Doerr A Gentle Introduction to Theory (for Non-Theoreticians). 946-975 2023 GECCO Companion https://doi.org/10.1145/3583133.3595042 conf/gecco/2023c db/conf/gecco/gecco2023c.html#Doerr23 Benjamin Doerr Arthur Dremaux Johannes F. Lutzeyer Aurélien Stumpf How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs. 990-999 2023 GECCO https://doi.org/10.1145/3583131.3590509 conf/gecco/2023 db/conf/gecco/gecco2023.html#DoerrDLS23 Benjamin Doerr Taha El Ghazi El Houssaini Amirhossein Rajabi Carsten Witt How Well Does the Metropolis Algorithm Cope With Local Optima? 1000-1008 2023 GECCO https://doi.org/10.1145/3583131.3590390 https://www.wikidata.org/entity/Q130909029 conf/gecco/2023 db/conf/gecco/gecco2023.html#DoerrHRW23 Benjamin Doerr Andrew James Kelley Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. 1555-1564 2023 GECCO https://doi.org/10.1145/3583131.3590393 conf/gecco/2023 db/conf/gecco/gecco2023.html#DoerrK23 Sacha Cerf Benjamin Doerr Benjamin Hebras Yakob Kahane Simon Wietheger The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. 5522-5530 2023 IJCAI https://doi.org/10.24963/ijcai.2023/613 conf/ijcai/2023 db/conf/ijcai/ijcai2023.html#CerfDHKW23 Matthieu Dinot Benjamin Doerr Ulysse Hennebelle Sebastian Will Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. 5549-5557 2023 IJCAI https://doi.org/10.24963/ijcai.2023/616 conf/ijcai/2023 db/conf/ijcai/ijcai2023.html#DinotDHW23 Simon Wietheger Benjamin Doerr A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). 5657-5665 2023 IJCAI https://doi.org/10.24963/ijcai.2023/628 conf/ijcai/2023 db/conf/ijcai/ijcai2023.html#WiethegerD23

Benjamin Doerr Andrew James Kelley Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus. 2023 abs/2302.08021 CoRR https://doi.org/10.48550/arXiv.2302.08021 db/journals/corr/corr2302.html#abs-2302-08021

Benjamin Doerr Aymen Echarghaoui Mohammed Jamal Martin S. Krejca Lasting Diversity and Superior Runtime Guarantees for the (μ+1) Genetic Algorithm. 2023 abs/2302.12570 CoRR https://doi.org/10.48550/arXiv.2302.12570 db/journals/corr/corr2302.html#abs-2302-12570

Firas Ben Jedidia Benjamin Doerr Martin S. Krejca Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables. 2023 abs/2302.14420 CoRR https://doi.org/10.48550/arXiv.2302.14420 db/journals/corr/corr2302.html#abs-2302-14420

Benjamin Doerr Andrei Lissovoi Pietro S. Oliveto (1+1) Genetic Programming With Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error. 2023 abs/2303.07455 CoRR https://doi.org/10.48550/arXiv.2303.07455 db/journals/corr/corr2303.html#abs-2303-07455

Benjamin Doerr Anatolii Kostrygin Randomized Rumor Spreading Revisited (Long Version). 2023 abs/2303.11150 CoRR https://doi.org/10.48550/arXiv.2303.11150 db/journals/corr/corr2303.html#abs-2303-11150

Benjamin Doerr Arthur Dremaux Johannes F. Lutzeyer Aurélien Stumpf How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs. 2023 abs/2304.10414 CoRR https://doi.org/10.48550/arXiv.2304.10414 db/journals/corr/corr2304.html#abs-2304-10414

Benjamin Doerr Taha El Ghazi El Houssaini Amirhossein Rajabi Carsten Witt How Well Does the Metropolis Algorithm Cope With Local Optima? 2023 abs/2304.10848 CoRR https://doi.org/10.48550/arXiv.2304.10848 db/journals/corr/corr2304.html#abs-2304-10848

Alexandra Ivanova Denis Antipov Benjamin Doerr Larger Offspring Populations Help the (1 + (λ, λ)) Genetic Algorithm to Overcome the Noise. 2023 abs/2305.04553 CoRR https://doi.org/10.48550/arXiv.2305.04553 db/journals/corr/corr2305.html#abs-2305-04553

Matthieu Dinot Benjamin Doerr Ulysse Hennebelle Sebastian Will Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise. 2023 abs/2305.10259 CoRR https://doi.org/10.48550/arXiv.2305.10259 db/journals/corr/corr2305.html#abs-2305-10259

Sacha Cerf Benjamin Doerr Benjamin Hebras Yakob Kahane Simon Wietheger The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. 2023 abs/2305.13459 CoRR https://doi.org/10.48550/arXiv.2305.13459 db/journals/corr/corr2305.html#abs-2305-13459

Benjamin Doerr Martin S. Krejca Bivariate Estimation-of-Distribution Algorithms Can Find an Exponential Number of Optima. 2023 abs/2310.04042 CoRR https://doi.org/10.48550/arXiv.2310.04042 db/journals/corr/corr2310.html#abs-2310-04042

Weijie Zheng 0001 Benjamin Doerr Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. 2023 abs/2312.10290 CoRR https://doi.org/10.48550/arXiv.2312.10290 db/journals/corr/corr2312.html#abs-2312-10290

Denis Antipov Benjamin Doerr Vitalii Karavaev A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions. 1573-1602 2022 84 Algorithmica 6 https://doi.org/10.1007/s00453-021-00907-7 db/journals/algorithmica/algorithmica84.html#AntipovDK22

Benjamin Doerr Does Comma Selection Help to Cope with Local Optima? 1659-1693 2022 84 Algorithmica 6 https://doi.org/10.1007/s00453-021-00896-7 db/journals/algorithmica/algorithmica84.html#Doerr22

Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr Fast Mutation in Crossover-Based Algorithms. 1724-1761 2022 84 Algorithmica 6 https://doi.org/10.1007/s00453-022-00957-5 db/journals/algorithmica/algorithmica84.html#AntipovBD22

Maxim Buzdalov 0001 Benjamin Doerr Carola Doerr Dmitry Vinokurov Fixed-Target Runtime Analysis. 1762-1793 2022 84 Algorithmica 6 https://doi.org/10.1007/s00453-021-00881-0 db/journals/algorithmica/algorithmica84.html#BuzdalovDDV22

Benjamin Doerr A sharp discrepancy bound for jittered sampling. 1871-1892 2022 91 Math. Comput. 336 https://doi.org/10.1090/mcom/3727 db/journals/moc/moc91.html#Doerr22

Weijie Zheng 0001 Yufei Liu Benjamin Doerr A First Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II). 10408-10416 2022 AAAI https://doi.org/10.1609/aaai.v36i9.21283 conf/aaai/2022 db/conf/aaai/aaai2022.html#0001LD22 Benjamin Doerr Amirhossein Rajabi Stagnation Detection Meets Fast Mutation. 191-207 2022 EvoCOP https://doi.org/10.1007/978-3-031-04148-8_13 conf/evoW/2022cop db/conf/evoW/evocop2022.html#DoerrR22 Denis Antipov Benjamin Doerr Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022). 13-14 2022 GECCO Companion https://doi.org/10.1145/3520304.3534062 conf/gecco/2022c db/conf/gecco/gecco2022c.html#AntipovD22 Shouda Wang Weijie Zheng 0001 Benjamin Doerr Choosing the right algorithm with hints from complexity theory: (hot-off-the-press track at GECCO 2022). 45-46 2022 GECCO Companion https://doi.org/10.1145/3520304.3534069 https://www.wikidata.org/entity/Q130922316 conf/gecco/2022c db/conf/gecco/gecco2022c.html#Wang0D22 Weijie Zheng 0001 Yufei Liu Benjamin Doerr A first mathematical runtime analysis of the non-dominated sorting genetic algorithm II (NSGA-II): (hot-off-the-press track at GECCO 2022). 53-54 2022 GECCO Companion https://doi.org/10.1145/3520304.3534070 conf/gecco/2022c db/conf/gecco/gecco2022c.html#0001LD22 Benjamin Doerr Omar El Hadri Adrien Pinard The (1 + (λ, λ)) global SEMO algorithm. 520-528 2022 GECCO https://doi.org/10.1145/3512290.3528868 https://www.wikidata.org/entity/Q130929479 conf/gecco/2022 db/conf/gecco/gecco2022.html#DoerrHP22 Weijie Zheng 0001 Benjamin Doerr Better approximation guarantees for the NSGA-II by using the current crowding distance. 611-619 2022 GECCO https://doi.org/10.1145/3512290.3528847 conf/gecco/2022 db/conf/gecco/gecco2022.html#0001D22 Benjamin Doerr A gentle introduction to theory (for non-theoreticians). 890-921 2022 GECCO Companion https://doi.org/10.1145/3520304.3533628 conf/gecco/2022c db/conf/gecco/gecco2022c.html#Doerr22 Quentin Renau Johann Dréo Alain Peres Yann Semet Carola Doerr Benjamin Doerr Automated algorithm selection for radar network configuration. 1263-1271 2022 GECCO https://doi.org/10.1145/3512290.3528825 https://www.wikidata.org/entity/Q130921340 conf/gecco/2022 db/conf/gecco/gecco2022.html#RenauDPSDD22 Benjamin Doerr Amirhossein Rajabi Carsten Witt Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. 1381-1389 2022 GECCO https://doi.org/10.1145/3512290.3528812 conf/gecco/2022 db/conf/gecco/gecco2022.html#DoerrRW22 Benjamin Doerr Yassine Ghannane Marouane Ibn Brahim Towards a stronger theory for permutation-based evolutionary algorithms. 1390-1398 2022 GECCO https://doi.org/10.1145/3512290.3528720 conf/gecco/2022 db/conf/gecco/gecco2022.html#DoerrGB22 Benjamin Doerr Zhongdi Qu A First Runtime Analysis of the NSGA-II on a Multimodal Problem. 399-412 2022 PPSN (2) https://doi.org/10.1007/978-3-031-14721-0_28 conf/ppsn/2022-2 db/conf/ppsn/ppsn2022-2.html#DoerrQ22 Benjamin Doerr Marc Dufay General Univariate Estimation-of-Distribution Algorithms. 470-484 2022 PPSN (2) https://doi.org/10.1007/978-3-031-14721-0_33 conf/ppsn/2022-2 db/conf/ppsn/ppsn2022-2.html#DoerrD22

Benjamin Doerr Amirhossein Rajabi Stagnation Detection meets Fast Mutation. 2022 abs/2201.12158 CoRR https://arxiv.org/abs/2201.12158 db/journals/corr/corr2201.html#abs-2201-12158

Weijie Zheng 0001 Benjamin Doerr Better Approximation Guarantees for the NSGA-II by Using the Current Crowding Distance. 2022 abs/2203.02693 CoRR https://doi.org/10.48550/arXiv.2203.02693 db/journals/corr/corr2203.html#abs-2203-02693

Benjamin Doerr Amirhossein Rajabi Carsten Witt Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. 2022 abs/2204.02097 CoRR https://doi.org/10.48550/arXiv.2204.02097 db/journals/corr/corr2204.html#abs-2204-02097

Benjamin Doerr Yassine Ghannane Marouane Ibn Brahim Towards a Stronger Theory for Permutation-based Evolutionary Algorithms. 2022 abs/2204.07637 CoRR https://doi.org/10.48550/arXiv.2204.07637 db/journals/corr/corr2204.html#abs-2204-07637

Zhongdi Qu Benjamin Doerr A First Runtime Analysis of the NSGA-II on a Multimodal Problem. 2022 abs/2204.13750 CoRR https://doi.org/10.48550/arXiv.2204.13750 db/journals/corr/corr2204.html#abs-2204-13750

Quentin Renau Johann Dréo Alain Peres Yann Semet Carola Doerr Benjamin Doerr Automated Algorithm Selection for Radar Network Configuration. 2022 abs/2205.03670 CoRR https://doi.org/10.48550/arXiv.2205.03670 db/journals/corr/corr2205.html#abs-2205-03670

Weijie Zheng 0001 Benjamin Doerr From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms. 2022 abs/2206.09090 CoRR https://doi.org/10.48550/arXiv.2206.09090 db/journals/corr/corr2206.html#abs-2206-09090

Benjamin Doerr Marc Dufay General Univariate Estimation-of-Distribution Algorithms. 2022 abs/2206.11198 CoRR https://doi.org/10.48550/arXiv.2206.11198 db/journals/corr/corr2206.html#abs-2206-11198

Benjamin Doerr Yassine Ghannane Marouane Ibn Brahim Runtime Analysis for Permutation-based Evolutionary Algorithms. 2022 abs/2207.04045 CoRR https://doi.org/10.48550/arXiv.2207.04045 db/journals/corr/corr2207.html#abs-2207-04045

Benjamin Doerr Zhongdi Qu The First Mathematical Proof That Crossover Gives Super-Constant Performance Gains For the NSGA-II. 2022 abs/2208.08759 CoRR https://doi.org/10.48550/arXiv.2208.08759 db/journals/corr/corr2208.html#abs-2208-08759

Benjamin Doerr Zhongdi Qu From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds. 2022 abs/2209.13974 CoRR https://doi.org/10.48550/arXiv.2209.13974 db/journals/corr/corr2209.html#abs-2209-13974

Benjamin Doerr Omar El Hadri Adrien Pinard The $(1+(λ, λ))$ Global SEMO Algorithm. 2022 abs/2210.03618 CoRR https://doi.org/10.48550/arXiv.2210.03618 db/journals/corr/corr2210.html#abs-2210-03618

Benjamin Doerr Simon Wietheger A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). 2022 abs/2211.08202 CoRR https://doi.org/10.48550/arXiv.2211.08202 db/journals/corr/corr2211.html#abs-2211-08202

Weijie Zheng 0001 Benjamin Doerr Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Three or More Objectives. 2022 abs/2211.13084 CoRR https://doi.org/10.48550/arXiv.2211.13084 db/journals/corr/corr2211.html#abs-2211-13084

Josu Ceberio Uribe Benjamin Doerr Carsten Witt Vicente P. Soloviev Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182). 17-36 2022 12 Dagstuhl Reports 5 https://doi.org/10.4230/DagRep.12.5.17 db/journals/dagstuhl-reports/dagstuhl-reports12.html#UribeDWS22

Benjamin Doerr Carsten Witt Jing Yang 0016 Runtime Analysis for Self-adaptive Mutation Rates. 1012-1053 2021 83 Algorithmica 4 https://doi.org/10.1007/s00453-020-00726-2 db/journals/algorithmica/algorithmica83.html#DoerrWY21

Denis Antipov Benjamin Doerr A Tight Runtime Analysis for the (μ + λ ) EA. 1054-1095 2021 83 Algorithmica 4 https://doi.org/10.1007/s00453-020-00731-5 db/journals/algorithmica/algorithmica83.html#AntipovD21

Benjamin Doerr Timo Kötzing Multiplicative Up-Drift. 3017-3058 2021 83 Algorithmica 10 https://doi.org/10.1007/s00453-020-00775-7 db/journals/algorithmica/algorithmica83.html#DoerrK21

Benjamin Doerr The Runtime of the Compact Genetic Algorithm on Jump Functions. 3059-3107 2021 83 Algorithmica 10 https://doi.org/10.1007/s00453-020-00780-w db/journals/algorithmica/algorithmica83.html#Doerr21

Benjamin Doerr Carola Doerr Johannes Lengler Self-Adjusting Mutation Rates with Provably Optimal Success Rules. 3108-3147 2021 83 Algorithmica 10 https://doi.org/10.1007/s00453-021-00854-3 db/journals/algorithmica/algorithmica83.html#DoerrDL21

Benjamin Doerr Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift. 305-329 2021 29 Evol. Comput. 2 https://doi.org/10.1162/evco_a_00283 https://www.wikidata.org/entity/Q102071616 db/journals/ec/ec29.html#Doerr21

Benjamin Doerr Martin S. Krejca The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis. 543-563 2021 29 Evol. Comput. 4 https://doi.org/10.1162/evco_a_00293 db/journals/ec/ec29.html#DoerrK21

Benjamin Doerr Runtime analysis of evolutionary algorithms via symmetry arguments. 106064 2021 166 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2020.106064 db/journals/ipl/ipl166.html#Doerr21

Benjamin Doerr Sebastian Mayer The recovery of ridge functions on the hypercube suffers from the curse of dimensionality. 101521 2021 63 J. Complex. https://doi.org/10.1016/j.jco.2020.101521 db/journals/jc/jc63.html#DoerrM21

Benjamin Doerr Michael Gnewuch On negative dependence properties of Latin hypercube samples and scrambled nets. 101589 2021 67 J. Complex. https://doi.org/10.1016/j.jco.2021.101589 db/journals/jc/jc67.html#DoerrG21

Benjamin Doerr Exponential upper bounds for the runtime of randomized search heuristics. 24-38 2021 851 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2020.09.032 https://www.wikidata.org/entity/Q115566730 db/journals/tcs/tcs851.html#Doerr21

Benjamin Doerr Martin S. Krejca A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes. 121-128 2021 851 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2020.11.028 db/journals/tcs/tcs851.html#DoerrK21

Denis Antipov Benjamin Doerr Precise Runtime Analysis for Plateau Functions. 13:1-13:28 2021 1 ACM Trans. Evol. Learn. Optim. 4 https://doi.org/10.1145/3469800 db/journals/telo/telo1.html#AntipovD21

Benjamin Doerr Frank Neumann 0001 A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization. 16:1-16:43 2021 1 ACM Trans. Evol. Learn. Optim. 4 https://doi.org/10.1145/3472304 db/journals/telo/telo1.html#DoerrN21

Benjamin Doerr Weijie Zheng 0001 Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives. 12293-12301 2021 AAAI https://doi.org/10.1609/aaai.v35i14.17459 conf/aaai/2021 db/conf/aaai/aaai2021.html#DoerrZ21 Quentin Renau Johann Dréo Carola Doerr Benjamin Doerr Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions. 17-33 2021 EvoApplications https://doi.org/10.1007/978-3-030-72699-7_2 conf/evoW/2021a db/conf/evoW/evoappl2021.html#RenauDDD21 Riade Benbaki Ziyad Benomar Benjamin Doerr A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima. 4-13 2021 GECCO https://doi.org/10.1145/3449639.3459350 conf/gecco/2021 db/conf/gecco/gecco2021.html#BenbakiBD21 Benjamin Doerr Runtime analysis via symmetry arguments: (hot-off-the-press track at GECCO 2021). 23-24 2021 GECCO Companion https://doi.org/10.1145/3449726.3462720 conf/gecco/2021c db/conf/gecco/gecco2021c.html#Doerr21 Benjamin Doerr Weijie Zheng 0001 Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives: (hot-off-the-press track at GECCO 2021). 25-26 2021 GECCO Companion https://doi.org/10.1145/3449726.3462719 conf/gecco/2021c db/conf/gecco/gecco2021c.html#Doerr021 Benjamin Doerr A gentle introduction to theory (for non-theoreticians). 369-398 2021 GECCO Companion https://doi.org/10.1145/3449726.3461406 conf/gecco/2021c db/conf/gecco/gecco2021c.html#Doerr21a Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. 1115-1123 2021 GECCO https://doi.org/10.1145/3449639.3459377 conf/gecco/2021 db/conf/gecco/gecco2021.html#AntipovBD21 Henry Bambury Antoine Bultel Benjamin Doerr Generalized jump functions. 1124-1132 2021 GECCO https://doi.org/10.1145/3449639.3459367 conf/gecco/2021 db/conf/gecco/gecco2021.html#BamburyBD21 Benjamin Doerr Timo Kötzing Lower bounds from fitness levels made easy. 1142-1150 2021 GECCO https://doi.org/10.1145/3449639.3459352 conf/gecco/2021 db/conf/gecco/gecco2021.html#DoerrK21 Shouda Wang Weijie Zheng 0001 Benjamin Doerr Choosing the Right Algorithm With Hints From Complexity Theory. 1697-1703 2021 IJCAI https://doi.org/10.24963/ijcai.2021/234 conf/ijcai/2021 db/conf/ijcai/ijcai2021.html#Wang0D21 Quentin Renau Johann Dréo Carola Doerr Benjamin Doerr Exploratory Landscape Analysis Feature Values for the 24 Noiseless BBOB Functions. 2021 January https://doi.org/10.5281/zenodo.4449934 Zenodo streams/repo/zenodo

Quentin Renau Johann Dréo Carola Doerr Benjamin Doerr Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions. 2021 abs/2102.00736 CoRR https://arxiv.org/abs/2102.00736 db/journals/corr/corr2102.html#abs-2102-00736

Benjamin Doerr A Sharp Discrepancy Bound for Jittered Sampling. 2021 abs/2103.15712 CoRR https://arxiv.org/abs/2103.15712 db/journals/corr/corr2103.html#abs-2103-15712

Benjamin Doerr Timo Kötzing Lower Bounds from Fitness Levels Made Easy. 2021 abs/2104.03372 CoRR https://arxiv.org/abs/2104.03372 db/journals/corr/corr2104.html#abs-2104-03372

Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution. 2021 abs/2104.06714 CoRR https://arxiv.org/abs/2104.06714 db/journals/corr/corr2104.html#abs-2104-06714

Benjamin Doerr Michael Gnewuch On Negative Dependence Properties of Latin Hypercube Samples and Scrambled Nets. 2021 abs/2104.10799 CoRR https://arxiv.org/abs/2104.10799 db/journals/corr/corr2104.html#abs-2104-10799

Henry Bambury Antoine Bultel Benjamin Doerr An Extended Jump Function Benchmark for the Analysis of Randomized Search Heuristics. 2021 abs/2105.03090 CoRR https://arxiv.org/abs/2105.03090 db/journals/corr/corr2105.html#abs-2105-03090

Shouda Wang Weijie Zheng 0001 Benjamin Doerr Choosing the Right Algorithm With Hints From Complexity Theory. 2021 abs/2109.06584 CoRR https://arxiv.org/abs/2109.06584 db/journals/corr/corr2109.html#abs-2109-06584

Weijie Zheng 0001 Yufei Liu Benjamin Doerr A First Mathematical Runtime Analysis of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). 2021 abs/2112.08581 CoRR https://arxiv.org/abs/2112.08581 db/journals/corr/corr2112.html#abs-2112-08581

Benjamin Doerr Carola Doerr Jing Yang 0016 Optimal parameter choices via precise black-box analysis. 1-34 2020 801 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2019.06.014 https://www.wikidata.org/entity/Q127581054 db/journals/tcs/tcs801.html#DoerrDY20

Benjamin Doerr Weijie Zheng 0001 Working principles of binary differential evolution. 110-142 2020 801 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2019.08.025 db/journals/tcs/tcs801.html#DoerrZ20

Benjamin Doerr Timo Kötzing J. A. Gregor Lagodzinski Johannes Lengler The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time. 144-168 2020 816 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2020.01.011 https://www.wikidata.org/entity/Q126348304 db/journals/tcs/tcs816.html#DoerrKLL20

Benjamin Doerr Martin S. Krejca Significance-Based Estimation-of-Distribution Algorithms. 1025-1034 2020 24 IEEE Trans. Evol. Comput. 6 https://doi.org/10.1109/TEVC.2019.2956633 db/journals/tec/tec24.html#DoerrK20

Benjamin Doerr Weijie Zheng 0001 Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms. 1140-1149 2020 24 IEEE Trans. Evol. Comput. 6 https://doi.org/10.1109/TEVC.2020.2987361 db/journals/tec/tec24.html#DoerrZ20

Benjamin Doerr Marvin Künnemann Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. 5729-5741 2020 66 IEEE Trans. Inf. Theory 9 https://doi.org/10.1109/TIT.2020.2978385 db/journals/tit/tit66.html#DoerrK20

Benjamin Doerr Carola Doerr Aneta Neumann Frank Neumann 0001 Andrew M. Sutton Optimization of Chance-Constrained Submodular Functions. 1460-1467 2020 AAAI https://doi.org/10.1609/aaai.v34i02.5504 https://www.wikidata.org/entity/Q125840067 conf/aaai/2020 db/conf/aaai/aaai2020.html#DoerrD0NS20 Benjamin Doerr Martin S. Krejca The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis. 51-66 2020 EvoCOP https://doi.org/10.1007/978-3-030-43680-3_4 conf/evoW/2020cop db/conf/evoW/evocop2020.html#DoerrK20 Benjamin Doerr Weijie Zheng 0001 Sharp bounds for genetic drift in estimation of distribution algorithms (Hot-off-the-press track at GECCO 2020). 15-16 2020 GECCO Companion https://doi.org/10.1145/3377929.3397489 conf/gecco/2020c db/conf/gecco/gecco2020c.html#DoerrZ20 Benjamin Doerr Martin S. Krejca The univariate marginal distribution algorithm copes well with deception and epistasis. 17-18 2020 GECCO Companion https://doi.org/10.1145/3377929.3397487 conf/gecco/2020c db/conf/gecco/gecco2020c.html#DoerrK20 Benjamin Doerr A gentle introduction to theory (for non-theoreticians). 373-403 2020 GECCO Companion https://doi.org/10.1145/3377929.3389889 conf/gecco/2020c db/conf/gecco/gecco2020c.html#Doerr20 Benjamin Doerr Martin S. Krejca Bivariate estimation-of-distribution algorithms can find an exponential number of optima. 796-804 2020 GECCO https://doi.org/10.1145/3377930.3390177 https://www.wikidata.org/entity/Q130971944 conf/gecco/2020 db/conf/gecco/gecco2020.html#DoerrK20a Benjamin Doerr Weijie Zheng 0001 From understanding genetic drift to a smart-restart parameter-less compact genetic algorithm. 805-813 2020 GECCO https://doi.org/10.1145/3377930.3390163 conf/gecco/2020 db/conf/gecco/gecco2020.html#DoerrZ20a Denis Antipov Benjamin Doerr Vitalii Karavaev The (1 + (λ, λ)) GA is even faster on multimodal problems. 1259-1267 2020 GECCO https://doi.org/10.1145/3377930.3390148 conf/gecco/2020 db/conf/gecco/gecco2020.html#AntipovDK20 Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr Fast mutation in crossover-based algorithms. 1268-1276 2020 GECCO https://doi.org/10.1145/3377930.3390172 conf/gecco/2020 db/conf/gecco/gecco2020.html#AntipovBD20 Maxim Buzdalov 0001 Benjamin Doerr Carola Doerr Dmitry Vinokurov Fixed-target runtime analysis. 1295-1303 2020 GECCO https://doi.org/10.1145/3377930.3390184 conf/gecco/2020 db/conf/gecco/gecco2020.html#BuzdalovDDV20 Benjamin Doerr Does comma selection help to cope with local optima? 1304-1313 2020 GECCO https://doi.org/10.1145/3377930.3389823 conf/gecco/2020 db/conf/gecco/gecco2020.html#Doerr20a Quentin Renau Carola Doerr Johann Dréo Benjamin Doerr Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy. 139-153 2020 PPSN (2) https://doi.org/10.1007/978-3-030-58115-2_10 conf/ppsn/2020-2 db/conf/ppsn/ppsn2020-2.html#RenauDDD20 Denis Antipov Benjamin Doerr Runtime Analysis of a Heavy-Tailed (1+(λ , λ )) Genetic Algorithm on Jump Functions. 545-559 2020 PPSN (2) https://doi.org/10.1007/978-3-030-58115-2_38 conf/ppsn/2020-2 db/conf/ppsn/ppsn2020-2.html#AntipovD20 Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr First Steps Towards a Runtime Analysis When Starting with a Good Solution. 560-573 2020 PPSN (2) https://doi.org/10.1007/978-3-030-58115-2_39 conf/ppsn/2020-2 db/conf/ppsn/ppsn2020-2.html#AntipovBD20 Benjamin Doerr Lower Bounds for Non-elitist Evolutionary Algorithms via Negative Multiplicative Drift. 604-618 2020 PPSN (2) https://doi.org/10.1007/978-3-030-58115-2_42 conf/ppsn/2020-2 db/conf/ppsn/ppsn2020-2.html#Doerr20 Benjamin Doerr Exponential Upper Bounds for the Runtime of Randomized Search Heuristics. 619-633 2020 PPSN (2) https://doi.org/10.1007/978-3-030-58115-2_43 conf/ppsn/2020-2 db/conf/ppsn/ppsn2020-2.html#Doerr20a Benjamin Doerr Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. 1-87 2020 Theory of Evolutionary Computation https://doi.org/10.1007/978-3-030-29414-4_1 series/ncs/2020DN db/series/ncs/DN2020.html#Doerr20 Benjamin Doerr Carola Doerr Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices. 271-321 2020 Theory of Evolutionary Computation https://doi.org/10.1007/978-3-030-29414-4_6 series/ncs/2020DN db/series/ncs/DN2020.html#DoerrD20 Benjamin Doerr Frank Neumann 0001 Theory of Evolutionary Computation - Recent Developments in Discrete Optimization Theory of Evolutionary Computation Springer 2020 Natural Computing Series 978-3-030-29413-7 978-3-030-29414-4 https://doi.org/10.1007/978-3-030-29414-4 db/series/ncs/DN2020.html Quentin Renau Carola Doerr Johann Dréo Benjamin Doerr Experimental Data Set for the study "Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy". 2020 June https://doi.org/10.5281/zenodo.3886816 Zenodo streams/repo/zenodo

Benjamin Doerr Does Comma Selection Help To Cope With Local Optima. 2020 abs/2004.01274 CoRR https://arxiv.org/abs/2004.01274 db/journals/corr/corr2004.html#abs-2004-01274

Benjamin Doerr Martin S. Krejca A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes. 2020 abs/2004.04978 CoRR https://arxiv.org/abs/2004.04978 db/journals/corr/corr2004.html#abs-2004-04978

Benjamin Doerr Exponential Upper Bounds for the Runtime of Randomized Search Heuristics. 2020 abs/2004.05733 CoRR https://arxiv.org/abs/2004.05733 db/journals/corr/corr2004.html#abs-2004-05733

Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr Fast Mutation in Crossover-based Algorithms. 2020 abs/2004.06538 CoRR https://arxiv.org/abs/2004.06538 db/journals/corr/corr2004.html#abs-2004-06538

Denis Antipov Benjamin Doerr Vitalii Karavaev The (1 + (λ, λ)) GA Is Even Faster on Multimodal Problems. 2020 abs/2004.06702 CoRR https://arxiv.org/abs/2004.06702 db/journals/corr/corr2004.html#abs-2004-06702

Benjamin Doerr Weijie Zheng 0001 From Understanding Genetic Drift to a Smart-Restart Parameter-less Compact Genetic Algorithm. 2020 abs/2004.07141 CoRR https://arxiv.org/abs/2004.07141 db/journals/corr/corr2004.html#abs-2004-07141

Maxim Buzdalov 0001 Benjamin Doerr Carola Doerr Dmitry Vinokurov Fixed-Target Runtime Analysis. 2020 abs/2004.09613 CoRR https://arxiv.org/abs/2004.09613 db/journals/corr/corr2004.html#abs-2004-09613

Benjamin Doerr Lower Bounds for Non-Elitist Evolutionary Algorithms Via Negative Multiplicative Drift. 2020 abs/2005.00853 CoRR https://arxiv.org/abs/2005.00853 db/journals/corr/corr2005.html#abs-2005-00853

Denis Antipov Benjamin Doerr Runtime Analysis of a Heavy-Tailed (1+(λ, λ)) Genetic Algorithm on Jump Functions. 2020 abs/2006.03523 CoRR https://arxiv.org/abs/2006.03523 db/journals/corr/corr2006.html#abs-2006-03523

Benjamin Doerr Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments. 2020 abs/2006.04663 CoRR https://arxiv.org/abs/2006.04663 db/journals/corr/corr2006.html#abs-2006-04663

Quentin Renau Carola Doerr Johann Dréo Benjamin Doerr Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy. 2020 abs/2006.11135 CoRR https://arxiv.org/abs/2006.11135 db/journals/corr/corr2006.html#abs-2006-11135

Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr First Steps Towards a Runtime Analysis When Starting With a Good Solution. 2020 abs/2006.12161 CoRR https://arxiv.org/abs/2006.12161 db/journals/corr/corr2006.html#abs-2006-12161

Benjamin Doerr Frank Neumann 0001 A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization. 2020 abs/2006.16709 CoRR https://arxiv.org/abs/2006.16709 db/journals/corr/corr2006.html#abs-2006-16709

Benjamin Doerr Martin S. Krejca The Univariate Marginal Distribution Algorithm Copes Well With Deception and Epistasis. 2020 abs/2007.08277 CoRR https://arxiv.org/abs/2007.08277 db/journals/corr/corr2007.html#abs-2007-08277

Benjamin Doerr Weijie Zheng 0001 Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives. 2020 abs/2012.07231 CoRR https://arxiv.org/abs/2012.07231 db/journals/corr/corr2012.html#abs-2012-07231

Benjamin Doerr Christian Gießen Carsten Witt Jing Yang 0016 The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. 593-631 2019 81 Algorithmica 2 https://doi.org/10.1007/s00453-018-0502-x db/journals/algorithmica/algorithmica81.html#DoerrGWY19

Benjamin Doerr Carola Doerr Timo Kötzing Solving Problems with Unknown Solution Length at Almost No Extra Cost. 703-748 2019 81 Algorithmica 2 https://doi.org/10.1007/s00453-018-0477-7 db/journals/algorithmica/algorithmica81.html#DoerrDK19

Benjamin Doerr Philipp Fischbeck Clemens Frahnow Tobias Friedrich 0001 Timo Kötzing Martin Schirneck Island Models Meet Rumor Spreading. 886-915 2019 81 Algorithmica 2 https://doi.org/10.1007/s00453-018-0445-2 https://www.wikidata.org/entity/Q129906406 db/journals/algorithmica/algorithmica81.html#DoerrFFFKS19

Peyman Afshani Manindra Agrawal Benjamin Doerr Carola Doerr Kasper Green Larsen Kurt Mehlhorn The query complexity of a permutation-based variant of Mastermind. 28-50 2019 260 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2019.01.007 https://www.wikidata.org/entity/Q128415851 db/journals/dam/dam260.html#AfshaniADDLM19

Benjamin Doerr Analyzing randomized search heuristics via stochastic domination. 115-137 2019 773 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2018.09.024 https://www.wikidata.org/entity/Q129020376 db/journals/tcs/tcs773.html#Doerr19

Benjamin Doerr An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. 25-33 2019 FOGA https://doi.org/10.1145/3299904.3340304 conf/foga/2019 db/conf/foga/foga2019.html#Doerr19 Denis Antipov Benjamin Doerr Vitalii Karavaev A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones. 169-182 2019 FOGA https://doi.org/10.1145/3299904.3340317 conf/foga/2019 db/conf/foga/foga2019.html#AntipovDK19 Benjamin Doerr Carola Doerr Frank Neumann 0001 Fast re-optimization via structural diversity. 233-241 2019 GECCO https://doi.org/10.1145/3321707.3321731 conf/gecco/2019 db/conf/gecco/gecco2019.html#DoerrD019 Benjamin Doerr Andrew M. Sutton When resampling to cope with noise, use median, not mean. 242-248 2019 GECCO https://doi.org/10.1145/3321707.3321837 conf/gecco/2019 db/conf/gecco/gecco2019.html#DoerrS19 Benjamin Doerr Theory for non-theoreticians: introductory tutorial. 523-549 2019 GECCO (Companion) https://doi.org/10.1145/3319619.3323373 conf/gecco/2019c db/conf/gecco/gecco2019c.html#Doerr19a Benjamin Doerr Andrei Lissovoi Pietro S. Oliveto Evolving boolean functions with conjunctions and disjunctions via genetic programming. 1003-1011 2019 GECCO https://doi.org/10.1145/3321707.3321851 conf/gecco/2019 db/conf/gecco/gecco2019.html#DoerrLO19 Denis Antipov Benjamin Doerr Quentin Yang The efficiency threshold for the offspring population size of the (µ, λ) EA. 1461-1469 2019 GECCO https://doi.org/10.1145/3321707.3321838 conf/gecco/2019 db/conf/gecco/gecco2019.html#AntipovDY19 Benjamin Doerr Timo Kötzing Multiplicative up-drift. 1470-1478 2019 GECCO https://doi.org/10.1145/3321707.3321819 conf/gecco/2019 db/conf/gecco/gecco2019.html#DoerrK19 Benjamin Doerr Carola Doerr Johannes Lengler Self-adjusting mutation rates with provably optimal success rules. 1479-1487 2019 GECCO https://doi.org/10.1145/3321707.3321733 conf/gecco/2019 db/conf/gecco/gecco2019.html#DoerrDL19 Benjamin Doerr A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost. 1488-1496 2019 GECCO https://doi.org/10.1145/3321707.3321747 conf/gecco/2019 db/conf/gecco/gecco2019.html#Doerr19 Vitalii Karavaev Denis Antipov Benjamin Doerr Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem. 2036-2039 2019 GECCO (Companion) https://doi.org/10.1145/3319619.3326910 conf/gecco/2019c db/conf/gecco/gecco2019c.html#KaravaevAD19 Quentin Renau Johann Dréo Carola Doerr Benjamin Doerr Expressiveness and robustness of landscape features. 2048-2051 2019 GECCO (Companion) https://doi.org/10.1145/3319619.3326913 conf/gecco/2019c db/conf/gecco/gecco2019c.html#RenauDDD19 Dmitry Vinokurov Maxim Buzdalov 0001 Arina Buzdalova Benjamin Doerr Carola Doerr Fixed-target runtime analysis of the (1 + 1) EA with resampling. 2068-2071 2019 GECCO (Companion) https://doi.org/10.1145/3319619.3326906 conf/gecco/2019c db/conf/gecco/gecco2019c.html#VinokurovBBDD19

Benjamin Doerr Carola Doerr Frank Neumann 0001 Fast Re-Optimization via Structural Diversity. 2019 abs/1902.00304 CoRR http://arxiv.org/abs/1902.00304 db/journals/corr/corr1902.html#abs-1902-00304

Benjamin Doerr Carola Doerr Johannes Lengler Self-Adjusting Mutation Rates with Provably Optimal Success Rules. 2019 abs/1902.02588 CoRR http://arxiv.org/abs/1902.02588 db/journals/corr/corr1902.html#abs-1902-02588

Benjamin Doerr A Tight Runtime Analysis for the cGA on Jump Functions - EDAs Can Cross Fitness Valleys at No Extra Cost. 2019 abs/1903.10983 CoRR http://arxiv.org/abs/1903.10983 db/journals/corr/corr1903.html#abs-1903-10983

Benjamin Doerr Andrei Lissovoi Pietro S. Oliveto Evolving Boolean Functions with Conjunctions and Disjunctions via Genetic Programming. 2019 abs/1903.11936 CoRR http://arxiv.org/abs/1903.11936 db/journals/corr/corr1903.html#abs-1903-11936

Benjamin Doerr Timo Kötzing Multiplicative Up-Drift. 2019 abs/1904.05682 CoRR http://arxiv.org/abs/1904.05682 db/journals/corr/corr1904.html#abs-1904-05682

Denis Antipov Benjamin Doerr Quentin Yang The Efficiency Threshold for the Offspring Population Size of the (μ, λ) EA. 2019 abs/1904.06981 CoRR http://arxiv.org/abs/1904.06981 db/journals/corr/corr1904.html#abs-1904-06981

Benjamin Doerr An Exponential Lower Bound for the Runtime of the cGA on Jump Functions. 2019 abs/1904.08415 CoRR http://arxiv.org/abs/1904.08415 db/journals/corr/corr1904.html#abs-1904-08415

Benjamin Doerr The Runtime of the Compact Genetic Algorithm on Jump Functions. 2019 abs/1908.06527 CoRR http://arxiv.org/abs/1908.06527 db/journals/corr/corr1908.html#abs-1908-06527

Benjamin Doerr Weijie Zheng 0001 Sharp Bounds for Genetic Drift in EDAs. 2019 abs/1910.14389 CoRR http://arxiv.org/abs/1910.14389 db/journals/corr/corr1910.html#abs-1910-14389

Benjamin Doerr Carola Doerr Aneta Neumann Frank Neumann 0001 Andrew M. Sutton Optimization of Chance-Constrained Submodular Functions. 2019 abs/1911.11451 CoRR http://arxiv.org/abs/1911.11451 db/journals/corr/corr1911.html#abs-1911-11451

Benjamin Doerr Carola Doerr Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ, λ)) Genetic Algorithm. 1658-1709 2018 80 Algorithmica 5 https://doi.org/10.1007/s00453-017-0354-9 db/journals/algorithmica/algorithmica80.html#DoerrD18

Benjamin Doerr Carola Doerr Timo Kötzing Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables. 1732-1768 2018 80 Algorithmica 5 https://doi.org/10.1007/s00453-017-0341-1 db/journals/algorithmica/algorithmica80.html#DoerrDK18

Benjamin Doerr Better Runtime Guarantees via Stochastic Domination. 1-17 2018 EvoCOP https://doi.org/10.1007/978-3-319-77449-7_1 conf/evoW/2018cop db/conf/evoW/evocop2018.html#Doerr18 Benjamin Doerr Better runtime guarantees via stochastic domination (hot-off-the-press track at GECCO 2018). 13-14 2018 GECCO (Companion) https://doi.org/10.1145/3205651.3208209 conf/gecco/2018c db/conf/gecco/gecco2018c.html#Doerr18 Benjamin Doerr Theory for non-theoreticians: tutorial. 389-414 2018 GECCO (Companion) https://doi.org/10.1145/3205651.3207889 conf/gecco/2018c db/conf/gecco/gecco2018c.html#Doerr18a Benjamin Doerr Andrei Lissovoi Pietro S. Oliveto John Alasdair Warwicker On the runtime analysis of selection hyper-heuristics with adaptive learning periods. 1015-1022 2018 GECCO https://doi.org/10.1145/3205455.3205611 conf/gecco/2018 db/conf/gecco/gecco2018.html#DoerrLOW18 Weijie Zheng 0001 Guangwen Yang 0002 Benjamin Doerr Working principles of binary differential evolution. 1103-1110 2018 GECCO https://doi.org/10.1145/3205455.3205623 conf/gecco/2018 db/conf/gecco/gecco2018.html#ZhengYD18 Denis Antipov Benjamin Doerr Jiefeng Fang Tangi Hetet A tight runtime analysis for the (μ + λ) EA. 1459-1466 2018 GECCO https://doi.org/10.1145/3205455.3205627 conf/gecco/2018 db/conf/gecco/gecco2018.html#AntipovDFH18 Raphaël Dang-Nhu Thibault Dardinier Benjamin Doerr Gautier Izacard Dorian Nogneng A new analysis method for evolutionary optimization of dynamic and noisy objective functions. 1467-1474 2018 GECCO https://doi.org/10.1145/3205455.3205563 conf/gecco/2018 db/conf/gecco/gecco2018.html#Dang-NhuDDIN18 Benjamin Doerr Carsten Witt Jing Yang 0016 Runtime analysis for self-adaptive mutation rates. 1475-1482 2018 GECCO https://doi.org/10.1145/3205455.3205569 https://www.wikidata.org/entity/Q57200548 conf/gecco/2018 db/conf/gecco/gecco2018.html#DoerrW018 Benjamin Doerr Martin S. Krejca Significance-based estimation-of-distribution algorithms. 1483-1490 2018 GECCO https://doi.org/10.1145/3205455.3205553 conf/gecco/2018 db/conf/gecco/gecco2018.html#DoerrK18 Denis Antipov Benjamin Doerr Precise Runtime Analysis for Plateaus. 117-128 2018 PPSN (2) https://doi.org/10.1007/978-3-319-99259-4_10 conf/ppsn/2018-2 db/conf/ppsn/ppsn2018-2.html#AntipovD18

Benjamin Doerr Better Runtime Guarantees Via Stochastic Domination. 2018 abs/1801.04487 CoRR http://arxiv.org/abs/1801.04487 db/journals/corr/corr1801.html#abs-1801-04487

Benjamin Doerr Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. 2018 abs/1801.06733 CoRR http://arxiv.org/abs/1801.06733 db/journals/corr/corr1801.html#abs-1801-06733

Benjamin Doerr Carola Doerr Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices. 2018 abs/1804.05650 CoRR http://arxiv.org/abs/1804.05650 db/journals/corr/corr1804.html#abs-1804-05650

Denis Antipov Benjamin Doerr Precise Runtime Analysis for Plateaus. 2018 abs/1806.01331 CoRR http://arxiv.org/abs/1806.01331 db/journals/corr/corr1806.html#abs-1806-01331

Benjamin Doerr Timo Kötzing J. A. Gregor Lagodzinski Johannes Lengler Bounding Bloat in Genetic Programming. 2018 abs/1806.02112 CoRR http://arxiv.org/abs/1806.02112 db/journals/corr/corr1806.html#abs-1806-02112

Benjamin Doerr Carola Doerr Jing Yang 0016 Optimal Parameter Choices via Precise Black-Box Analysis. 2018 abs/1807.03403 CoRR http://arxiv.org/abs/1807.03403 db/journals/corr/corr1807.html#abs-1807-03403

Benjamin Doerr Martin S. Krejca Significance-based Estimation-of-Distribution Algorithms. 2018 abs/1807.03495 CoRR http://arxiv.org/abs/1807.03495 db/journals/corr/corr1807.html#abs-1807-03495

Benjamin Doerr Carsten Witt Jing Yang 0016 Runtime Analysis for Self-adaptive Mutation Rates. 2018 abs/1811.12824 CoRR http://arxiv.org/abs/1811.12824 db/journals/corr/corr1811.html#abs-1811-12824

Benjamin Doerr Weijie Zheng 0001 Working Principles of Binary Differential Evolution. 2018 abs/1812.03513 CoRR http://arxiv.org/abs/1812.03513 db/journals/corr/corr1812.html#abs-1812-03513

Peyman Afshani Manindra Agrawal Benjamin Doerr Carola Doerr Kasper Green Larsen Kurt Mehlhorn The Query Complexity of a Permutation-Based Variant of Mastermind. 2018 abs/1812.08480 CoRR http://arxiv.org/abs/1812.08480 db/journals/corr/corr1812.html#abs-1812-08480

Denis Antipov Benjamin Doerr A Tight Runtime Analysis for the (μ+ λ) EA. 2018 abs/1812.11061 CoRR http://arxiv.org/abs/1812.11061 db/journals/corr/corr1812.html#abs-1812-11061

Benjamin Doerr Frank Neumann 0001 Andrew M. Sutton Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. 561-586 2017 78 Algorithmica 2 https://doi.org/10.1007/s00453-016-0190-3 db/journals/algorithmica/algorithmica78.html#DoerrNS17

Benjamin Doerr Paul Fischer Astrid Hilbert Carsten Witt Detecting structural breaks in time series via genetic algorithms. 4707-4720 2017 21 Soft Comput. 16 https://doi.org/10.1007/s00500-016-2079-0 https://www.wikidata.org/entity/Q57200563 db/journals/soco/soco21.html#DoerrFHW17

Maxim Buzdalov 0001 Benjamin Doerr Mikhail Kever The unrestricted black-box complexity of jump functions. 1-2 2017 GECCO (Companion) https://doi.org/10.1145/3067695.3084376 conf/gecco/2017c db/conf/gecco/gecco2017c.html#BuzdalovDK17 Benjamin Doerr Theory for non-theoreticians. 389-412 2017 GECCO (Companion) https://doi.org/10.1145/3067695.3067713 conf/gecco/2017c db/conf/gecco/gecco2017c.html#Doerr17 Benjamin Doerr Huu Phuoc Le Régis Makhmara Ta Duy Nguyen Fast genetic algorithms. 777-784 2017 GECCO https://doi.org/10.1145/3071178.3071301 conf/gecco/2017 db/conf/gecco/gecco2017.html#DoerrLMN17 Benjamin Doerr Timo Kötzing J. A. Gregor Lagodzinski Johannes Lengler Bounding bloat in genetic programming. 921-928 2017 GECCO https://doi.org/10.1145/3071178.3071271 conf/gecco/2017 db/conf/gecco/gecco2017.html#DoerrKLL17 Maxim Buzdalov 0001 Benjamin Doerr Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas. 1343-1350 2017 GECCO https://doi.org/10.1145/3071178.3071297 conf/gecco/2017 db/conf/gecco/gecco2017.html#BuzdalovD17 Benjamin Doerr Christian Gießen Carsten Witt Jing Yang 0016 The (1+λ) evolutionary algorithm with self-adjusting mutation rate. 1351-1358 2017 GECCO https://doi.org/10.1145/3071178.3071279 https://www.wikidata.org/entity/Q57200554 conf/gecco/2017 db/conf/gecco/gecco2017.html#DoerrGWY17 Benjamin Doerr Philipp Fischbeck Clemens Frahnow Tobias Friedrich 0001 Timo Kötzing Martin Schirneck Island models meet rumor spreading. 1359-1366 2017 GECCO https://doi.org/10.1145/3071178.3071206 conf/gecco/2017 db/conf/gecco/gecco2017.html#DoerrFF0KS17 Benjamin Doerr Carola Doerr Timo Kötzing Unknown solution length problems with no asymptotically optimal run time. 1367-1374 2017 GECCO https://doi.org/10.1145/3071178.3071233 conf/gecco/2017 db/conf/gecco/gecco2017.html#DoerrDK17 Benjamin Doerr Anatolii Kostrygin Randomized Rumor Spreading Revisited. 138:1-138:14 2017 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2017.138 conf/icalp/2017 db/conf/icalp/icalp2017.html#DoerrK17

Benjamin Doerr Huu Phuoc Le Régis Makhmara Ta Duy Nguyen Fast Genetic Algorithms. 2017 abs/1703.03334 CoRR http://arxiv.org/abs/1703.03334 db/journals/corr/corr1703.html#DoerrLMN17

Benjamin Doerr Christian Gießen Carsten Witt Jing Yang 0016 The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. 2017 abs/1704.02191 CoRR http://arxiv.org/abs/1704.02191 db/journals/corr/corr1704.html#DoerrGWY17

Maxim Buzdalov 0001 Benjamin Doerr Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas. 2017 abs/1704.04366 CoRR http://arxiv.org/abs/1704.04366 db/journals/corr/corr1704.html#BuzdalovD17

Benjamin Doerr An Elementary Analysis of the Probability That a Binomial Random Variable Exceeds Its Expectation. 2017 abs/1712.00519 CoRR http://arxiv.org/abs/1712.00519 db/journals/corr/corr1712.html#abs-1712-00519

Benjamin Doerr Carsten Witt Guest Editorial: Theory of Evolutionary Computation. 425-427 2016 75 Algorithmica 3 https://doi.org/10.1007/s00453-016-0157-4 https://www.wikidata.org/entity/Q57200565 db/journals/algorithmica/algorithmica75.html#DoerrW16

Benjamin Doerr Carola Doerr The Impact of Random Initialization on the Runtime of Randomized Search Heuristics. 529-553 2016 75 Algorithmica 3 https://doi.org/10.1007/s00453-015-0019-5 db/journals/algorithmica/algorithmica75.html#DoerrD16

Benjamin Doerr Carola Doerr Shay Moran Shlomo Moran Simple and optimal randomized fault-tolerant rumor spreading. 89-104 2016 29 Distributed Comput. 2 https://doi.org/10.1007/s00446-014-0238-z db/journals/dc/dc29.html#DoerrDMM16

Maxim Buzdalov 0001 Benjamin Doerr Mikhail Kever The Unrestricted Black-Box Complexity of Jump Functions. 719-744 2016 24 Evol. Comput. 4 https://doi.org/10.1162/EVCO_a_00185 https://www.wikidata.org/entity/Q50635873 db/journals/ec/ec24.html#BuzdalovDK16

Benjamin Doerr Carola Doerr Reto Spöhel Henning Thomas Playing Mastermind With Many Colors. 42:1-42:23 2016 63 J. ACM 5 https://doi.org/10.1145/2987372 db/journals/jacm/jacm63.html#DoerrDST16

Benjamin Doerr Carola Doerr Theory for Non-Theoreticians. 463-482 2016 GECCO (Companion) https://doi.org/10.1145/2908961.2926982 conf/gecco/2016c db/conf/gecco/gecco2016c.html#DoerrD16 Benjamin Doerr Wanru Gao Frank Neumann 0001 Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax. 557-564 2016 GECCO https://doi.org/10.1145/2908812.2908827 conf/gecco/2016 db/conf/gecco/gecco2016.html#DoerrGN16 Benjamin Doerr Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm. 1107-1114 2016 GECCO https://doi.org/10.1145/2908812.2908885 conf/gecco/2016 db/conf/gecco/gecco2016.html#Doerr16 Benjamin Doerr Carola Doerr Timo Kötzing The Right Mutation Strength for Multi-Valued Decision Variables. 1115-1122 2016 GECCO https://doi.org/10.1145/2908812.2908891 conf/gecco/2016 db/conf/gecco/gecco2016.html#DoerrDK16 Benjamin Doerr Carola Doerr Jing Yang 0016 Optimal Parameter Choices via Precise Black-Box Analysis. 1123-1130 2016 GECCO https://doi.org/10.1145/2908812.2908950 conf/gecco/2016 db/conf/gecco/gecco2016.html#DoerrDY16 Benjamin Doerr Marvin Künnemann Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. 150:1-150:13 2016 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2016.150 conf/icalp/2016 db/conf/icalp/icalp2016.html#DoerrK16 Benjamin Doerr Carola Doerr Timo Kötzing Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables. 782-791 2016 PPSN https://doi.org/10.1007/978-3-319-45823-6_73 conf/ppsn/2016 db/conf/ppsn/ppsn2016.html#DoerrDK16 Benjamin Doerr Carola Doerr Jing Yang 0016 k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation. 824-834 2016 PPSN https://doi.org/10.1007/978-3-319-45823-6_77 conf/ppsn/2016 db/conf/ppsn/ppsn2016.html#DoerrDY16 Carola Doerr Nicolas Bredèche Enrique Alba 0001 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 Tutorials at PPSN 2016. 1012-1022 2016 PPSN https://doi.org/10.1007/978-3-319-45823-6_95 conf/ppsn/2016 db/conf/ppsn/ppsn2016.html#DoerrBABBDEEFGH16 Benjamin Doerr Magnus Wahlström How to Generate Randomized Roundings with Dependencies and How to Derandomize Them. 159-184 2016 Algorithm Engineering https://doi.org/10.1007/978-3-319-49487-6_5 series/lncs/9220 db/series/lncs/lncs9220.html#DoerrW16

Benjamin Doerr Marvin Künnemann Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. 2016 abs/1603.06113 CoRR http://arxiv.org/abs/1603.06113 db/journals/corr/corr1603.html#DoerrK16

Benjamin Doerr Optimal Parameter Settings for the $(1+(λ, λ))$ Genetic Algorithm. 2016 abs/1604.01088 CoRR http://arxiv.org/abs/1604.01088 db/journals/corr/corr1604.html#Doerr16

Benjamin Doerr Carola Doerr Timo Kötzing The Right Mutation Strength for Multi-Valued Decision Variables. 2016 abs/1604.03277 CoRR http://arxiv.org/abs/1604.03277 db/journals/corr/corr1604.html#DoerrDK16

Benjamin Doerr Carola Doerr Timo Kötzing Unbiased Black-Box Complexities of Jump Functions. 641-670 2015 23 Evol. Comput. 4 https://doi.org/10.1162/EVCO_a_00158 https://www.wikidata.org/entity/Q50889107 db/journals/ec/ec23.html#DoerrDK15

Karl Bringmann Benjamin Doerr Adrian Neumann Jakub Sliacan Online Checkpointing with Improved Worst-Case Guarantees. 478-490 2015 27 INFORMS J. Comput. 3 https://doi.org/10.1287/ijoc.2014.0639 db/journals/informs/informs27.html#BringmannDNS15

Benjamin Doerr Marvin Künnemann Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances. 3-23 2015 561 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2014.03.015 db/journals/tcs/tcs561.html#DoerrK15

Benjamin Doerr Carola Doerr Franziska Ebel From black-box complexity to designing new genetic algorithms. 87-104 2015 567 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2014.11.028 db/journals/tcs/tcs567.html#DoerrDE15

Denis Antipov Maxim Buzdalov 0001 Benjamin Doerr Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem. 160-172 2015 EvoCOP https://doi.org/10.1007/978-3-319-16468-7_14 conf/evoW/2015cop db/conf/evoW/evocop2015.html#AntipovBD15 Maxim Buzdalov 0001 Mikhail Kever Benjamin Doerr Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ. 209-221 2015 EvoCOP https://doi.org/10.1007/978-3-319-16468-7_18 conf/evoW/2015cop db/conf/evoW/evocop2015.html#BuzdalovKD15 Axel de Perthuis de Laillevault Benjamin Doerr Carola Doerr Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization. 815-822 2015 GECCO https://doi.org/10.1145/2739480.2754760 conf/gecco/2015 db/conf/gecco/gecco2015.html#LaillevaultDD15 Benjamin Doerr Carola Doerr Timo Kötzing Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. 831-838 2015 GECCO https://doi.org/10.1145/2739480.2754681 conf/gecco/2015 db/conf/gecco/gecco2015.html#DoerrDK15 Benjamin Doerr Carola Doerr Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings. 1335-1342 2015 GECCO https://doi.org/10.1145/2739480.2754684 conf/gecco/2015 db/conf/gecco/gecco2015.html#DoerrD15 Benjamin Doerr Frank Neumann 0001 Andrew M. Sutton Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. 1415-1422 2015 GECCO https://doi.org/10.1145/2739480.2754659 conf/gecco/2015 db/conf/gecco/gecco2015.html#DoerrNS15 Benjamin Doerr Carola Doerr A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax. 1423-1430 2015 GECCO https://doi.org/10.1145/2739480.2754683 conf/gecco/2015 db/conf/gecco/gecco2015.html#DoerrD15a

Benjamin Doerr Carola Doerr Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings. 2015 abs/1504.03212 CoRR http://arxiv.org/abs/1504.03212 db/journals/corr/corr1504.html#DoerrD15

Laurent Hoeltgen Markus Mainberger Sebastian Hoffmann 0001 Joachim Weickert Ching Hoo Tang Simon Setzer Daniel Johannsen Frank Neumann 0001 Benjamin Doerr Optimising Spatial and Tonal Data for PDE-based Inpainting. 2015 abs/1506.04566 CoRR http://arxiv.org/abs/1506.04566 db/journals/corr/corr1506.html#HoeltgenMHWTSJN15

Benjamin Doerr Carola Doerr Timo Kötzing Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. 2015 abs/1506.05913 CoRR http://arxiv.org/abs/1506.05913 db/journals/corr/corr1506.html#DoerrDK15

Benjamin Doerr Carola Doerr A Tight Runtime Analysis of the $(1+(λ, λ))$ Genetic Algorithm on OneMax. 2015 abs/1506.05937 CoRR http://arxiv.org/abs/1506.05937 db/journals/corr/corr1506.html#DoerrD15a

Benjamin Doerr Nikolaus Hansen Christian Igel Lothar Thiele Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). 57-91 2015 5 Dagstuhl Reports 5 https://doi.org/10.4230/DagRep.5.5.57 db/journals/dagstuhl-reports/dagstuhl-reports5.html#DoerrHIT15

Benjamin Doerr Carola Doerr Timo Kötzing The unbiased black-box complexity of partition is polynomial. 275-286 2014 216 Artif. Intell. https://doi.org/10.1016/j.artint.2014.07.009 db/journals/ai/ai216.html#DoerrDK14

Benjamin Doerr Carola Winzen Ranking-Based Black-Box Complexity. 571-609 2014 68 Algorithmica 3 https://doi.org/10.1007/s00453-012-9684-9 db/journals/algorithmica/algorithmica68.html#DoerrW14

Benjamin Doerr A lower bound for the discrepancy of a random point set. 16-20 2014 30 J. Complex. 1 https://doi.org/10.1016/j.jco.2013.06.001 db/journals/jc/jc30.html#Doerr14

Benjamin Doerr Magnus Wahlström Randomized Rounding in the Presence of a Cardinality Constraint. 2014 19 ACM J. Exp. Algorithmics 1 https://doi.org/10.1145/2594409 db/journals/jea/jea19.html#DoerrW14

Benjamin Doerr Carola Winzen Playing Mastermind with Constant-Size Memory. 658-684 2014 55 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-012-9438-8 db/journals/mst/mst55.html#DoerrW14

Benjamin Doerr Tobias Friedrich 0001 Thomas Sauerwald Quasirandom Rumor Spreading. 9:1-9:35 2014 11 ACM Trans. Algorithms 2 https://doi.org/10.1145/2650185 db/journals/talg/talg11.html#DoerrFS14

Benjamin Doerr Carola Winzen Reducing the arity in unbiased black-box complexity. 108-121 2014 545 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2013.05.004 db/journals/tcs/tcs545.html#DoerrW14

Frank Neumann 0001 Benjamin Doerr Per Kristian Lehre Pauline C. Haddow Editorial for the Special Issue on Theoretical Foundations of Evolutionary Computation. 625-627 2014 18 IEEE Trans. Evol. Comput. 5 https://doi.org/10.1109/TEVC.2014.2350673 db/journals/tec/tec18.html#NeumannDLH14

Xujin Chen Benjamin Doerr Carola Doerr Xiaodong Hu 0001 Weidong Ma Rob van Stee The Price of Anarchy for Selfish Ring Routing is Two. 8:1-8:24 2014 2 ACM Trans. Economics and Comput. 2 https://doi.org/10.1145/2548545 db/journals/teco/teco2.html#ChenDDHMS14

Benjamin Doerr Marvin Künnemann Tight Analysis of Randomized Rumor Spreading in Complete Graphs. 82-91 2014 ANALCO https://doi.org/10.1137/1.9781611973204.8 conf/analco/2014 db/conf/analco/analco2014.html#DoerrK14 Benjamin Doerr Carola Doerr Black-box complexity: from complexity theory to playing mastermind. 623-646 2014 GECCO (Companion) https://doi.org/10.1145/2598394.2605352 conf/gecco/2014c db/conf/gecco/gecco2014c.html#DoerrD14a Sylvain Colin Benjamin Doerr Gaspard Férey Monotonic functions in EC: anything but monotone! 753-760 2014 GECCO https://doi.org/10.1145/2576768.2598338 conf/gecco/2014 db/conf/gecco/gecco2014.html#ColinDF14 Benjamin Doerr Carola Doerr Timo Kötzing Unbiased black-box complexities of jump functions: how to cross large plateaus. 769-776 2014 GECCO https://doi.org/10.1145/2576768.2598341 conf/gecco/2014 db/conf/gecco/gecco2014.html#DoerrDK14 Benjamin Doerr Carola Doerr The impact of random initialization on the runtime of randomized search heuristics. 1375-1382 2014 GECCO https://doi.org/10.1145/2576768.2598359 conf/gecco/2014 db/conf/gecco/gecco2014.html#DoerrD14

Benjamin Doerr Carola Doerr Timo Kötzing Unbiased Black-Box Complexities of Jump Functions - How to Cross Large Plateaus. 2014 abs/1403.7806 CoRR http://arxiv.org/abs/1403.7806 db/journals/corr/corr1403.html#DoerrDK14

Benjamin Doerr Leslie Ann Goldberg Adaptive Drift Analysis. 224-250 2013 65 Algorithmica 1 https://doi.org/10.1007/s00453-011-9585-3 db/journals/algorithmica/algorithmica65.html#DoerrG13

Benjamin Doerr Anna Huber Ariel Levavi Strong robustness of randomized rumor spreading protocols. 778-793 2013 161 Discret. Appl. Math. 6 https://doi.org/10.1016/j.dam.2012.10.014 db/journals/dam/dam161.html#DoerrHL13

Benjamin Doerr Thomas Jansen 0001 Dirk Sudholt Carola Winzen Christine Zarges Mutation Rate Matters Even When Optimizing Monotonic Functions. 1-27 2013 21 Evol. Comput. 1 https://doi.org/10.1162/EVCO_a_00055 https://www.wikidata.org/entity/Q51508982 db/journals/ec/ec21.html#DoerrJSWZ13

Benjamin Doerr Improved approximation algorithms for the Min-Max Selecting Items problem. 747-749 2013 113 Inf. Process. Lett. 19-21 https://doi.org/10.1016/j.ipl.2013.07.011 db/journals/ipl/ipl113.html#Doerr13

Benjamin Doerr Daniel Johannsen Timo Kötzing Frank Neumann 0001 Madeleine Theile More effective crossover operators for the all-pairs shortest path problem. 12-26 2013 471 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.10.059 db/journals/tcs/tcs471.html#DoerrJKNT13

Benjamin Doerr Timo Kötzing Johannes Lengler Carola Winzen Black-box complexities of combinatorial problems. 84-106 2013 471 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.10.039 db/journals/tcs/tcs471.html#DoerrKLW13

Peyman Afshani Manindra Agrawal Benjamin Doerr Carola Doerr Kasper Green Larsen Kurt Mehlhorn The Query Complexity of Finding a Hidden Permutation. 1-11 2013 Space-Efficient Data Structures, Streams, and Algorithms https://doi.org/10.1007/978-3-642-40273-9_1 conf/birthday/2013munro db/conf/birthday/munro2013.html#AfshaniADDLM13 Benjamin Doerr Marvin Künnemann Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations. 424-431 2013 IEEE Congress on Evolutionary Computation https://doi.org/10.1109/CEC.2013.6557600 conf/cec/2013 db/conf/cec/cec2013.html#DoerrK13 Benjamin Doerr Bojana Kodric Marco Voigt Lower bounds for the runtime of a global multi-objective evolutionary algorithm. 432-439 2013 IEEE Congress on Evolutionary Computation https://doi.org/10.1109/CEC.2013.6557601 conf/cec/2013 db/conf/cec/cec2013.html#DoerrKV13 Benjamin Doerr Dirk Sudholt Carsten Witt When do evolutionary algorithms optimize separable functions in parallel? 51-64 2013 FOGA https://doi.org/10.1145/2460239.2460245 https://www.wikidata.org/entity/Q57200606 conf/foga/2013 db/conf/foga/foga2013.html#DoerrSW13 Benjamin Doerr Paul Fischer Astrid Hilbert Carsten Witt Evolutionary algorithms for the detection of structural breaks in time series: extended abstract. 119-120 2013 GECCO (Companion) https://doi.org/10.1145/2464576.2464635 https://www.wikidata.org/entity/Q57200597 conf/gecco/2013c db/conf/gecco/gecco2013c.html#DoerrFHW13 Benjamin Doerr Carola Doerr Black-box complexity: from complexity theory to playing mastermind. 617-640 2013 GECCO (Companion) https://doi.org/10.1145/2464576.2482680 conf/gecco/2013c db/conf/gecco/gecco2013c.html#DoerrD13 Benjamin Doerr Carola Doerr Franziska Ebel Lessons from the black-box: fast crossover-based genetic algorithms. 781-788 2013 GECCO https://doi.org/10.1145/2463372.2463480 conf/gecco/2013 db/conf/gecco/gecco2013.html#DoerrDE13 Benjamin Doerr Thomas Jansen 0001 Carsten Witt Christine Zarges A method to derive fixed budget results from expected optimisation times. 1581-1588 2013 GECCO https://doi.org/10.1145/2463372.2463565 https://www.wikidata.org/entity/Q57200593 conf/gecco/2013 db/conf/gecco/gecco2013.html#DoerrJWZ13 Benjamin Doerr Marvin Künnemann How the (1+λ) evolutionary algorithm optimizes linear functions. 1589-1596 2013 GECCO https://doi.org/10.1145/2463372.2463569 conf/gecco/2013 db/conf/gecco/gecco2013.html#DoerrK13 Karl Bringmann Benjamin Doerr Adrian Neumann Jakub Sliacan Online Checkpointing with Improved Worst-Case Guarantees. 255-266 2013 ICALP (1) https://doi.org/10.1007/978-3-642-39206-1_22 conf/icalp/2013-1 db/conf/icalp/icalp2013-1.html#BringmannDNS13 Benjamin Doerr Reto Spöhel Henning Thomas Carola Winzen Playing Mastermind with Many Colors. 695-704 2013 SODA https://doi.org/10.1137/1.9781611973105.50 conf/soda/2013 db/conf/soda/soda2013.html#DoerrSTW13 Karl Bringmann Benjamin Doerr Adrian Neumann Jakub Sliacan Online checkpointing with improved worst-case guarantees. 23-26 2013 CTW conf/colognetwente/2013 db/conf/colognetwente/colognetwente2013.html#BringmannDNS13

Benjamin Doerr Anton V. Eremeev Frank Neumann 0001 Madeleine Theile Christian Thyssen Evolutionary Algorithms and Dynamic Programming http://arxiv.org/abs/1301.4096 2013 CoRR abs/1301.4096 db/journals/corr/corr1301.html#abs-1301-4096

Karl Bringmann Benjamin Doerr Adrian Neumann Jakub Sliacan Online Checkpointing with Improved Worst-Case Guarantees http://arxiv.org/abs/1302.4216 2013 CoRR abs/1302.4216 db/journals/corr/corr1302.html#abs-1302-4216

Benjamin Doerr Winkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions http://arxiv.org/abs/1303.7205 2013 CoRR abs/1303.7205 db/journals/corr/corr1303.html#abs-1303-7205

Benjamin Doerr Improved Approximation Algorithms for the Min-Max Selecting Items Problem http://arxiv.org/abs/1304.7403 2013 CoRR abs/1304.7403 db/journals/corr/corr1304.html#abs-1304-7403

Benjamin Doerr Carola Doerr Collecting Coupons with Random Initial Stake. 2013 CoRR http://arxiv.org/abs/1308.6384 abs/1308.6384 db/journals/corr/corr1308.html#DoerrD13

Benjamin Doerr Robert Elsässer Pierre Fraigniaud Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042). 94-110 2013 3 Dagstuhl Reports 1 https://doi.org/10.4230/DagRep.3.1.94 db/journals/dagstuhl-reports/dagstuhl-reports3.html#DoerrEF13

Benjamin Doerr Nikolaus Hansen Jonathan L. Shapiro L. Darrell Whitley Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271). 1-28 2013 3 Dagstuhl Reports 7 https://doi.org/10.4230/DagRep.3.7.1 db/journals/dagstuhl-reports/dagstuhl-reports3.html#DoerrHSW13

Benjamin Doerr Daniel Johannsen Carola Winzen Multiplicative Drift Analysis. 673-697 2012 64 Algorithmica 4 https://doi.org/10.1007/s00453-012-9622-x db/journals/algorithmica/algorithmica64.html#DoerrJW12

Benjamin Doerr Mahmoud Fouz Tobias Friedrich 0001 Why rumors spread so quickly in social networks. 70-75 2012 55 Commun. ACM 6 https://doi.org/10.1145/2184319.2184338 db/journals/cacm/cacm55.html#DoerrFF12

Benjamin Doerr Carola Winzen Memory-restricted black-box complexity of OneMax. 32-34 2012 112 Inf. Process. Lett. 1-2 https://doi.org/10.1016/j.ipl.2011.10.004 db/journals/ipl/ipl112.html#DoerrW12

Benjamin Doerr Edda Happ Christian Klein 0001 Crossover can provably be useful in evolutionary computation. 17-33 2012 425 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2010.10.035 db/journals/tcs/tcs425.html#DoerrHK12

Benjamin Doerr Daniel Johannsen Carola Winzen Non-existence of linear universal drift functions. 71-86 2012 436 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.01.048 db/journals/tcs/tcs436.html#DoerrJW12

Benjamin Doerr Reto Spöhel Henning Thomas Carola Winzen Playing Mastermind with Many Colors. 108-111 2012 CTW conf/colognetwente/2012 db/conf/colognetwente/colognetwente2012.html#DoerrSTW12 Benjamin Doerr Ashish Ranjan Hota Timo Kötzing Ants easily solve stochastic shortest path problems. 17-24 2012 GECCO https://doi.org/10.1145/2330163.2330167 conf/gecco/2012 db/conf/gecco/gecco2012.html#DoerrHK12 Benjamin Doerr Black-box complexity: from complexity theory to playing mastermind. 1079-1092 2012 GECCO (Companion) https://doi.org/10.1145/2330784.2330931 conf/gecco/2012c db/conf/gecco/gecco2012c.html#Doerr12 Benjamin Doerr Carola Winzen Reducing the arity in unbiased black-box complexity. 1309-1316 2012 GECCO https://doi.org/10.1145/2330163.2330345 conf/gecco/2012 db/conf/gecco/gecco2012.html#DoerrW12 Benjamin Doerr Sebastian Pohl Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet. 1317-1324 2012 GECCO https://doi.org/10.1145/2330163.2330346 conf/gecco/2012 db/conf/gecco/gecco2012.html#DoerrP12 Benjamin Doerr Mahmoud Fouz Tobias Friedrich 0001 Experimental Analysis of Rumor Spreading in Social Networks. 159-173 2012 MedAlg https://doi.org/10.1007/978-3-642-34862-4_12 conf/medalg/2012 db/conf/medalg/medalg2012.html#DoerrFF12 Benjamin Doerr Carola Winzen Playing Mastermind With Constant-Size Memory. 441-452 2012 STACS https://doi.org/10.4230/LIPIcs.STACS.2012.441 conf/stacs/2012 db/conf/stacs/stacs2012.html#DoerrW12 Benjamin Doerr Mahmoud Fouz Tobias Friedrich 0001 Asynchronous Rumor Spreading in Preferential Attachment Graphs. 307-315 2012 SWAT https://doi.org/10.1007/978-3-642-31155-0_27 conf/swat/2012 db/conf/swat/swat2012.html#DoerrFF12 Xujin Chen Benjamin Doerr Xiaodong Hu 0001 Weidong Ma Rob van Stee Carola Winzen The Price of Anarchy for Selfish Ring Routing Is Two. 420-433 2012 WINE https://doi.org/10.1007/978-3-642-35311-6_31 conf/wine/2012 db/conf/wine/wine2012.html#ChenDHMSW12

Benjamin Doerr Carola Winzen Reducing the Arity in Unbiased Black-Box Complexity http://arxiv.org/abs/1203.4111 2012 CoRR abs/1203.4111 db/journals/corr/corr1203.html#abs-1203-4111

Benjamin Doerr Daniel Johannsen Timo Kötzing Frank Neumann 0001 Madeleine Theile More Effective Crossover Operators for the All-Pairs Shortest Path Problem http://arxiv.org/abs/1207.0369 2012 CoRR abs/1207.0369 db/journals/corr/corr1207.html#abs-1207-0369

Benjamin Doerr Reto Spöhel Henning Thomas Carola Winzen Playing Mastermind with Many Colors http://arxiv.org/abs/1207.0773 2012 CoRR abs/1207.0773 db/journals/corr/corr1207.html#abs-1207-0773

Benjamin Doerr Shay Moran Shlomo Moran Carola Winzen Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity http://arxiv.org/abs/1209.6158 2012 CoRR abs/1209.6158 db/journals/corr/corr1209.html#abs-1209-6158

Xujin Chen Benjamin Doerr Xiaodong Hu 0001 Weidong Ma Rob van Stee Carola Winzen The Price of Anarchy for Selfish Ring Routing is Two http://arxiv.org/abs/1210.0230 2012 CoRR abs/1210.0230 db/journals/corr/corr1210.html#abs-1210-0230

Benjamin Doerr A Lower Bound for the Discrepancy of a Random Point Set http://arxiv.org/abs/1210.0572 2012 CoRR abs/1210.0572 db/journals/corr/corr1210.html#abs-1210-0572

Benjamin Doerr Carola Winzen Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes http://arxiv.org/abs/1210.6465 2012 CoRR abs/1210.6465 db/journals/corr/corr1210.html#abs-1210-6465

Peyman Afshani Manindra Agrawal Benjamin Doerr Carola Winzen Kasper Green Larsen Kurt Mehlhorn The Deterministic and Randomized Query Complexity of a Simple Guessing Game. TR12-087 2012 TR12 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2012/087 db/journals/eccc/eccc19.html#AfshaniADCLM12

Benjamin Doerr Thomas Jansen 0001 Theory of Evolutionary Computation. 299-300 2011 59 Algorithmica 3 https://doi.org/10.1007/s00453-010-9472-3 db/journals/algorithmica/algorithmica59.html#DoerrJ11

Benjamin Doerr Edda Happ Christian Klein 0001 Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem. 673-691 2011 19 Evol. Comput. 4 https://doi.org/10.1162/EVCO_a_00047 https://www.wikidata.org/entity/Q51540331 db/journals/ec/ec19.html#DoerrHK11

Benjamin Doerr Mahmoud Fouz Asymptotically Optimal Randomized Rumor Spreading. 297-302 2011 38 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.09.049 db/journals/endm/endm38.html#DoerrF11

Benjamin Doerr Mahmoud Fouz Tobias Friedrich 0001 Social Networks Spread Rumors in Sublogarithmic Time. 303-308 2011 38 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.09.050 db/journals/endm/endm38.html#DoerrFF11

Benjamin Doerr Mahmoud Fouz Quasi-random rumor spreading: Reducing randomness can be costly. 227-230 2011 111 Inf. Process. Lett. 5 https://doi.org/10.1016/j.ipl.2010.11.006 db/journals/ipl/ipl111.html#DoerrF11

Benjamin Doerr Tobias Friedrich 0001 Marvin Künnemann Thomas Sauerwald Quasirandom rumor spreading: An experimental analysis. 2011 16 ACM J. Exp. Algorithmics https://doi.org/10.1145/1963190.2025379 db/journals/jea/jea16.html#DoerrFKS11

Benjamin Doerr Frank Neumann 0001 Dirk Sudholt Carsten Witt Runtime analysis of the 1-ANT ant colony optimizer. 1629-1644 2011 412 Theor. Comput. Sci. 17 https://doi.org/10.1016/j.tcs.2010.12.030 https://www.wikidata.org/entity/Q57200622 db/journals/tcs/tcs412.html#DoerrNSW11

Benjamin Doerr Anton V. Eremeev Frank Neumann 0001 Madeleine Theile Christian Thyssen Evolutionary algorithms and dynamic programming. 6020-6035 2011 412 Theor. Comput. Sci. 43 https://doi.org/10.1016/j.tcs.2011.07.024 db/journals/tcs/tcs412.html#DoerrENTT11

Benjamin Doerr Carola Winzen Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes. 205-216 2011 Artificial Evolution https://doi.org/10.1007/978-3-642-35533-2_18 conf/ae/2011 db/conf/ae/ae2011.html#DoerrW11 Benjamin Doerr Marvin Künnemann Magnus Wahlström Dependent Randomized Rounding: The Bipartite Case. 96-106 2011 ALENEX https://doi.org/10.1137/1.9781611972917.10 conf/alenex/2011 db/conf/alenex/alenex2011.html#DoerrKW11 Tetsuo Asano Benjamin Doerr Memory-Constrained Algorithms for Shortest Path Problem. 2011 CCCG http://www.cccg.ca/proceedings/2011/papers/paper15.pdf conf/cccg/2011 db/conf/cccg/cccg2011.html#AsanoD11 Benjamin Doerr Carola Winzen Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. 15-28 2011 CSR https://doi.org/10.1007/978-3-642-20712-9_2 conf/csr/2011 db/conf/csr/csr2011.html#DoerrW11 Benjamin Doerr Daniel Johannsen Martin Schmidt Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. 119-126 2011 FOGA https://doi.org/10.1145/1967654.1967665 conf/foga/2011 db/conf/foga/foga2011.html#DoerrJS11 Benjamin Doerr Daniel Johannsen Timo Kötzing Per Kristian Lehre Markus Wagner 0007 Carola Winzen Faster black-box algorithms through higher arity operators. 163-172 2011 FOGA https://doi.org/10.1145/1967654.1967669 conf/foga/2011 db/conf/foga/foga2011.html#DoerrJKLWW11 Benjamin Doerr Johannes Lengler Timo Kötzing Carola Winzen Black-box complexities of combinatorial problems. 981-988 2011 GECCO https://doi.org/10.1145/2001576.2001710 conf/gecco/2011 db/conf/gecco/gecco2011.html#DoerrLKW11 Benjamin Doerr Drift analysis. 1311-1320 2011 GECCO (Companion) https://doi.org/10.1145/2001858.2002138 conf/gecco/2011c db/conf/gecco/gecco2011c.html#Doerr11 Benjamin Doerr Timo Kötzing Carola Winzen Too fast unbiased black-box algorithms. 2043-2050 2011 GECCO https://doi.org/10.1145/2001576.2001851 https://www.wikidata.org/entity/Q130971123 conf/gecco/2011 db/conf/gecco/gecco2011.html#DoerrKW11 Benjamin Doerr Mahmoud Fouz Carsten Witt Sharp bounds by probability-generating functions and variable drift. 2083-2090 2011 GECCO https://doi.org/10.1145/2001576.2001856 https://www.wikidata.org/entity/Q57200625 conf/gecco/2011 db/conf/gecco/gecco2011.html#DoerrFW11 Benjamin Doerr Mahmoud Fouz Asymptotically Optimal Randomized Rumor Spreading. 502-513 2011 ICALP (2) https://doi.org/10.1007/978-3-642-22012-8_40 conf/icalp/2011-2 db/conf/icalp/icalp2011-2.html#DoerrF11 Markus Mainberger Sebastian Hoffmann 0001 Joachim Weickert Ching Hoo Tang Daniel Johannsen Frank Neumann 0001 Benjamin Doerr Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. 26-37 2011 SSVM https://doi.org/10.1007/978-3-642-24785-9_3 conf/scalespace/2011 db/conf/scalespace/ssvm2011.html#MainbergerHWTJND11 Benjamin Doerr Leslie Ann Goldberg Lorenz Minder Thomas Sauerwald Christian Scheideler Stabilizing consensus with the power of two choices. 149-158 2011 SPAA https://doi.org/10.1145/1989493.1989516 conf/spaa/2011 db/conf/spaa/spaa2011.html#DoerrGMSS11 Benjamin Doerr Mahmoud Fouz Tobias Friedrich 0001 Social networks spread rumors in sublogarithmic time. 21-30 2011 STOC https://doi.org/10.1145/1993636.1993640 conf/stoc/2011 db/conf/stoc/stoc2011.html#DoerrFF11 Benjamin Doerr Analyzing Randomized Search Heuristics: Tools from Probability Theory. 1-20 2011 Theory of Randomized Search Heuristics https://doi.org/10.1142/9789814282673_0001 books/ws/11/AD2011 db/books/collections/AD2011.html#Doerr11 Anne Auger Benjamin Doerr Theory of Randomized Search Heuristics: Foundations and Recent Developments. Theory of Randomized Search Heuristics World Scientific 2011 1 Series on Theoretical Computer Science 978-981-4282-66-6 https://doi.org/10.1142/7438 db/books/collections/AD2011.html

Benjamin Doerr Daniel Johannsen Carola Winzen Multiplicative Drift Analysis http://arxiv.org/abs/1101.0776 2011 CoRR abs/1101.0776 db/journals/corr/corr1101.html#abs-1101-0776

Benjamin Doerr Carola Winzen Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity http://arxiv.org/abs/1102.1140 2011 CoRR abs/1102.1140 db/journals/corr/corr1102.html#abs-1102-1140

Benjamin Doerr Leslie Ann Goldberg Adaptive Drift Analysis http://arxiv.org/abs/1108.0295 2011 CoRR abs/1108.0295 db/journals/corr/corr1108.html#abs-1108-0295

Benjamin Doerr Timo Kötzing Johannes Lengler Carola Winzen Black-Box Complexities of Combinatorial Problems http://arxiv.org/abs/1108.0342 2011 CoRR abs/1108.0342 db/journals/corr/corr1108.html#abs-1108-0342

Benjamin Doerr Carola Winzen Playing Mastermind With Constant-Size Memory http://arxiv.org/abs/1110.3619 2011 CoRR abs/1110.3619 db/journals/corr/corr1110.html#abs-1110-3619

Benjamin Doerr Carola Winzen Memory-Restricted Black-Box Complexity. TR11-092 2011 TR11 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2011/092 db/journals/eccc/eccc18.html#BenjaminC11

Benjamin Doerr Frank Neumann 0001 Ingo Wegener Editorial. 119-120 2010 57 Algorithmica 1 https://doi.org/10.1007/s00453-009-9373-5 db/journals/algorithmica/algorithmica57.html#DoerrNW10

Benjamin Doerr Frank Neumann 0001 In Memoriam: Ingo Wegener. 541-542 2010 58 Algorithmica 3 https://doi.org/10.1007/s00453-009-9372-6 db/journals/algorithmica/algorithmica58.html#DoerrN10

Benjamin Doerr Michael Gnewuch Magnus Wahlström Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. 490-507 2010 26 J. Complex. 5 https://doi.org/10.1016/j.jco.2010.03.004 db/journals/jc/jc26.html#DoerrGW10

Joshua N. Cooper Benjamin Doerr Tobias Friedrich 0001 Joel Spencer Deterministic random walks on regular trees. 353-366 2010 37 Random Struct. Algorithms 3 https://doi.org/10.1002/rsa.20314 db/journals/rsa/rsa37.html#CooperDFS10

Benjamin Doerr Mahmoud Fouz Hereditary Discrepancies in Different Numbers of Colors II. 1205-1213 2010 24 SIAM J. Discret. Math. 3 https://doi.org/10.1137/090669620 db/journals/siamdm/siamdm24.html#DoerrF10

Benjamin Doerr Daniel Johannsen Carola Winzen Drift analysis and linear functions revisited. 1-8 2010 IEEE Congress on Evolutionary Computation https://doi.org/10.1109/CEC.2010.5586097 conf/cec/2010 db/conf/cec/cec2010.html#DoerrJW10 Benjamin Doerr Daniel Johannsen Edge-based representation beats vertex-based representation in shortest path problems. 759-766 2010 GECCO https://doi.org/10.1145/1830483.1830618 conf/gecco/2010 db/conf/gecco/gecco2010.html#DoerrJ10 Benjamin Doerr Daniel Johannsen Carola Winzen Multiplicative drift analysis. 1449-1456 2010 GECCO https://doi.org/10.1145/1830483.1830748 conf/gecco/2010 db/conf/gecco/gecco2010.html#DoerrJW10 Benjamin Doerr Mahmoud Fouz Carsten Witt Quasirandom evolutionary algorithms. 1457-1464 2010 GECCO https://doi.org/10.1145/1830483.1830749 https://www.wikidata.org/entity/Q57200635 conf/gecco/2010 db/conf/gecco/gecco2010.html#DoerrFW10 Süntje Böttcher Benjamin Doerr Frank Neumann 0001 Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. 1-10 2010 PPSN (1) https://doi.org/10.1007/978-3-642-15844-5_1 conf/ppsn/2010-1 db/conf/ppsn/ppsn2010-1.html#BottcherDN10 Benjamin Doerr Leslie Ann Goldberg Adaptive Drift Analysis. 32-41 2010 PPSN (1) https://doi.org/10.1007/978-3-642-15844-5_4 conf/ppsn/2010-1 db/conf/ppsn/ppsn2010-1.html#DoerrG10 Benjamin Doerr Thomas Jansen 0001 Dirk Sudholt Carola Winzen Christine Zarges Optimizing Monotone Functions Can Be Difficult. 42-51 2010 PPSN (1) https://doi.org/10.1007/978-3-642-15844-5_5 conf/ppsn/2010-1 db/conf/ppsn/ppsn2010-1.html#DoerrJSWZ10 Benjamin Doerr Leslie Ann Goldberg Drift Analysis with Tail Bounds. 174-183 2010 PPSN (1) https://doi.org/10.1007/978-3-642-15844-5_18 conf/ppsn/2010-1 db/conf/ppsn/ppsn2010-1.html#DoerrG10a Benjamin Doerr Daniel Johannsen Timo Kötzing Frank Neumann 0001 Madeleine Theile More Effective Crossover Operators for the All-Pairs Shortest Path Problem. 184-193 2010 PPSN (1) https://doi.org/10.1007/978-3-642-15844-5_19 conf/ppsn/2010-1 db/conf/ppsn/ppsn2010-1.html#DoerrJKNT10 Benjamin Doerr Leslie Ann Goldberg Lorenz Minder Thomas Sauerwald Christian Scheideler Brief Announcement: Stabilizing Consensus with the Power of Two Choices. 528-530 2010 DISC https://doi.org/10.1007/978-3-642-15763-9_50 conf/wdag/2010 db/conf/wdag/disc2010.html#DoerrGMSS10 Benjamin Doerr Marvin Künnemann Magnus Wahlström Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. 190-201 2010 SEA https://doi.org/10.1007/978-3-642-13193-6_17 conf/wea/2010 db/conf/wea/sea2010.html#DoerrKW10

Benjamin Doerr Anna Huber Ariel Levavi Strong Robustness of Randomized Rumor Spreading Protocols http://arxiv.org/abs/1001.3056 2010 CoRR abs/1001.3056 db/journals/corr/corr1001.html#abs-1001-3056

Joshua N. Cooper Benjamin Doerr Tobias Friedrich 0001 Joel Spencer Deterministic Random Walks on Regular Trees http://arxiv.org/abs/1006.1441 2010 CoRR abs/1006.1441 db/journals/corr/corr1006.html#abs-1006-1441

Benjamin Doerr Marvin Künnemann Magnus Wahlström Randomized Rounding for Routing and Covering Problems: Experiments and Improvements http://arxiv.org/abs/1007.0372 2010 CoRR abs/1007.0372 db/journals/corr/corr1007.html#abs-1007-0372

Benjamin Doerr Mahmoud Fouz Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly http://arxiv.org/abs/1008.0501 2010 CoRR abs/1008.0501 db/journals/corr/corr1008.html#abs-1008-0501

Benjamin Doerr Thomas Jansen 0001 Dirk Sudholt Carola Winzen Christine Zarges Optimizing Monotone Functions Can Be Difficult http://arxiv.org/abs/1010.1429 2010 CoRR abs/1010.1429 db/journals/corr/corr1010.html#abs-1010-1429

Benjamin Doerr Mahmoud Fouz Asymptotically Optimal Randomized Rumor Spreading http://arxiv.org/abs/1011.1868 2010 CoRR abs/1011.1868 db/journals/corr/corr1011.html#abs-1011-1868

Benjamin Doerr Daniel Johannsen Carola Winzen Non-Existence of Linear Universal Drift Functions http://arxiv.org/abs/1011.3466 2010 CoRR abs/1011.3466 db/journals/corr/corr1011.html#abs-1011-3466

Benjamin Doerr Daniel Johannsen Timo Kötzing Per Kristian Lehre Markus Wagner 0007 Carola Winzen Faster Black-Box Algorithms Through Higher Arity Operators http://arxiv.org/abs/1012.0952 2010 CoRR abs/1012.0952 db/journals/corr/corr1012.html#abs-1012-0952

Benjamin Doerr Tobias Friedrich 0001 Thomas Sauerwald Quasirandom Rumor Spreading http://arxiv.org/abs/1012.5351 2010 CoRR abs/1012.5351 db/journals/corr/corr1012.html#abs-1012-5351

Benjamin Doerr Tobias Friedrich 0001 Marvin Künnemann Thomas Sauerwald Quasirandom Rumor Spreading: An Experimental Analysis http://arxiv.org/abs/1012.5357 2010 CoRR abs/1012.5357 db/journals/corr/corr1012.html#abs-1012-5357

Spyros Angelopoulos 0001 Benjamin Doerr Anna Huber Konstantinos Panagiotou Tight Bounds for Quasirandom Rumor Spreading. 2009 16 Electron. J. Comb. 1 https://doi.org/10.37236/191 db/journals/combinatorics/combinatorics16.html#AngelopoulosDHP09

Benjamin Doerr Tobias Friedrich 0001 Deterministic Random Walks on the Two-Dimensional Grid. 123-144 2009 18 Comb. Probab. Comput. 1-2 https://doi.org/10.1017/S0963548308009589 db/journals/cpc/cpc18.html#DoerrF09

Benjamin Doerr Tobias Friedrich 0001 Thomas Sauerwald Quasirandom Rumor Spreading on Expanders. 243-247 2009 34 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2009.07.040 db/journals/endm/endm34.html#DoerrFS09

Benjamin Doerr Mahmoud Fouz A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading. 335-339 2009 34 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2009.07.055 db/journals/endm/endm34.html#DoerrF09

Benjamin Doerr Tobias Friedrich 0001 Marvin Künnemann Thomas Sauerwald Quasirandom Rumor Spreading: An Experimental Analysis. 145-153 2009 ALENEX https://doi.org/10.1137/1.9781611972894.14 conf/alenex/2009 db/conf/alenex/alenex2009.html#DoerrFKS09 Benjamin Doerr Magnus Wahlström Randomized Rounding in the Presence of a Cardinality Constraint. 162-174 2009 ALENEX https://doi.org/10.1137/1.9781611972894.16 conf/alenex/2009 db/conf/alenex/alenex2009.html#DoerrW09 Benjamin Doerr Introducing Quasirandomness to Computer Science. 99-111 2009 Efficient Algorithms https://doi.org/10.1007/978-3-642-03456-5_6 conf/birthday/2009mehlhorn db/conf/birthday/mehlhorn2009.html#Doerr09 Surender Baswana Somenath Biswas Benjamin Doerr Tobias Friedrich 0001 Piyush P. Kurur Frank Neumann 0001 Computing single source shortest paths using single-objective fitness. 59-66 2009 FOGA https://doi.org/10.1145/1527125.1527134 conf/foga/2009 db/conf/foga/foga2009.html#BaswanaBDFKN09 Benjamin Doerr Madeleine Theile Improved analysis methods for crossover-based algorithms. 247-254 2009 GECCO https://doi.org/10.1145/1569901.1569937 conf/gecco/2009g db/conf/gecco/gecco2009.html#DoerrT09 Benjamin Doerr Anton V. Eremeev Christian Horoba Frank Neumann 0001 Madeleine Theile Evolutionary algorithms and dynamic programming. 771-778 2009 GECCO https://doi.org/10.1145/1569901.1570008 conf/gecco/2009g db/conf/gecco/gecco2009.html#DoerrEHNT09 Benjamin Doerr Mahmoud Fouz Martin Schmidt Magnus Wahlström BBOB: Nelder-Mead with resize and halfruns. 2239-2246 2009 GECCO (Companion) https://doi.org/10.1145/1570256.1570312 conf/gecco/2009c db/conf/gecco/gecco2009c.html#DoerrFSW09 Benjamin Doerr Tobias Friedrich 0001 Thomas Sauerwald Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. 366-377 2009 ICALP (1) https://doi.org/10.1007/978-3-642-02927-1_31 conf/icalp/2009-1 db/conf/icalp/icalp2009-1.html#DoerrFS09 Benjamin Doerr Anna Huber Ariel Levavi Strong Robustness of Randomized Rumor Spreading Protocols. 812-821 2009 ISAAC https://doi.org/10.1007/978-3-642-10631-6_82 conf/isaac/2009 db/conf/isaac/isaac2009.html#DoerrHL09 Benjamin Doerr Leslie Ann Goldberg Lorenz Minder Thomas Sauerwald Christian Scheideler Stabilizing Consensus with the Power of Two Choices. 2009 Algorithmic Methods for Distributed Cooperative Systems http://drops.dagstuhl.de/opus/volltexte/2010/2429/ conf/dagstuhl/2009P9371 db/conf/dagstuhl/P9371.html#DoerrGMSS09

Benjamin Doerr Michael Gnewuch Peter Kritzer Friedrich Pillichshammer Component-by-component construction of low-discrepancy point sets of small size. 129-149 2008 14 Monte Carlo Methods Appl. 2 https://doi.org/10.1515/MCMA.2008.007 db/journals/mcma/mcma14.html#DoerrGKP08

Benjamin Doerr Edda Happ Directed trees: A powerful representation for sorting and ordering problems. 3606-3613 2008 IEEE Congress on Evolutionary Computation https://doi.org/10.1109/CEC.2008.4631286 conf/cec/2008 db/conf/cec/cec2008.html#DoerrH08 Benjamin Doerr Edda Happ Christian Klein 0001 Crossover can provably be useful in evolutionary computation. 539-546 2008 GECCO https://doi.org/10.1145/1389095.1389202 conf/gecco/2008 db/conf/gecco/gecco2008.html#DoerrHK08 Benjamin Doerr Thomas Jansen 0001 Christian Klein 0001 Comparing global and local mutations on bit strings. 929-936 2008 GECCO https://doi.org/10.1145/1389095.1389274 conf/gecco/2008 db/conf/gecco/gecco2008.html#DoerrJK08 Benjamin Doerr Daniel Johannsen Ching Hoo Tang How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. 378-388 2008 PPSN https://doi.org/10.1007/978-3-540-87700-4_38 conf/ppsn/2008 db/conf/ppsn/ppsn2008.html#DoerrJT08 Joshua N. Cooper Benjamin Doerr Tobias Friedrich 0001 Joel Spencer Deterministic random walks on regular trees. 766-772 2008 SODA http://dl.acm.org/citation.cfm?id=1347082.1347166 conf/soda/2008 db/conf/soda/soda2008.html#CooperDFS08 Benjamin Doerr Tobias Friedrich 0001 Thomas Sauerwald Quasirandom rumor spreading. 773-781 2008 SODA http://dl.acm.org/citation.cfm?id=1347082.1347167 conf/soda/2008 db/conf/soda/soda2008.html#DoerrFS08

Benjamin Doerr Nils Hebbinghaus Frank Neumann 0001 Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. 401-410 2007 15 Evol. Comput. 4 https://doi.org/10.1162/evco.2007.15.4.401 https://www.wikidata.org/entity/Q51624487 db/journals/ec/ec15.html#DoerrHN07

Benjamin Doerr Matrix approximation and Tusnády's problem. 990-995 2007 28 Eur. J. Comb. 3 https://doi.org/10.1016/j.ejc.2005.09.006 db/journals/ejc/ejc28.html#Doerr07

Joshua N. Cooper Benjamin Doerr Joel H. Spencer Gábor Tardos Deterministic random walks on the integers. 2072-2090 2007 28 Eur. J. Comb. 8 https://doi.org/10.1016/j.ejc.2007.04.018 db/journals/ejc/ejc28.html#CooperDST07

Tobias Friedrich 0001 Benjamin Doerr Christian Klein 0001 Ralf Osbild Unbiased Matrix Rounding. 41-46 2007 28 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2007.01.007 db/journals/endm/endm28.html#FriedrichDKO07

Benjamin Doerr Johannes Lengler David Steurer The Interval Liar Game. 425-432 2007 28 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2007.01.060 db/journals/endm/endm28.html#DoerrLS07

Benjamin Doerr Partial Colorings of Unimodular Hypergraphs. 359-363 2007 29 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2007.07.061 db/journals/endm/endm29.html#Doerr07

Joshua N. Cooper Benjamin Doerr Tobias Friedrich 0001 Joel Spencer Deterministic Random Walks on Regular Trees. 509-513 2007 29 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2007.07.082 db/journals/endm/endm29.html#CooperDFS07

Nitin Ahuja Andreas Baltz Benjamin Doerr Ales Prívetivý Anand Srivastav On the minimum load coloring problem. 533-545 2007 5 J. Discrete Algorithms 3 https://doi.org/10.1016/j.jda.2006.09.001 db/journals/jda/jda5.html#AhujaBDPS07

Benjamin Doerr Roundings Respecting Hard Constraints. 467-483 2007 40 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-006-1318-7 db/journals/mst/mst40.html#Doerr07

Benjamin Doerr Daniel Johannsen Refined runtime analysis of a basic ant colony optimization algorithm. 501-507 2007 IEEE Congress on Evolutionary Computation https://doi.org/10.1109/CEC.2007.4424512 conf/cec/2007 db/conf/cec/cec2007.html#DoerrJ07 Benjamin Doerr Edda Happ Christian Klein 0001 A tight analysis of the (1 + 1)-EA for the single source shortest path problem. 1890-1895 2007 IEEE Congress on Evolutionary Computation https://doi.org/10.1109/CEC.2007.4424704 conf/cec/2007 db/conf/cec/cec2007.html#DoerrHK07 Benjamin Doerr Michael Gnewuch Nils Hebbinghaus Frank Neumann 0001 A rigorous view on neutrality. 2591-2597 2007 IEEE Congress on Evolutionary Computation https://doi.org/10.1109/CEC.2007.4424797 conf/cec/2007 db/conf/cec/cec2007.html#DoerrGHN07 Benjamin Doerr Christian Klein 0001 Tobias Storch Faster Evolutionary Algorithms by Superior Graph Representation. 245-250 2007 conf/foci/2007 FOCI https://doi.org/10.1109/FOCI.2007.372176 db/conf/foci/foci2007.html#DoerrKS07 Benjamin Doerr Frank Neumann 0001 Dirk Sudholt Carsten Witt On the runtime analysis of the 1-ANT ACO algorithm. 33-40 2007 conf/gecco/2007 GECCO https://doi.org/10.1145/1276958.1276964 https://www.wikidata.org/entity/Q57200670 db/conf/gecco/gecco2007.html#DoerrNSW07 Benjamin Doerr Daniel Johannsen Adjacency list matchings: an ideal genotype for cycle covers. 1203-1210 2007 conf/gecco/2007 GECCO https://doi.org/10.1145/1276958.1277192 db/conf/gecco/gecco2007.html#DoerrJ07 Benjamin Doerr Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. 441-452 2007 conf/stacs/2007 STACS https://doi.org/10.1007/978-3-540-70918-3_38 db/conf/stacs/stacs2007.html#Doerr07

Benjamin Doerr Michael Gnewuch Nils Hebbinghaus Discrepancy of Symmetric Products of Hypergraphs. 2006 13 Electron. J. Comb. 1 https://doi.org/10.37236/1066 db/journals/combinatorics/combinatorics13.html#DoerrGH06

Benjamin Doerr Non-independent randomized rounding and coloring. 650-659 2006 154 Discret. Appl. Math. 4 https://doi.org/10.1016/j.dam.2005.05.015 db/journals/dam/dam154.html#Doerr06

Benjamin Doerr Christian Klein 0001 Controlled Randomized Rounding. 39-40 2006 25 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2006.06.061 db/journals/endm/endm25.html#DoerrK06

Benjamin Doerr Tobias Friedrich 0001 Quasirandomness in Graphs. 61-64 2006 25 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2006.06.066 db/journals/endm/endm25.html#DoerrF06

Sachio Teramoto Tetsuo Asano Naoki Katoh Benjamin Doerr Inserting Points Uniformly at Every Instance. 2348-2356 2006 89-D IEICE Trans. Inf. Syst. 8 https://doi.org/10.1093/ietisy/e89-d.8.2348 db/journals/ieicet/ieicet89d.html#TeramotoAKD06

Benjamin Doerr Ulf Lorenz Error Propagation in Game Trees. 79-93 2006 64 Math. Methods Oper. Res. 1 https://doi.org/10.1007/s00186-006-0064-6 db/journals/mmor/mmor64.html#DoerrL06

Benjamin Doerr Matrix rounding with respect to small submatrices. 107-112 2006 28 Random Struct. Algorithms 1 https://doi.org/10.1002/rsa.20078 db/journals/rsa/rsa28.html#Doerr06

Benjamin Doerr Nils Hebbinghaus Sören Werth Improved bounds and schemes for the declustering problem. 123-132 2006 359 Theor. Comput. Sci. 1-3 https://doi.org/10.1016/j.tcs.2006.02.016 db/journals/tcs/tcs359.html#DoerrHW06

Joshua N. Cooper Benjamin Doerr Joel Spencer Gábor Tardos Deterministic Random Walks. 185-197 2006 ANALCO https://doi.org/10.1137/1.9781611972962.1 conf/analco/2006 db/conf/analco/analco2006.html#CooperDST06 Benjamin Doerr Christian Klein 0001 Unbiased Rounding of Rational Matrices. 200-211 2006 conf/fsttcs/2006 FSTTCS https://doi.org/10.1007/11944836_20 db/conf/fsttcs/fsttcs2006.html#DoerrK06 Benjamin Doerr Johannes Lengler David Steurer The Interval Liar Game. 318-327 2006 conf/isaac/2006 ISAAC https://doi.org/10.1007/11940128_33 db/conf/isaac/isaac2006.html#DoerrLS06 Benjamin Doerr Tobias Friedrich 0001 Deterministic Random Walks on the Two-Dimensional Grid. 474-483 2006 conf/isaac/2006 ISAAC https://doi.org/10.1007/11940128_48 db/conf/isaac/isaac2006.html#DoerrF06 Benjamin Doerr Nils Hebbinghaus Frank Neumann 0001 Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. 978-987 2006 conf/ppsn/2006 PPSN https://doi.org/10.1007/11844297_99 db/conf/ppsn/ppsn2006.html#DoerrHN06 Benjamin Doerr Generating Randomized Roundings with Cardinality Constraints and Derandomizations. 571-583 2006 conf/stacs/2006 STACS https://doi.org/10.1007/11672142_47 db/conf/stacs/stacs2006.html#Doerr06 Benjamin Doerr Tobias Friedrich 0001 Christian Klein 0001 Ralf Osbild Unbiased Matrix Rounding. 102-112 2006 conf/swat/2006 SWAT https://doi.org/10.1007/11785293_12 db/conf/swat/swat2006.html#DoerrFKO06

Benjamin Doerr Nils Hebbinghaus Sören Werth Improved Bounds and Schemes for the Declustering Problem http://arxiv.org/abs/cs/0603012 2006 CoRR abs/cs/0603012 db/journals/corr/corr0603.html#abs-cs-0603012

Benjamin Doerr Tobias Friedrich 0001 Christian Klein 0001 Ralf Osbild Unbiased Matrix Rounding http://arxiv.org/abs/cs/0604068 2006 CoRR abs/cs/0604068 db/journals/corr/corr0604.html#abs-cs-0604068

Benjamin Doerr Mahmoud Fouz Hereditary Discrepancies in Different Numbers of Colors II http://arxiv.org/abs/cs/0611126 2006 CoRR abs/cs/0611126 db/journals/corr/corr0611.html#abs-cs-0611126

Nils Hebbinghaus Benjamin Doerr Frank Neumann 0001 Speeding up Evolutionary Algorithms by Restricted Mutation Operators. 2006 TR06 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-083/index.html TR06-083 db/journals/eccc/eccc13.html#HebbinghausDN06

Benjamin Doerr Michael Gnewuch Anand Srivastav Bounds and constructions for the star-discrepancy via ?-covers. 691-709 2005 21 J. Complex. 5 https://doi.org/10.1016/j.jco.2005.05.002 db/journals/jc/jc21.html#DoerrGS05

Benjamin Doerr Matrix rounding with low error in small submatrices. 1067-1068 2005 conf/soda/2005 SODA http://dl.acm.org/citation.cfm?id=1070432.1070585 db/conf/soda/soda2005.html#Doerr05 Benjamin Doerr Roundings Respecting Hard Constraints. 617-628 https://doi.org/10.1007/978-3-540-31856-9_51 2005 conf/stacs/2005 STACS db/conf/stacs/stacs2005.html#Doerr05 Nitin Ahuja Andreas Baltz Benjamin Doerr Ales Prívetivý Anand Srivastav On the Minimum Load Coloring Problem. 15-26 2005 conf/waoa/2005 WAOA https://doi.org/10.1007/11671411_2 db/conf/waoa/waoa2005.html#AhujaBDPS05 Benjamin Doerr Tobias Friedrich 0001 Christian Klein 0001 Ralf Osbild Rounding of Sequences and Matrices, with Applications. 96-109 2005 conf/waoa/2005 WAOA https://doi.org/10.1007/11671411_8 db/conf/waoa/waoa2005.html#DoerrFKO05

Benjamin Doerr Linear Discrepancy of Totally Unimodular Matrices. 117-125 2004 24 Comb. 1 https://doi.org/10.1007/s00493-004-0007-x db/journals/combinatorica/combinatorica24.html#Doerr04

Benjamin Doerr Anand Srivastav Petra Wehr Discrepancy of Cartesian Products of Arithmetic Progressions. 2004 11 Electron. J. Comb. 1 https://doi.org/10.37236/1758 db/journals/combinatorics/combinatorics11.html#DoerrSW04

Nitin Ahuja Andreas Baltz Benjamin Doerr Anand Srivastav Coloring Graphs with Minimal Edge Load. 9-13 2004 17 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2004.03.005 db/journals/endm/endm17.html#AhujaBDS04

Benjamin Doerr Nils Hebbinghaus Sören Werth An Improved Discrepancy Approach to Declustering. 129-133 2004 17 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2004.03.026 db/journals/endm/endm17.html#DoerrHW04

Benjamin Doerr Global roundings of sequences. 113-116 2004 92 Inf. Process. Lett. 3 https://doi.org/10.1016/j.ipl.2004.07.002 db/journals/ipl/ipl92.html#Doerr04

Benjamin Doerr Nonindependent Randomized Rounding and an Application to Digital Halftoning. 299-317 2004 34 SIAM J. Comput. 2 https://doi.org/10.1137/S0097539703430154 db/journals/siamcomp/siamcomp34.html#Doerr04

Benjamin Doerr Typical rounding problems. 463-477 2004 312 Theor. Comput. Sci. 2-3 https://doi.org/10.1016/j.tcs.2003.10.035 db/journals/tcs/tcs312.html#Doerr04

Benjamin Doerr European tenure games. 339-351 2004 313 Theor. Comput. Sci. 3 https://doi.org/10.1016/j.tcs.2002.10.001 db/journals/tcs/tcs313.html#Doerr04a

Nitin Ahuja Andreas Baltz Benjamin Doerr Anand Srivastav Coloring Graphs with Minimal Edge Load. 16-20 2004 CTW conf/colognetwente/2004 db/conf/colognetwente/colognetwente2004.html#AhujaBDS04 Benjamin Doerr Nils Hebbinghaus Sören Werth An Improved Discrepancy Approach to Declustering. 114-118 2004 CTW conf/colognetwente/2004 db/conf/colognetwente/colognetwente2004.html#DoerrHW04 Benjamin Doerr Nils Hebbinghaus Sören Werth Improved Bounds and Schemes for the Declustering Problem. 760-771 https://doi.org/10.1007/978-3-540-28629-5_59 2004 conf/mfcs/2004 MFCS db/conf/mfcs/mfcs2004.html#DoerrHW04 Benjamin Doerr Matrix rounding and approximation. 575-576 2004 conf/soda/2004 SODA http://dl.acm.org/citation.cfm?id=982792.982878 db/conf/soda/soda2004.html#Doerr04

Benjamin Doerr Anand Srivastav Multicolour Discrepancies. 365-399 2003 12 Comb. Probab. Comput. 4 db/journals/cpc/cpc12.html#DoerrS03 https://doi.org/10.1017/S0963548303005662

Benjamin Doerr Non-independent randomized rounding. 506-507 2003 conf/soda/2003 SODA http://dl.acm.org/citation.cfm?id=644108.644192 db/conf/soda/soda2003.html#Doerr03

Benjamin Doerr Discrepancy in different numbers of colors. 63-70 2002 250 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(01)00271-0 db/journals/dm/dm250.html#Doerr02

Noga Alon Benjamin Doerr Tomasz Luczak 0001 Tomasz Schoen On the discrepancy of combinatorial rectangles. 205-215 2002 21 Random Struct. Algorithms 3-4 https://doi.org/10.1002/rsa.10055 db/journals/rsa/rsa21.html#AlonDLS02

Benjamin Doerr Typical Rounding Problems. 81-93 2002 conf/approx/2002 APPROX https://doi.org/10.1007/3-540-45753-4_9 db/conf/approx/approx2002.html#Doerr02 Benjamin Doerr Henning Schnieder Non-independent Randomized Rounding and an Application to Digital Halftoning. 399-410 2002 conf/esa/2002 ESA https://doi.org/10.1007/3-540-45749-6_37 db/conf/esa/esa2002.html#DoerrS02 Benjamin Doerr Antirandomizing the Wrong Game. 876-887 2002 conf/icalp/2002 ICALP https://doi.org/10.1007/3-540-45465-9_75 db/conf/icalp/icalp2002.html#Doerr02 Benjamin Doerr Balanced Coloring: Equally Easy for All Numbers of Colors? 112-120 2002 conf/stacs/2002 STACS https://doi.org/10.1007/3-540-45841-7_8 db/conf/stacs/stacs2002.html#Doerr02

Geir Agnarsson Benjamin Doerr Tomasz Schoen Coloring t-dimensional m-Boxes. 21-33 2001 226 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(00)00180-1 db/journals/dm/dm226.html#AgnarssonDS01

Benjamin Doerr Anand Srivastav Multi-Color Discrepancies - Extended Abstract -. 78-81 2001 7 Electron. Notes Discret. Math. https://doi.org/10.1016/S1571-0653(04)00229-X db/journals/endm/endm7.html#DoerrS01

Benjamin Doerr Anand Srivastav Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. 27-30 2001 8 Electron. Notes Discret. Math. https://doi.org/10.1016/S1571-0653(05)80071-X db/journals/endm/endm8.html#DoerrS01a

Benjamin Doerr Vector Balancing Games with Aging. 90-92 2001 10 Electron. Notes Discret. Math. https://doi.org/10.1016/S1571-0653(04)00367-1 db/journals/endm/endm10.html#Doerr01

Benjamin Doerr Vector Balancing Games with Aging. 219-233 2001 95 J. Comb. Theory A 2 https://doi.org/10.1006/jcta.2000.3163 db/journals/jct/jcta95.html#Doerr01

Benjamin Doerr Structured Randomized Rounding and Coloring. 461-471 2001 conf/fct/2001 FCT https://doi.org/10.1007/3-540-44669-9_53 db/conf/fct/fct2001.html#Doerr01 Benjamin Doerr Lattice approximation and linear discrepency of totally unimodular matrices. 119-125 2001 conf/soda/2001 SODA http://dl.acm.org/citation.cfm?id=365411.365428 db/conf/soda/soda2001.html#Doerr01 Benjamin Doerr Anand Srivastav Recursive Randomized Coloring Beats Fair Dice Random Colorings. 183-194 2001 conf/stacs/2001 STACS https://doi.org/10.1007/3-540-44693-1_16 db/conf/stacs/stacs2001.html#DoerrS01

Benjamin Doerr Linear Discrepancy of Basic Totally Unimodular Matrices. 2000 7 Electron. J. Comb. https://doi.org/10.37236/1526 db/journals/combinatorics/combinatorics7.html#Doerr00

Benjamin Doerr Linear And Hereditary Discrepancy. 2000 9 Comb. Probab. Comput. 4 db/journals/cpc/cpc9.html#Doerr00 http://journals.cambridge.org/action/displayAbstract?aid=59771 349-354

Benjamin Doerr Anand Srivastav Approximation of Multi-color Discrepancy. 39-50 1999 conf/random/1999 RANDOM-APPROX db/conf/random/random1999.html#DoerrS99 https://doi.org/10.1007/978-3-540-48413-4_5 Peyman Afshani Geir Agnarsson Manindra Agrawal Nitin Ahuja Enrique Alba 0001 Yasser Alghouass Noga Alon Spyros Angelopoulos 0001 Hendrik Annuth Denis Antipov Tetsuo Asano Anne Auger Andreas Baltz Henry Bambury Thomas Bartz-Beielstein Surender Baswana Riade Benbaki Abderrahim Bendahi Ziyad Benomar Somenath Biswas Süntje Böttcher Marouane Ibn Brahim Nicolas Bredèche Karl Bringmann Dimo Brockhoff Antoine Bultel Maxim Buzdalov 0001 Arina Buzdalova Josu CeberioJosu Ceberio Uribe Sacha Cerf Xujin Chen Marcel Chwialkowski Sylvain Colin Joshua N. Cooper Raphaël Dang-Nhu Thibault Dardinier Renzhong Deng Matthieu Dinot Carola DoerrCarola Winzen Arthur Dremaux Johann Dréo Marc Dufay Aymen Echarghaoui A. E. EibenGusz Eiben Robert Elsässer Michael G. Epitropakis Anton V. Eremeev Jiefeng Fang Gaspard Férey Friedrich Feuerhake Philipp Fischbeck Paul Fischer Carlos M. Fonseca Mahmoud Fouz Adrien Fradin Clemens Frahnow Pierre Fraigniaud Tobias Friedrich 0001 Wanru Gao Yassine Ghannane Taha El GhaziTaha El Ghazi El Houssaini Christian Gießen Michael Gnewuch Leslie Ann Goldberg Andreia P. Guerreiro Juan Julián Merelo Guervós Evert Haasdijk Pauline C. Haddow Omar El Hadri Nikolaus Hansen Edda Happ Nils Hebbinghaus Benjamin Hebras Jacqueline Heinerman Ulysse Hennebelle Tangi Hetet Astrid Hilbert Laurent Hoeltgen Sebastian Hoffmann 0001 Ashish Ranjan Hota Xiao-Dong Hu 0001Xiaodong Hu 0001 Anna Huber Julien Hubert Franziska HuthFranziska Ebel Christian Igel Tudor Ivan Alexandra Ivanova Gautier Izacard Mohammed Jamal Thomas Jansen 0001 Firas Ben Jedidia Daniel Johannsen Yakob Kahane Vitalii Karavaev Naoki Katoh Andrew James Kelley Mikhail Kever Christian Klein 0001 Joshua D. Knowles Bojana Kodric Dimitri Korkotashvili Niklas Kormann Anatolii Kostrygin Timo Kötzing Martin S. Krejca Peter Kritzer Marvin Künnemann Piyush P. Kurur Mohammed Lagmah Gregor LagodzinskiJ. A. Gregor Lagodzinski Axel de Perthuis de Laillevault Thomas Andrew Lampert Kasper Green Larsen Huu Phuoc Le Per Kristian Lehre Johannes Lengler Ariel Levavi Mingfeng Li Andrei Lissovoi Jie Liu Yufei Liu Ulf Lorenz Tomasz Luczak 0001 Johannes F. Lutzeyer Weidong Ma Markus Mainberger Régis Makhmara Luigi Malagò Sebastian Mayer John A. W. McCall Kurt Mehlhorn Julian Francis Miller Lorenz Minder Shay Moran Shlomo Moran Boris Naujoks Adrian Neumann Aneta Neumann Frank Neumann 0001 Ta Duy Nguyen Zeeshan Nisar Dorian Nogneng Pietro S. Oliveto Andre Opris Ralf Osbild Konstantinos Panagiotou Alain Peres Stjepan Picek Nelishia Pillay Friedrich Pillichshammer Adrien Pinard Sebastian Pohl Mike Preuss Ales Prívetivý Zhongdi Qu Amirhossein Rajabi Masoud Ramuz Quentin Renau Günter Rudolph Patricia Ryser-Welch Thomas Sauerwald Nadine S. Schaadt Christian Scheideler Martin Schirneck Marcus Schmidbauer Martin Schmidt Henning Schnieder Tomasz Schoen Yann Semet Simon Setzer Jonathan L. Shapiro Jakub Sliacan Vicente P. Soloviev Joel H. SpencerJoel Spencer Reto Spöhel Giovanni Squillero Anand Srivastav Milan Stankovic Rob van Stee David Steurer Tobias Storch Jörg Stork Aurélien Stumpf Dirk Sudholt Andrew M. Sutton Ching Hoo Tang Gábor Tardos Sachio Teramoto Madeleine Theile Lothar Thiele Henning Thomas Christian ThyssenChristian Horoba Alberto Paolo Tonda Dmitry Vinokurov Marco Voigt Nguyen Vu Markus Wagner 0007 Magnus Wahlström Shouda Wang John Alasdair Warwicker Noé Weeks Ingo Wegener Petra Wehr Joachim Weickert Sören Werth L. Darrell Whitley Simon Wietheger Sebastian Will Carsten Witt Guangwen Yang 0002 Jing Yang 0016 Quentin Yang Martin Zaefferer Christine Zarges Danyang Zhang Weijie Zheng 0001 Zerong Zhong