Benjamin Doerr

Algorithmica, February, 2024

Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution.

[BibT_eX]

[DOI]

Algorithmica, February, 2024

Choosing the right algorithm with hints from complexity theory.

[BibT_eX]

[DOI]

Shouda Wang

Inf. Comput., January, 2024

Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

Amirhossein Rajabi

Algorithmica, January, 2024

Runtime Analysis for Permutation-based Evolutionary Algorithms.

[BibT_eX]

[DOI]

Yassine Ghannane

Marouane Ibn Brahim

Algorithmica, January, 2024

An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics.

[BibT_eX]

[DOI]

Henry Bambury

Antoine Bultel

Algorithmica, January, 2024

The Runtime of Random Local Search on the Generalized Needle Problem.

[BibT_eX]

[DOI]

Andrew James Kelley

CoRR, 2024

Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

How to Use the Metropolis Algorithm for Multi-Objective Optimization?

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Runtime Analysis of the SMS-EMOA for Many-Objective Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II).

[BibT_eX]

[DOI]

Artif. Intell., December, 2023

A First Runtime Analysis of the NSGA-II on a Multimodal Problem.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., October, 2023

Bivariate estimation-of-distribution algorithms can find an exponential number of optima.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error.

[BibT_eX]

[DOI]

Andrei Lissovoi

Pietro S. Oliveto

Artif. Intell., June, 2023

Stagnation detection meets fast mutation.

[BibT_eX]

[DOI]

Amirhossein Rajabi

Theor. Comput. Sci., February, 2023

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives.

[BibT_eX]

[DOI]

Evol. Comput., 2023

Larger Offspring Populations Help the (1 + (λ, λ)) Genetic Algorithm to Overcome the Noise.

[BibT_eX]

[DOI]

Alexandra Ivanova

CoRR, 2023

Randomized Rumor Spreading Revisited (Long Version).

[BibT_eX]

[DOI]

Anatolii Kostrygin

CoRR, 2023

Lasting Diversity and Superior Runtime Guarantees for the (μ+1) Genetic Algorithm.

[BibT_eX]

[DOI]

CoRR, 2023

A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III).

[BibT_eX]

[DOI]

Simon Wietheger

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables.

[BibT_eX]

[DOI]

Firas Ben Jedidia

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Larger Offspring Populations Help the (1 + (λ, λlambda)) Genetic Algorithm to Overcome the Noise.

[BibT_eX]

[DOI]

Alexandra Ivanova

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Hot off the Press: Runtime Analysis for the NSGA-II - Provable Speed-Ups From Crossover.

[BibT_eX]

[DOI]

Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Hot off the Press: From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Hot off the Press: A First Runtime Analysis of the NSGA-II on a Multimodal Problem.

[BibT_eX]

[DOI]

Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus.

[BibT_eX]

[DOI]

Andrew James Kelley

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

How Well Does the Metropolis Algorithm Cope With Local Optima?

[BibT_eX]

[DOI]

Taha El Ghazi El Houssaini

Amirhossein Rajabi

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Runtime Analysis for the NSGA-II: Provable Speed-Ups from Crossover.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

A sharp discrepancy bound for jittered sampling.

[BibT_eX]

[DOI]

Math. Comput., 2022

Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2022

Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Three or More Objectives.

[BibT_eX]

[DOI]

CoRR, 2022

The First Mathematical Proof That Crossover Gives Super-Constant Performance Gains For the NSGA-II.

[BibT_eX]

[DOI]

CoRR, 2022

From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms.

[BibT_eX]

[DOI]

CoRR, 2022

Does Comma Selection Help to Cope with Local Optima?

[BibT_eX]

[DOI]

Algorithmica, 2022

Fixed-Target Runtime Analysis.

[BibT_eX]

[DOI]

Algorithmica, 2022

A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions.

[BibT_eX]

[DOI]

Algorithmica, 2022

Fast Mutation in Crossover-Based Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2022

General Univariate Estimation-of-Distribution Algorithms.

[BibT_eX]

[DOI]

Marc Dufay

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Choosing the right algorithm with hints from complexity theory: (hot-off-the-press track at GECCO 2022).

[BibT_eX]

[DOI]

Shouda Wang

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Automated algorithm selection for radar network configuration.

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

The (1 + (λ, λ)) global SEMO algorithm.

[BibT_eX]

[DOI]

Omar El Hadri

