| Publication | Date of Publication | Type |
|---|
Constructing optimal star discrepancy sets
Proceedings of the American Mathematical Society. Series B | 2025-06-04 | Paper |
Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions
Algorithmica | 2024-10-24 | Paper |
Heuristic approaches to obtain low-discrepancy point sets via subset selection
Journal of Complexity | 2024-05-15 | Paper |
Bridging Theory and Practice in Evolutionary Computation?
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2024-02-23 | Paper |
Fixed-target runtime analysis
Algorithmica | 2022-06-01 | Paper |
Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
Journal of Complexity | 2022-04-04 | Paper |
Self-adjusting mutation rates with provably optimal success rules
Algorithmica | 2021-11-05 | Paper |
Self-adjusting mutation rates with provably optimal success rules
Algorithmica | 2021-11-05 | Paper |
Mutation rate control in the \((1+\lambda)\) evolutionary algorithm with a self-adjusting lower bound
Mathematical Optimization Theory and Operations Research | 2021-02-25 | Paper |
Optimal parameter choices via precise black-box analysis
Theoretical Computer Science | 2019-11-22 | Paper |
The query complexity of a permutation-based variant of mastermind
Discrete Applied Mathematics | 2019-05-03 | Paper |
Solving problems with unknown solution length at almost no extra cost
Algorithmica | 2019-02-14 | Paper |
Probabilistic lower bounds for the discrepancy of Latin hypercube samples
Contemporary Computational Mathematics - A Celebration of the 80th Birthday of Ian Sloan | 2019-01-22 | Paper |
Playing Mastermind with many colors
Journal of the ACM | 2018-08-02 | Paper |
Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
Algorithmica | 2018-05-18 | Paper |
The (1+1) elitist black-box complexity of LeadingOnes
Algorithmica | 2018-05-18 | Paper |
Static and self-adjusting mutation strengths for multi-valued decision variables
Algorithmica | 2018-05-18 | Paper |
\textsc{OneMax} in black-box models with several restrictions
Algorithmica | 2017-07-07 | Paper |
The impact of random initialization on the runtime of randomized search heuristics
Algorithmica | 2016-08-31 | Paper |
Simple and optimal randomized fault-tolerant rumor spreading
Distributed Computing | 2016-05-23 | Paper |
Rumor spreading in random evolving graphs
Random Structures & Algorithms | 2016-03-22 | Paper |
Calculation of discrepancy measures and applications
A Panorama of Discrepancy Theory | 2015-07-24 | Paper |
From black-box complexity to designing new genetic algorithms
Theoretical Computer Science | 2015-01-23 | Paper |
The unbiased black-box complexity of partition is polynomial
Artificial Intelligence | 2014-10-13 | Paper |
Computing minimum cycle bases in weighted partial 2-trees in linear time
Journal of Graph Algorithms and Applications | 2014-07-30 | Paper |
Computing minimum cycle bases in weighted partial 2-trees in linear time
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Rumor spreading in random evolving graphs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
The query complexity of finding a hidden permutation
Lecture Notes in Computer Science | 2013-09-13 | Paper |
