| Publication | Date of Publication | Type |
|---|
| Lower bounds from fitness levels made easy | 2024-01-25 | Paper |
| Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution | 2024-01-25 | Paper |
| Choosing the right algorithm with hints from complexity theory | 2024-01-18 | Paper |
| An extended jump functions benchmark for the analysis of randomized search heuristics | 2024-01-09 | Paper |
| Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem | 2024-01-09 | Paper |
| Runtime analysis for permutation-based evolutionary algorithms | 2024-01-09 | Paper |
| Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II) | 2023-12-14 | Paper |
| Bivariate estimation-of-distribution algorithms can find an exponential number of optima | 2023-08-18 | Paper |
| (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error | 2023-06-27 | Paper |
| Randomized Rumor Spreading Revisited (Long Version) | 2023-03-20 | Paper |
| Stagnation detection meets fast mutation | 2023-02-01 | Paper |
| Stagnation detection meets fast mutation | 2022-08-11 | Paper |
| A sharp discrepancy bound for jittered sampling | 2022-06-15 | Paper |
| A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions | 2022-06-01 | Paper |
| Does comma selection help to cope with local optima? | 2022-06-01 | Paper |
| Fast mutation in crossover-based algorithms | 2022-06-01 | Paper |
| Fixed-target runtime analysis | 2022-06-01 | Paper |
| The univariate marginal distribution algorithm copes well with deception and epistasis | 2021-12-08 | Paper |
| Multiplicative up-drift | 2021-11-05 | Paper |
| The runtime of the compact genetic algorithm on jump functions | 2021-11-05 | Paper |
| Self-adjusting mutation rates with provably optimal success rules | 2021-11-05 | Paper |
| On negative dependence properties of Latin hypercube samples and scrambled nets | 2021-11-02 | Paper |
| Runtime analysis for self-adaptive mutation rates | 2021-04-08 | Paper |
| A tight runtime analysis for the \((\mu + \lambda)\) EA | 2021-04-08 | Paper |
| The recovery of ridge functions on the hypercube suffers from the curse of dimensionality | 2021-02-26 | Paper |
| Runtime analysis of evolutionary algorithms via symmetry arguments | 2021-02-04 | Paper |
| Exponential upper bounds for the runtime of randomized search heuristics | 2021-01-25 | Paper |
| A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes | 2021-01-25 | Paper |
| Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem | 2020-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111471 | 2020-05-27 | Paper |
| The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time | 2020-03-20 | Paper |
| An exponential lower bound for the runtime of the compact genetic algorithm on jump functions | 2020-02-11 | Paper |
| A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones | 2020-02-11 | Paper |
| Optimal parameter choices via precise black-box analysis | 2019-11-22 | Paper |
| Working principles of binary differential evolution | 2019-11-22 | Paper |
| Tight Analysis of Randomized Rumor Spreading in Complete Graphs | 2019-09-17 | Paper |
| Runtime Analysis of $$(1+1)$$ Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem | 2019-09-16 | Paper |
| Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump $$_{n,\ell }$$ | 2019-09-16 | Paper |
| Deterministic Random Walks | 2019-09-16 | Paper |
| Analyzing randomized search heuristics via stochastic domination | 2019-09-16 | Paper |
| Dependent Randomized Rounding: The Bipartite Case | 2019-09-12 | Paper |
| Quasirandom Rumor Spreading: An Experimental Analysis | 2019-09-11 | Paper |
| Randomized Rounding in the Presence of a Cardinality Constraint | 2019-09-11 | Paper |
| Analyzing randomized search heuristics via stochastic domination | 2019-05-21 | Paper |
| Playing Mastermind With Many Colors | 2019-05-15 | Paper |
| The query complexity of a permutation-based variant of mastermind | 2019-05-03 | Paper |
| The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate | 2019-02-14 | Paper |
| Solving problems with unknown solution length at almost no extra cost | 2019-02-14 | Paper |
| Island models meet rumor spreading | 2019-02-14 | Paper |
| Probabilistic Lower Bounds for the Discrepancy of Latin Hypercube Samples | 2019-01-22 | Paper |
| Optimising Spatial and Tonal Data for PDE-based Inpainting | 2018-11-23 | Paper |
| Quasirandom Rumor Spreading | 2018-10-30 | Paper |
| Playing Mastermind With Many Colors | 2018-08-02 | Paper |
| An elementary analysis of the probability that a binomial random variable exceeds its expectation | 2018-06-20 | Paper |
| Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm | 2018-05-18 | Paper |
| Static and self-adjusting mutation strengths for multi-valued decision variables | 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 | 2017-12-19 | Paper |
| Computing single source shortest paths using single-objective fitness | 2017-07-14 | Paper |
| Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets | 2017-07-14 | Paper |
| Faster black-box algorithms through higher arity operators | 2017-07-14 | Paper |
| When do evolutionary algorithms optimize separable functions in parallel? | 2017-07-14 | Paper |
| Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas | 2017-07-07 | Paper |
| Ranking-based black-box complexity | 2017-05-17 | Paper |
| Randomized Rounding in the Presence of a Cardinality Constraint | 2016-10-24 | Paper |
| The impact of random initialization on the runtime of randomized search heuristics | 2016-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816020 | 2016-07-01 | Paper |
| Simple and optimal randomized fault-tolerant rumor spreading | 2016-05-23 | Paper |
| Online Checkpointing with Improved Worst-Case Guarantees | 2015-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501311 | 2015-08-03 | Paper |
| Playing mastermind with constant-size memory | 2015-02-05 | Paper |
| From black-box complexity to designing new genetic algorithms | 2015-01-23 | Paper |
| Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances | 2014-12-02 | Paper |
| The unbiased black-box complexity of partition is polynomial | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921778 | 2014-10-13 | Paper |
| A lower bound for the discrepancy of a random point set | 2014-07-16 | Paper |
| Reducing the arity in unbiased black-box complexity | 2014-07-10 | Paper |
| Social networks spread rumors in sublogarithmic time | 2014-06-05 | Paper |
| Improved approximation algorithms for the Min-Max selecting items problem | 2014-04-14 | Paper |
| Quasirandom rumor spreading | 2014-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857362 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857363 | 2013-11-01 | Paper |
| Quasirandom Rumor Spreading on Expanders | 2013-10-10 | Paper |
| A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading | 2013-10-10 | Paper |
| The Query Complexity of Finding a Hidden Permutation | 2013-09-13 | Paper |
| Online Checkpointing with Improved Worst-Case Guarantees | 2013-08-06 | Paper |
| Strong robustness of randomized rumor spreading protocols | 2013-04-18 | Paper |
| Quasi-random rumor spreading: reducing randomness can be costly | 2013-04-04 | Paper |
| Multiplicative drift analysis | 2013-04-03 | Paper |
| Winkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions | 2013-03-28 | Paper |
| Adaptive drift analysis | 2013-03-05 | Paper |
| More effective crossover operators for the all-pairs shortest path problem | 2013-02-19 | Paper |
| Black-box complexities of combinatorial problems | 2013-02-19 | Paper |
| Playing Mastermind with Constant-size Memory | 2012-08-23 | Paper |
| Asynchronous Rumor Spreading in Preferential Attachment Graphs | 2012-08-14 | Paper |
| Non-existence of linear universal drift functions | 2012-06-25 | Paper |
| Crossover can provably be useful in evolutionary computation | 2012-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224100 | 2012-03-29 | Paper |
| Memory-restricted black-box complexity of OneMax | 2012-03-09 | Paper |
| Evolutionary algorithms and dynamic programming | 2011-12-19 | Paper |
| Asymptotically Optimal Randomized Rumor Spreading | 2011-07-07 | Paper |
| Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity | 2011-06-17 | Paper |
| Hereditary Discrepancies in Different Numbers of Colors II | 2011-06-17 | Paper |
| Runtime analysis of the 1-ANT ant colony optimizer | 2011-03-29 | Paper |
| Deterministic random walks on regular trees | 2010-11-10 | Paper |
| Algorithmic construction of low-discrepancy point sets via dependent randomized rounding | 2010-10-11 | Paper |
| In memoriam: Ingo Wegener | 2010-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579453 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579495 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576663 | 2010-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576712 | 2010-07-30 | Paper |
| Randomized Rounding for Routing and Covering Problems: Experiments and Improvements | 2010-05-04 | Paper |
| Deterministic Random Walks on the Two-Dimensional Grid | 2010-04-23 | Paper |
| Tight bounds for quasirandom rumor spreading | 2010-03-26 | Paper |
| Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples | 2010-02-15 | Paper |
| Strong Robustness of Randomized Rumor Spreading Protocols | 2009-12-17 | Paper |
| Introducing Quasirandomness to Computer Science | 2009-11-12 | Paper |
| Global roundings of sequences | 2009-08-27 | Paper |
| Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness | 2009-07-14 | Paper |
| Component-by-component construction of low-discrepancy point sets of small size | 2008-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504230 | 2008-06-11 | Paper |
| Partial Colorings of Unimodular Hypergraphs | 2008-06-05 | Paper |
| Deterministic Random Walks on Regular Trees | 2008-06-05 | Paper |
| The Interval Liar Game | 2008-04-24 | Paper |
| Deterministic Random Walks on the Two-Dimensional Grid | 2008-04-24 | Paper |
| Unbiased Rounding of Rational Matrices | 2008-04-17 | Paper |
| Generating Randomized Roundings with Cardinality Constraints and Derandomizations | 2008-03-19 | Paper |
| On the minimum load coloring problem | 2008-01-11 | Paper |
| Deterministic random walks on the integers | 2007-11-21 | Paper |
| Unbiased Matrix Rounding | 2007-09-07 | Paper |
| Randomly Rounding Rationals with Cardinality Constraints and Derandomizations | 2007-09-03 | Paper |
| Roundings respecting hard constraints | 2007-08-23 | Paper |
| The Interval Liar Game | 2007-05-29 | Paper |
| Vector Balancing Games with Aging | 2007-05-29 | Paper |
| Coloring Graphs with Minimal Edge Load | 2007-05-29 | Paper |
| An Improved Discrepancy Approach to Declustering | 2007-05-29 | Paper |
| Controlled Randomized Rounding | 2007-05-29 | Paper |
| Quasirandomness in Graphs | 2007-05-29 | Paper |
| Unbiased Matrix Rounding | 2007-05-29 | Paper |
| Matrix approximation and Tusnády's problem | 2007-03-27 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| \(L_{p}\) linear discrepancy of totally unimodular matrices | 2007-01-09 | Paper |
| Error propagation in game trees | 2007-01-05 | Paper |
| Improved bounds and schemes for the declustering problem | 2006-09-14 | Paper |
| Discrepancy of symmetric products of hypergraphs | 2006-08-30 | Paper |
| Balanced partitions of vector sequences | 2006-04-28 | Paper |
| Non-independent randomized rounding and coloring | 2006-04-28 | Paper |
| Matrix rounding with respect to small submatrices | 2006-03-24 | Paper |
| Bounds and constructions for the star-discrepancy via \(\delta\)-covers | 2005-12-27 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Nonindependent Randomized Rounding and an Application to Digital Halftoning | 2005-02-21 | Paper |
| Typical rounding problems | 2004-10-27 | Paper |
| European tenure games | 2004-10-27 | Paper |
| Linear discrepancy of totally unimodular matrices | 2004-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736832 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737216 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471336 | 2004-07-28 | Paper |
| Multicolour Discrepancies | 2004-05-18 | Paper |
| The hereditary discrepancy is nearly independent of the number of colors | 2004-03-29 | Paper |
| Discrepancy of cartesian products of arithmetic progressions | 2004-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768281 | 2003-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411376 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411279 | 2003-07-07 | Paper |
| On the discrepancy of combinatorial rectangles | 2003-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782741 | 2002-12-02 | Paper |
| Vector balancing games with aging | 2002-11-14 | Paper |
| Discrepancy in different numbers of colors | 2002-08-29 | Paper |
| Linear and Hereditary Discrepancy | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762504 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741471 | 2001-10-24 | Paper |
| Coloring \(t\)-dimensional \(m\)-boxes | 2001-06-04 | Paper |
| Linear discrepancy of basic totally unimodular matrices | 2000-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941825 | 2000-10-08 | Paper |
| Randomized Rumor Spreading Revisited (Long Version) | 0001-01-03 | Paper |