Adrien Pinard

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Towards a stronger theory for permutation-based evolutionary algorithms.

[BibT_eX]

[DOI]

Yassine Ghannane

Marouane Ibn Brahim

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

A gentle introduction to theory (for non-theoreticians).

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022).

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

A first mathematical runtime analysis of the non-dominated sorting genetic algorithm II (NSGA-II): (hot-off-the-press track at GECCO 2022).

[BibT_eX]

[DOI]

Yufei Liu

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Better approximation guarantees for the NSGA-II by using the current crowding distance.

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

A First Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II).

[BibT_eX]

[DOI]

Yufei Liu

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Exploratory Landscape Analysis Feature Values for the 24 Noiseless BBOB Functions.

[BibT_eX]

[DOI]

Dataset, January, 2021

A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization.

[BibT_eX]

[DOI]

ACM Trans. Evol. Learn. Optim., 2021

Precise Runtime Analysis for Plateau Functions.

[BibT_eX]

[DOI]

ACM Trans. Evol. Learn. Optim., 2021

A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Exponential upper bounds for the runtime of randomized search heuristics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

The recovery of ridge functions on the hypercube suffers from the curse of dimensionality.

[BibT_eX]

[DOI]

Sebastian Mayer

J. Complex., 2021

On negative dependence properties of Latin hypercube samples and scrambled nets.

[BibT_eX]

[DOI]

J. Complex., 2021

Runtime analysis of evolutionary algorithms via symmetry arguments.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis.

[BibT_eX]

[DOI]

Evol. Comput., 2021

Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift.

[BibT_eX]

[DOI]

Evol. Comput., 2021

An Extended Jump Function Benchmark for the Analysis of Randomized Search Heuristics.

[BibT_eX]

[DOI]

Henry Bambury

Antoine Bultel

CoRR, 2021

Runtime Analysis for Self-adaptive Mutation Rates.

[BibT_eX]

[DOI]

Jing Yang

Algorithmica, 2021

Multiplicative Up-Drift.

[BibT_eX]

[DOI]

Algorithmica, 2021

Self-Adjusting Mutation Rates with Provably Optimal Success Rules.

[BibT_eX]

[DOI]

Algorithmica, 2021

The Runtime of the Compact Genetic Algorithm on Jump Functions.

[BibT_eX]

[DOI]

Algorithmica, 2021

A Tight Runtime Analysis for the (μ + λ ) EA.

[BibT_eX]

[DOI]

Algorithmica, 2021

Runtime analysis via symmetry arguments: (hot-off-the-press track at GECCO 2021).

[BibT_eX]

[DOI]

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives: (hot-off-the-press track at GECCO 2021).

[BibT_eX]

[DOI]

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima.

[BibT_eX]

[DOI]

Riade Benbaki

Ziyad Benomar

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Generalized jump functions.

[BibT_eX]

[DOI]

Henry Bambury

Antoine Bultel

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computation, 2021

Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Experimental Data Set for the study "Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy".

[BibT_eX]

[DOI]

Dataset, June, 2020

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

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Computation, 2020

Probabilistic Tools for the Analysis of Randomized Optimization Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Computation, 2020

Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2020

Significance-Based Estimation-of-Distribution Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2020

Working principles of binary differential evolution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time.

[BibT_eX]

[DOI]

J. A. Gregor Lagodzinski

Theor. Comput. Sci., 2020

Optimal parameter choices via precise black-box analysis.

[BibT_eX]

[DOI]

Jing Yang

Theor. Comput. Sci., 2020

The (1 + (λ, λ)) GA Is Even Faster on Multimodal Problems.

[BibT_eX]

[DOI]

CoRR, 2020

Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Runtime Analysis of a Heavy-Tailed (1+(λ , λ )) Genetic Algorithm on Jump Functions.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

First Steps Towards a Runtime Analysis When Starting with a Good Solution.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

From understanding genetic drift to a smart-restart parameter-less compact genetic algorithm.

[BibT_eX]

[DOI]

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Sharp bounds for genetic drift in estimation of distribution algorithms (Hot-off-the-press track at GECCO 2020).

[BibT_eX]

[DOI]

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

The (1 + (λ, λ)) GA is even faster on multimodal problems.

[BibT_eX]

[DOI]

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Optimization of Chance-Constrained Submodular Functions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Analyzing randomized search heuristics via stochastic domination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The query complexity of a permutation-based variant of Mastermind.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Sharp Bounds for Genetic Drift in EDAs.

