| Publication | Date of Publication | Type |
|---|
Selection hyper-heuristics can automatically adjust the learning period to optimally solve pseudo-Boolean problems
Artificial Intelligence | 2026-07-24 | Paper |
Fourier analysis meets runtime analysis: precise runtimes on plateaus
Algorithmica | 2024-08-13 | Paper |
Estimation-of-distribution algorithms for multi-valued decision variables
Theoretical Computer Science | 2024-06-04 | Paper |
Lower bounds from fitness levels made easy
Algorithmica | 2024-01-25 | Paper |
Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution
Algorithmica | 2024-01-25 | Paper |
Choosing the right algorithm with hints from complexity theory
Information and Computation | 2024-01-18 | Paper |
An extended jump functions benchmark for the analysis of randomized search heuristics
Algorithmica | 2024-01-09 | Paper |
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem
Algorithmica | 2024-01-09 | Paper |
Runtime analysis for permutation-based evolutionary algorithms
Algorithmica | 2024-01-09 | Paper |
Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
Artificial Intelligence | 2023-12-14 | Paper |
Bivariate estimation-of-distribution algorithms can find an exponential number of optima
Theoretical Computer Science | 2023-08-18 | Paper |
(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error
Artificial Intelligence | 2023-06-27 | Paper |
Randomized Rumor Spreading Revisited (Long Version)
(available as arXiv preprint) | 2023-03-20 | Paper |
Stagnation detection meets fast mutation
Theoretical Computer Science | 2023-02-01 | Paper |
Stagnation detection meets fast mutation
Evolutionary Computation in Combinatorial Optimization | 2022-08-11 | Paper |
A sharp discrepancy bound for jittered sampling
Mathematics of Computation | 2022-06-15 | Paper |
A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions
Algorithmica | 2022-06-01 | Paper |
Does comma selection help to cope with local optima?
Algorithmica | 2022-06-01 | Paper |
Fast mutation in crossover-based algorithms
Algorithmica | 2022-06-01 | Paper |
Fixed-target runtime analysis
Algorithmica | 2022-06-01 | Paper |
The univariate marginal distribution algorithm copes well with deception and epistasis
(available as arXiv preprint) | 2021-12-08 | Paper |
Multiplicative up-drift
Algorithmica | 2021-11-05 | Paper |
The runtime of the compact genetic algorithm on jump functions
Algorithmica | 2021-11-05 | 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 |
On negative dependence properties of Latin hypercube samples and scrambled nets
Journal of Complexity | 2021-11-02 | Paper |
Runtime analysis for self-adaptive mutation rates
Algorithmica | 2021-04-08 | Paper |
Runtime analysis for self-adaptive mutation rates
Algorithmica | 2021-04-08 | Paper |
A tight runtime analysis for the \((\mu + \lambda)\) EA
Algorithmica | 2021-04-08 | Paper |
The recovery of ridge functions on the hypercube suffers from the curse of dimensionality
Journal of Complexity | 2021-02-26 | Paper |
Runtime analysis of evolutionary algorithms via symmetry arguments
Information Processing Letters | 2021-02-04 | Paper |
Exponential upper bounds for the runtime of randomized search heuristics
Theoretical Computer Science | 2021-01-25 | Paper |
A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes
Theoretical Computer Science | 2021-01-25 | Paper |
| Exploratory Landscape Analysis Feature Values for the 24 Noiseless BBOB Functions | 2021-01-21 | Dataset |
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
| Experimental Data Set for the study "Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy" | 2020-06-09 | Dataset |
| Randomized rumor spreading revisited | 2020-05-27 | Paper |
The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
Theoretical Computer Science | 2020-03-20 | Paper |
An exponential lower bound for the runtime of the compact genetic algorithm on jump functions
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2020-02-11 | Paper |
A tight runtime analysis for the (1+(,)) GA on LeadingOnes
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2020-02-11 | Paper |
Optimal parameter choices via precise black-box analysis
Theoretical Computer Science | 2019-11-22 | Paper |
Working principles of binary differential evolution
Theoretical Computer Science | 2019-11-22 | Paper |
Tight analysis of randomized rumor spreading in complete graphs
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Runtime analysis of \((1+1)\) evolutionary algorithm controlled with Q-learning using greedy exploration strategy on \textsc{OneMax+ZeroMax} problem
Evolutionary Computation in Combinatorial Optimization | 2019-09-16 | Paper |
Upper and lower bounds on unrestricted black-box complexity of \(\textsc{Jump}_{n,\ell} \)
Evolutionary Computation in Combinatorial Optimization | 2019-09-16 | Paper |
Deterministic random walks
2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Better runtime guarantees via stochastic domination
Lecture Notes in Computer Science | 2019-09-16 | Paper |
Dependent Randomized Rounding: The Bipartite Case
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Quasirandom Rumor Spreading: An Experimental Analysis
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Randomized Rounding in the Presence of a Cardinality Constraint
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Analyzing randomized search heuristics via stochastic domination
Theoretical Computer Science | 2019-05-21 | Paper |
Playing Mastermind with many colors
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
The query complexity of a permutation-based variant of mastermind
Discrete Applied Mathematics | 2019-05-03 | Paper |
The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
Algorithmica | 2019-02-14 | Paper |
The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
Algorithmica | 2019-02-14 | Paper |
Solving problems with unknown solution length at almost no extra cost
Algorithmica | 2019-02-14 | Paper |
Island models meet rumor spreading
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 |
Optimizing spatial and tonal data for PDE-based inpainting
(available as arXiv preprint) | 2018-11-23 | Paper |
Quasirandom rumor spreading
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Playing Mastermind with many colors
Journal of the ACM | 2018-08-02 | Paper |
An elementary analysis of the probability that a binomial random variable exceeds its expectation
Statistics & Probability Letters | 2018-06-20 | Paper |
Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
Algorithmica | 2018-05-18 | Paper |
Static and self-adjusting mutation strengths for multi-valued decision variables
Algorithmica | 2018-05-18 | Paper |
| Probabilistic Tools for the Analysis of Randomized Optimization Heuristics | 2018-01-20 | Paper |
Improved protocols and hardness results for the two-player cryptogenography problem
(available as arXiv preprint) | 2017-12-19 | Paper |
Computing single source shortest paths using single-objective fitness
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms | 2017-07-14 | Paper |
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Faster black-box algorithms through higher arity operators
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
When do evolutionary algorithms optimize separable functions in parallel?
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII | 2017-07-14 | Paper |
Time complexity analysis of evolutionary algorithms on random satisfiable k-CNF formulas
Algorithmica | 2017-07-07 | Paper |
Ranking-based black-box complexity
Algorithmica | 2017-05-17 | Paper |
Randomized rounding in the presence of a cardinality constraint
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
The impact of random initialization on the runtime of randomized search heuristics
Algorithmica | 2016-08-31 | Paper |
| Multicolor discrepancy of arithmetic progressions (extended abstract) | 2016-07-01 | Paper |
Simple and optimal randomized fault-tolerant rumor spreading
Distributed Computing | 2016-05-23 | Paper |
Online checkpointing with improved worst-case guarantees
INFORMS Journal on Computing | 2015-12-21 | Paper |
| scientific article; zbMATH DE number 6469193 (Why is no real title available?) | 2015-08-03 | Paper |
Playing mastermind with constant-size memory
Theory of Computing Systems | 2015-02-05 | Paper |
From black-box complexity to designing new genetic algorithms
Theoretical Computer Science | 2015-01-23 | Paper |
Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
Theoretical Computer Science | 2014-12-02 | Paper |
| Matrix rounding with low error in small submatrices | 2014-10-13 | Paper |
The unbiased black-box complexity of partition is polynomial
Artificial Intelligence | 2014-10-13 | Paper |
A lower bound for the discrepancy of a random point set
Journal of Complexity | 2014-07-16 | Paper |
Reducing the arity in unbiased black-box complexity
Theoretical Computer Science | 2014-07-10 | Paper |
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Improved approximation algorithms for the Min-Max selecting items problem
Information Processing Letters | 2014-04-14 | Paper |
Quasirandom rumor spreading, an experimental analysis
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
| Asymptotically optimal randomized rumor spreading | 2013-11-01 | Paper |
| Social networks spread rumors in sublogarithmic time | 2013-11-01 | Paper |
Quasirandom rumor spreading on expanders
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
A time-randomness tradeoff for quasi-random rumour spreading
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
The query complexity of finding a hidden permutation
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Online checkpointing with improved worst-case guarantees
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics | 2013-04-18 | Paper |
Quasi-random rumor spreading: reducing randomness can be costly
Information Processing Letters | 2013-04-04 | Paper |
Multiplicative drift analysis
Algorithmica | 2013-04-03 | Paper |
| Winkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions | 2013-03-28 | Paper |
Adaptive drift analysis
Algorithmica | 2013-03-05 | Paper |
More effective crossover operators for the all-pairs shortest path problem
Theoretical Computer Science | 2013-02-19 | Paper |
Black-box complexities of combinatorial problems
Theoretical Computer Science | 2013-02-19 | Paper |
Playing Mastermind with constant-size memory
(available as arXiv preprint) | 2012-08-23 | Paper |
Asynchronous Rumor Spreading in Preferential Attachment Graphs
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
