The following pages link to Benjamin Doerr (Q211679):
Displaying 50 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- The impact of random initialization on the runtime of randomized search heuristics (Q306492) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Crossover can provably be useful in evolutionary computation (Q418021) (← links)
- Non-existence of linear universal drift functions (Q428906) (← links)
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances (Q477078) (← links)
- From black-box complexity to designing new genetic algorithms (Q487994) (← links)
- Ranking-based black-box complexity (Q528852) (← links)
- Runtime analysis of the 1-ANT ant colony optimizer (Q633703) (← links)
- Evolutionary algorithms and dynamic programming (Q652137) (← links)
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312) (← links)
- Memory-restricted black-box complexity of OneMax (Q763484) (← links)
- Global roundings of sequences (Q834911) (← links)
- Some properties of chromatic coefficients of linear uniform hypergraphs (Q844223) (← links)
- On substructure densities of hypergraphs (Q844225) (← links)
- Minimal regular 2-graphs and applications (Q854642) (← links)
- Error propagation in game trees (Q857818) (← links)
- \(L_{p}\) linear discrepancy of totally unimodular matrices (Q861031) (← links)
- Matrix approximation and Tusnády's problem (Q872057) (← links)
- The asymptotic normalized linear complexity of multisequences (Q933420) (← links)
- Constructions of non-principal families in extremal hypergraph theory (Q941382) (← links)
- Homomorphisms and amalgamation (Q1406546) (← links)
- Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types (Q1411559) (← links)
- Voloshin's colourings of \(P_{3}\)-designs (Q1420592) (← links)
- Discrepancy of cartesian products of arithmetic progressions (Q1422144) (← links)
- Iterated colorings of graphs. (Q1427472) (← links)
- Linear discrepancy of basic totally unimodular matrices (Q1583619) (← links)
- Discrepancy in different numbers of colors (Q1613434) (← links)
- An elementary analysis of the probability that a binomial random variable exceeds its expectation (Q1642431) (← links)
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate (Q1725645) (← links)
- Solving problems with unknown solution length at almost no extra cost (Q1725649) (← links)
- Island models meet rumor spreading (Q1725662) (← links)
- The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm (Q1750362) (← links)
- Static and self-adjusting mutation strengths for multi-valued decision variables (Q1750364) (← links)
- Coloring \(t\)-dimensional \(m\)-boxes (Q1841894) (← links)
- Sunflower hypergraphs are chromatically unique (Q1877684) (← links)
- Linear discrepancy of totally unimodular matrices (Q1882144) (← links)
- Typical rounding problems (Q1884960) (← links)
- European tenure games (Q1884995) (← links)
- More effective crossover operators for the all-pairs shortest path problem (Q1935817) (← links)
- Black-box complexities of combinatorial problems (Q1935820) (← links)
- Adaptive drift analysis (Q1939672) (← links)
- Quasi-random rumor spreading: reducing randomness can be costly (Q1944078) (← links)
- Multiplicative drift analysis (Q1945169) (← links)
- Strong robustness of randomized rumor spreading protocols (Q1946220) (← links)
- In memoriam: Ingo Wegener (Q1957654) (← links)
- The recovery of ridge functions on the hypercube suffers from the curse of dimensionality (Q1996887) (← links)
- Optimal parameter choices via precise black-box analysis (Q2007714) (← links)