[BibT_eX]

[DOI]

CoRR, 2019

An Exponential Lower Bound for the Runtime of the cGA on Jump Functions.

[BibT_eX]

[DOI]

CoRR, 2019

The Efficiency Threshold for the Offspring Population Size of the (μ, λ) EA.

[BibT_eX]

[DOI]

Quentin Yang

CoRR, 2019

The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate.

[BibT_eX]

[DOI]

Algorithmica, 2019

Island Models Meet Rumor Spreading.

[BibT_eX]

[DOI]

Algorithmica, 2019

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

[BibT_eX]

[DOI]

Algorithmica, 2019

Fixed-target runtime analysis of the (1 + 1) EA with resampling.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Expressiveness and robustness of landscape features.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

When resampling to cope with noise, use median, not mean.

[BibT_eX]

[DOI]

Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Evolving boolean functions with conjunctions and disjunctions via genetic programming.

[BibT_eX]

[DOI]

Andrei Lissovoi

Pietro S. Oliveto

Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Fast re-optimization via structural diversity.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Theory for non-theoreticians: introductory tutorial.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2019

The efficiency threshold for the offspring population size of the (µ, λ) EA.

[BibT_eX]

[DOI]

Quentin Yang

Proceedings of the Genetic and Evolutionary Computation Conference, 2019

An exponential lower bound for the runtime of the compact genetic algorithm on jump functions.

[BibT_eX]

[DOI]

Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones.

[BibT_eX]

[DOI]

Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Probabilistic Tools for the Analysis of Randomized Optimization Heuristics.

[BibT_eX]

[DOI]

CoRR, 2018

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

[BibT_eX]

[DOI]

Algorithmica, 2018

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

[BibT_eX]

[DOI]

Algorithmica, 2018

Precise Runtime Analysis for Plateaus.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Working principles of binary differential evolution.

[BibT_eX]

[DOI]

Guangwen Yang

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

On the runtime analysis of selection hyper-heuristics with adaptive learning periods.

[BibT_eX]

[DOI]

Andrei Lissovoi

Pietro S. Oliveto

John Alasdair Warwicker

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Theory for non-theoreticians: tutorial.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Better runtime guarantees via stochastic domination (hot-off-the-press track at GECCO 2018).

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

A new analysis method for evolutionary optimization of dynamic and noisy objective functions.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

A tight runtime analysis for the (μ + λ) EA.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Better Runtime Guarantees via Stochastic Domination.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2018

2017

Detecting structural breaks in time series via genetic algorithms.

[BibT_eX]

[DOI]

Soft Comput., 2017

An Elementary Analysis of the Probability That a Binomial Random Variable Exceeds Its Expectation.

[BibT_eX]

[DOI]

CoRR, 2017

Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas.

[BibT_eX]

[DOI]

CoRR, 2017

Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas.

[BibT_eX]

[DOI]

Andrew M. Sutton

Algorithmica, 2017

Randomized Rumor Spreading Revisited.

[BibT_eX]

[DOI]

Anatolii Kostrygin

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Fast genetic algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Bounding bloat in genetic programming.

[BibT_eX]

[DOI]

J. A. Gregor Lagodzinski

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

The (1+λ) evolutionary algorithm with self-adjusting mutation rate.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Unknown solution length problems with no asymptotically optimal run time.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Theory for non-theoreticians.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016

How to Generate Randomized Roundings with Dependencies and How to Derandomize Them.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Playing Mastermind With Many Colors.

[BibT_eX]

[DOI]

J. ACM, 2016

The Unrestricted Black-Box Complexity of Jump Functions.

[BibT_eX]

[DOI]

Mikhail Kever

Evol. Comput., 2016

Simple and optimal randomized fault-tolerant rumor spreading.

[BibT_eX]

[DOI]

Distributed Comput., 2016

Guest Editorial: Theory of Evolutionary Computation.

[BibT_eX]

[DOI]

Algorithmica, 2016

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

[BibT_eX]

[DOI]

Algorithmica, 2016

k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation.

[BibT_eX]

[DOI]

Jing Yang

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Tutorials at PPSN 2016.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax.

[BibT_eX]

[DOI]

Wanru Gao

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

The Right Mutation Strength for Multi-Valued Decision Variables.

[BibT_eX]

[DOI]

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Theory for Non-Theoreticians.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

