Carola Doerr

According to our database1, Carola Doerr authored at least 105 papers between 2009 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates.
CoRR, 2019

Maximizing Drift is Not Optimal for Solving OneMax.
CoRR, 2019

Online Selection of CMA-ES Variants.
CoRR, 2019

Hyper-Parameter Tuning for the (1+(λ, λ)) GA.
CoRR, 2019

Self-Adjusting Mutation Rates with Provably Optimal Success Rules.
CoRR, 2019

Fast Re-Optimization via Structural Diversity.
CoRR, 2019

Interpolating Local and Global Search by Controlling the Variance of Standard Bit Mutation.
CoRR, 2019

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation.
Algorithmica, 2019

Solving Problems with Unknown Solution Length at Almost No Extra Cost.
Algorithmica, 2019

Fixed-target runtime analysis of the (1 + 1) EA with resampling.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Expressiveness and robustness of landscape features.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Adaptive landscape analysis.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Illustrating the trade-off between time, quality, and success probability in heuristic search: a discussion paper.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Coupling the design of benchmark with algorithm in landscape-aware solver design.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Benchmarking discrete optimization heuristics with IOHprofiler.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Making a case for (Hyper-)parameter tuning as benchmark problems.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Hyper-parameter tuning for the (1 + (λ, λ)) GA.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Bayesian performance analysis for black-box optimization benchmarking.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

2018
The Query Complexity of a Permutation-Based Variant of Mastermind.
CoRR, 2018

Towards a More Practice-Aware Runtime Analysis of Evolutionary Algorithms.
CoRR, 2018

IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics.
CoRR, 2018

Towards a Theory-Guided Benchmarking Suite for Discrete Black-Box Optimization Heuristics: Profiling (1+λ) EA Variants on OneMax and LeadingOnes.
CoRR, 2018

Optimal Parameter Choices via Precise Black-Box Analysis.
CoRR, 2018

Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices.
CoRR, 2018

On the Effectiveness of Simple Success-Based Parameter Selection Mechanisms for Two Classical Discrete Black-Box Optimization Benchmark Problems.
CoRR, 2018

Discrepancy-based Evolutionary Diversity Optimization.
CoRR, 2018

Complexity Theory for Discrete Black-Box Optimization Heuristics.
CoRR, 2018

The (1+1) Elitist Black-Box Complexity of LeadingOnes.
Algorithmica, 2018

Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables.
Algorithmica, 2018

Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ, λ)) Genetic Algorithm.
Algorithmica, 2018

Towards an Adaptive CMA-ES Configurator.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

A Simple Proof for the Usefulness of Crossover in Black-Box Optimization.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018


Sensitivity of Parameter Control Mechanisms with Respect to Their Initialization.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Compiling a benchmarking test-suite for combinatorial black-box optimization: a position paper.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Dynamic parameter choices in evolutionary computation.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Simple on-the-fly parameter selection mechanisms for two classical discrete black-box optimization benchmark problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017
Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?
Evolutionary Computation, 2017

Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 17191).
Dagstuhl Reports, 2017

OneMax in Black-Box Models with Several Restrictions.
Algorithmica, 2017

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation.
Algorithmica, 2017

Unknown solution length problems with no asymptotically optimal run time.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Non-static parameter choices in evolutionary computation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016
Rumor spreading in random evolving graphs.
Random Struct. Algorithms, 2016

Playing Mastermind With Many Colors.
J. ACM, 2016

Simple and optimal randomized fault-tolerant rumor spreading.
Distributed Computing, 2016

The Right Mutation Strength for Multi-Valued Decision Variables.
CoRR, 2016

The Impact of Random Initialization on the Runtime of Randomized Search Heuristics.
Algorithmica, 2016

k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016


Women@GECCO 2016 Chairs' Welcome.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Theory for Non-Theoreticians.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

2015
From black-box complexity to designing new genetic algorithms.
Theor. Comput. Sci., 2015

Unbiased Black-Box Complexities of Jump Functions.
Evolutionary Computation, 2015

Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms?
CoRR, 2015

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

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

Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Elitist Black-Box Models: Analyzing the Impact of Elitist Selection on the Performance of Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014
The Price of Anarchy for Selfish Ring Routing is Two.
ACM Trans. Economics and Comput., 2014

Reducing the arity in unbiased black-box complexity.
Theor. Comput. Sci., 2014

Playing Mastermind with Constant-Size Memory.
Theory Comput. Syst., 2014

Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time.
J. Graph Algorithms Appl., 2014

Unbiased Black-Box Complexities of Jump Functions - How to Cross Large Plateaus.
CoRR, 2014

Ranking-Based Black-Box Complexity.
Algorithmica, 2014

The unbiased black-box complexity of partition is polynomial.
Artif. Intell., 2014

Women@GECCO 2014.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
Black-box complexities of combinatorial problems.
Theor. Comput. Sci., 2013

Direction-reversing quasi-random rumor spreading with restarts.
Inf. Process. Lett., 2013

Mutation Rate Matters Even When Optimizing Monotonic Functions.
Evolutionary Computation, 2013

Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
CoRR, 2013

Rumor Spreading in Random Evolving Graphs
CoRR, 2013

Collecting Coupons with Random Initial Stake.
CoRR, 2013

Lessons from the black-box: fast crossover-based genetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Black-box complexity: from complexity theory to playing mastermind.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

The Query Complexity of Finding a Hidden Permutation.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Non-existence of linear universal drift functions.
Theor. Comput. Sci., 2012

A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting.
SIAM J. Numerical Analysis, 2012

Memory-restricted black-box complexity of OneMax.
Inf. Process. Lett., 2012

The Deterministic and Randomized Query Complexity of a Simple Guessing Game.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes
CoRR, 2012

The Price of Anarchy for Selfish Ring Routing is Two
CoRR, 2012

Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity
CoRR, 2012

Playing Mastermind with Many Colors
CoRR, 2012

Multiplicative Drift Analysis.
Algorithmica, 2012

The Price of Anarchy for Selfish Ring Routing Is Two.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Playing Mastermind With Constant-Size Memory.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Reducing the arity in unbiased black-box complexity.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
Memory-Restricted Black-Box Complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2011

A Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy
CoRR, 2011

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

Entwicklung einer Komplexitätstheorie für randomisierte Suchheuristiken: Black-Box-Modelle.
Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011

Black-box complexities of combinatorial problems.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Too fast unbiased black-box algorithms.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Faster black-box algorithms through higher arity operators.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity.
Proceedings of the Computer Science - Theory and Applications, 2011

Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes.
Proceedings of the Artificial Evolution, 2011

Toward a complexity theory for randomized search heuristics.
PhD thesis, 2011

2010
Faster Black-Box Algorithms Through Higher Arity Operators
CoRR, 2010

Optimizing Monotone Functions Can Be Difficult
CoRR, 2010

Optimizing Monotone Functions Can Be Difficult.
Proceedings of the Parallel Problem Solving from Nature, 2010

Multiplicative drift analysis.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Drift analysis and linear functions revisited.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009
Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems.
J. Complexity, 2009


  Loading...