2015

Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

From black-box complexity to designing new genetic algorithms.

[BibT_eX]

[DOI]

Franziska Ebel

Theor. Comput. Sci., 2015

Online Checkpointing with Improved Worst-Case Guarantees.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2015

Unbiased Black-Box Complexities of Jump Functions.

[BibT_eX]

[DOI]

Axel de Perthuis de Laillevault

Evol. Comput., 2015

Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2015

Optimising Spatial and Tonal Data for PDE-based Inpainting.

[BibT_eX]

[DOI]

CoRR, 2015

Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation.

[BibT_eX]

[DOI]

Andrew M. Sutton

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

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

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

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

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ.

[BibT_eX]

[DOI]

Mikhail Kever

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015

Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015

2014

The Price of Anarchy for Selfish Ring Routing is Two.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2014

Editorial for the Special Issue on Theoretical Foundations of Evolutionary Computation.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2014

Reducing the arity in unbiased black-box complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Quasirandom Rumor Spreading.

[BibT_eX]

[DOI]

Thomas Sauerwald

ACM Trans. Algorithms, 2014

Playing Mastermind with Constant-Size Memory.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Randomized Rounding in the Presence of a Cardinality Constraint.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2014

A lower bound for the discrepancy of a random point set.

[BibT_eX]

[DOI]

J. Complex., 2014

Ranking-Based Black-Box Complexity.

[BibT_eX]

[DOI]

Algorithmica, 2014

The unbiased black-box complexity of partition is polynomial.

[BibT_eX]

[DOI]

Artif. Intell., 2014

Unbiased black-box complexities of jump functions: how to cross large plateaus.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Monotonic functions in EC: anything but monotone!

[BibT_eX]

[DOI]

Sylvain Colin

Gaspard Férey

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Tight Analysis of Randomized Rumor Spreading in Complete Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013

Black-box complexities of combinatorial problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

More effective crossover operators for the all-pairs shortest path problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Improved approximation algorithms for the Min-Max Selecting Items problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Mutation Rate Matters Even When Optimizing Monotonic Functions.

[BibT_eX]

[DOI]

Evol. Comput., 2013

Strong robustness of randomized rumor spreading protocols.

[BibT_eX]

[DOI]

Anna Huber

Ariel Levavi

Discret. Appl. Math., 2013

Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2013

Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042).

[BibT_eX]

[DOI]

Robert Elsässer

Pierre Fraigniaud

Dagstuhl Reports, 2013

Winkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions

[BibT_eX]

[DOI]

CoRR, 2013

Collecting Coupons with Random Initial Stake.

[BibT_eX]

[DOI]

CoRR, 2013

Adaptive Drift Analysis.

[BibT_eX]

[DOI]

Leslie Ann Goldberg

Algorithmica, 2013

How the (1+λ) evolutionary algorithm optimizes linear functions.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

A method to derive fixed budget results from expected optimisation times.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Evolutionary algorithms for the detection of structural breaks in time series: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Lessons from the black-box: fast crossover-based genetic algorithms.

[BibT_eX]

[DOI]

Franziska Ebel

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Black-box complexity: from complexity theory to playing mastermind.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

When do evolutionary algorithms optimize separable functions in parallel?

[BibT_eX]

[DOI]

Dirk Sudholt

Proceedings of the Foundations of Genetic Algorithms XII, 2013

Lower bounds for the runtime of a global multi-objective evolutionary algorithm.

[BibT_eX]

[DOI]

Bojana Kodric

Marco Voigt

Proceedings of the IEEE Congress on Evolutionary Computation, 2013

Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2013

The Query Complexity of Finding a Hidden Permutation.

[BibT_eX]

[DOI]

Proceedings of the Space-Efficient Data Structures, 2013

2012

Non-existence of linear universal drift functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Crossover can provably be useful in evolutionary computation.

[BibT_eX]

[DOI]

Edda Happ

Theor. Comput. Sci., 2012

Memory-restricted black-box complexity of OneMax.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

The Deterministic and Randomized Query Complexity of a Simple Guessing Game.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity

[BibT_eX]

[DOI]

CoRR, 2012

Why rumors spread so quickly in social networks.

[BibT_eX]

[DOI]

Commun. ACM, 2012

Multiplicative Drift Analysis.

[BibT_eX]

[DOI]

Algorithmica, 2012

Asynchronous Rumor Spreading in Preferential Attachment Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Experimental Analysis of Rumor Spreading in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Algorithms, 2012

Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet.

[BibT_eX]

[DOI]

Sebastian Pohl

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Ants easily solve stochastic shortest path problems.

[BibT_eX]

[DOI]

Ashish Ranjan Hota

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Black-box complexity: from complexity theory to playing mastermind.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011

Runtime analysis of the 1-ANT ant colony optimizer.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Evolutionary algorithms and dynamic programming.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Quasirandom rumor spreading: An experimental analysis.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2011

Quasi-random rumor spreading: Reducing randomness can be costly.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Social Networks Spread Rumors in Sublogarithmic Time.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Asymptotically Optimal Randomized Rumor Spreading.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Memory-Restricted Black-Box Complexity.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem.

[BibT_eX]

[DOI]

Edda Happ

Evol. Comput., 2011

Theory of Evolutionary Computation.

[BibT_eX]

[DOI]

Thomas Jansen

Algorithmica, 2011

Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting.

[BibT_eX]

[DOI]

Proceedings of the Scale Space and Variational Methods in Computer Vision, 2011

Too fast unbiased black-box algorithms.

[BibT_eX]

[DOI]

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Sharp bounds by probability-generating functions and variable drift.

[BibT_eX]

[DOI]

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Drift analysis.

[BibT_eX]

[DOI]

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets.

[BibT_eX]

[DOI]

Martin Schmidt

Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Faster black-box algorithms through higher arity operators.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2011

Memory-Constrained Algorithms for Shortest Path Problem.

[BibT_eX]

[DOI]

Tetsuo Asano

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Dependent Randomized Rounding: The Bipartite Case.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes.

[BibT_eX]

[DOI]

Proceedings of the Artificial Evolution, 2011

Analyzing Randomized Search Heuristics: Tools from Probability Theory.

[BibT_eX]

[DOI]

Proceedings of the Theory of Randomized Search Heuristics: Foundations and Recent Developments., 2011

2010

Hereditary Discrepancies in Different Numbers of Colors II.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Algorithmic construction of low-discrepancy point sets via dependent randomized rounding.

[BibT_eX]

[DOI]

J. Complex., 2010

Editorial.

[BibT_eX]

[DOI]

Ingo Wegener

Algorithmica, 2010

In Memoriam: Ingo Wegener.

[BibT_eX]

[DOI]

Algorithmica, 2010

Randomized Rounding for Routing and Covering Problems: Experiments and Improvements.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Brief Announcement: Stabilizing Consensus with the Power of Two Choices.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Optimizing Monotone Functions Can Be Difficult.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2010

Drift Analysis with Tail Bounds.

[BibT_eX]

[DOI]

Leslie Ann Goldberg

Proceedings of the Parallel Problem Solving from Nature, 2010

Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem.

[BibT_eX]

[DOI]

Süntje Böttcher

Proceedings of the Parallel Problem Solving from Nature, 2010

Edge-based representation beats vertex-based representation in shortest path problems.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Quasirandom evolutionary algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Drift analysis and linear functions revisited.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009

Quasirandom Rumor Spreading on Expanders.

[BibT_eX]

[DOI]

Thomas Sauerwald

Electron. Notes Discret. Math., 2009

A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Deterministic Random Walks on the Two-Dimensional Grid.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Tight Bounds for Quasirandom Rumor Spreading.

[BibT_eX]

[DOI]

Spyros Angelopoulos

Anna Huber

Konstantinos Panagiotou

Electron. J. Comb., 2009

Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness.

[BibT_eX]

[DOI]

Thomas Sauerwald

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Improved analysis methods for crossover-based algorithms.

[BibT_eX]

[DOI]

Madeleine Theile

Proceedings of the Genetic and Evolutionary Computation Conference, 2009

BBOB: Nelder-Mead with resize and halfruns.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Computing single source shortest paths using single-objective fitness.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Genetic Algorithms, 2009

Stabilizing Consensus with the Power of Two Choices.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods for Distributed Cooperative Systems, 06.09., 2009

Introducing Quasirandomness to Computer Science.

[BibT_eX]

[DOI]

Proceedings of the Efficient Algorithms, 2009

2008

Component-by-component construction of low-discrepancy point sets of small size.

[BibT_eX]

[DOI]

Peter Kritzer

Friedrich Pillichshammer

Monte Carlo Methods Appl., 2008

How Single Ant ACO Systems Optimize Pseudo-Boolean Functions.

[BibT_eX]

[DOI]

Ching Hoo Tang

Proceedings of the Parallel Problem Solving from Nature, 2008

Comparing global and local mutations on bit strings.

[BibT_eX]

[DOI]

Thomas Jansen

Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Directed trees: A powerful representation for sorting and ordering problems.

[BibT_eX]

[DOI]

Edda Happ

Proceedings of the IEEE Congress on Evolutionary Computation, 2008

2007

Roundings Respecting Hard Constraints.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

On the minimum load coloring problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Unbiased Matrix Rounding.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

The Interval Liar Game.

[BibT_eX]

[DOI]

David Steurer

Electron. Notes Discret. Math., 2007

Partial Colorings of Unimodular Hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Deterministic Random Walks on Regular Trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Matrix approximation and Tusnády's problem.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Deterministic random walks on the integers.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators.

[BibT_eX]

[DOI]

Evol. Comput., 2007

Randomly Rounding Rationals with Cardinality Constraints and Derandomizations.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

On the runtime analysis of the 1-ANT ACO algorithm.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Adjacency list matchings: an ideal genotype for cycle covers.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Faster Evolutionary Algorithms by Superior Graph Representation.

[BibT_eX]

[DOI]

Tobias Storch

Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2007

Refined runtime analysis of a basic ant colony optimization algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2007

A rigorous view on neutrality.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2007

2006

Improved bounds and schemes for the declustering problem.

[BibT_eX]

[DOI]

Sören Werth

Theor. Comput. Sci., 2006

Matrix rounding with respect to small submatrices.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

Error Propagation in Game Trees.

[BibT_eX]

[DOI]

Ulf Lorenz

Math. Methods Oper. Res., 2006

Inserting Points Uniformly at Every Instance.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2006

Controlled Randomized Rounding.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Quasirandomness in Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Speeding up Evolutionary Algorithms by Restricted Mutation Operators.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Non-independent randomized rounding and coloring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Discrepancy of Symmetric Products of Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Generating Randomized Roundings with Cardinality Constraints and Derandomizations.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2006

Unbiased Rounding of Rational Matrices.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Deterministic Random Walks.

[BibT_eX]

[DOI]

Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005

Bounds and constructions for the star-discrepancy via ?-covers.

[BibT_eX]

[DOI]

J. Complex., 2005

Rounding of Sequences and Matrices, with Applications.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Matrix rounding with low error in small submatrices.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

European tenure games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Typical rounding problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Nonindependent Randomized Rounding and an Application to Digital Halftoning.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Global roundings of sequences.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

An Improved Discrepancy Approach to Declustering.

[BibT_eX]

[DOI]

Sören Werth

Electron. Notes Discret. Math., 2004

Coloring Graphs with Minimal Edge Load.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Discrepancy of Cartesian Products of Arithmetic Progressions.

[BibT_eX]

[DOI]

Petra Wehr

Electron. J. Comb., 2004

Linear Discrepancy of Totally Unimodular Matrices.

[BibT_eX]

[DOI]

Comb., 2004

Matrix rounding and approximation.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Multicolour Discrepancies.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Non-independent randomized rounding.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

On the discrepancy of combinatorial rectangles.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

Discrepancy in different numbers of colors.

[BibT_eX]

[DOI]

Discret. Math., 2002

Balanced Coloring: Equally Easy for All Numbers of Colors?

[BibT_eX]

[DOI]

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Antirandomizing the Wrong Game.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Non-independent Randomized Rounding and an Application to Digital Halftoning.

[BibT_eX]

[DOI]

Henning Schnieder

Proceedings of the Algorithms, 2002

2001

Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Multi-Color Discrepancies - Extended Abstract -.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Vector Balancing Games with Aging.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Coloring t-dimensional m-Boxes.

[BibT_eX]

[DOI]

Geir Agnarsson

Tomasz Schoen

Discret. Math., 2001

Recursive Randomized Coloring Beats Fair Dice Random Colorings.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Lattice approximation and linear discrepency of totally unimodular matrices.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Structured Randomized Rounding and Coloring.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

Linear And Hereditary Discrepancy.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

Linear Discrepancy of Basic Totally Unimodular Matrices.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

1999

Approximation of Multi-color Discrepancy.

[BibT_eX]

[DOI]