Benjamin Doerr

According to our database1, Benjamin Doerr authored at least 226 papers between 1999 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Working principles of binary differential evolution.
Theor. Comput. Sci., 2020

Optimal parameter choices via precise black-box analysis.
Theor. Comput. Sci., 2020

2019
Analyzing randomized search heuristics via stochastic domination.
Theor. Comput. Sci., 2019

The query complexity of a permutation-based variant of Mastermind.
Discrete Applied Mathematics, 2019

Optimization of Chance-Constrained Submodular Functions.
CoRR, 2019

Sharp Bounds for Genetic Drift in EDAs.
CoRR, 2019

The Runtime of the Compact Genetic Algorithm on Jump Functions.
CoRR, 2019

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

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

The ( $$1+\lambda $$ 1 + λ ) Evolutionary Algorithm with Self-Adjusting Mutation Rate.
Algorithmica, 2019

Island Models Meet Rumor Spreading.
Algorithmica, 2019

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

Fixed-target runtime analysis of the (1 + 1) EA with resampling.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Expressiveness and robustness of landscape features.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

When resampling to cope with noise, use median, not mean.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Evolving boolean functions with conjunctions and disjunctions via genetic programming.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Multiplicative up-drift.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Self-adjusting mutation rates with provably optimal success rules.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Fast re-optimization via structural diversity.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Theory for non-theoreticians: introductory tutorial.
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.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

The efficiency threshold for the offspring population size of the (µ, λ) EA.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

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, 2019

A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

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

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

Probabilistic Tools for the Analysis of Randomized Optimization Heuristics.
CoRR, 2018

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

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

Precise Runtime Analysis for Plateaus.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Working principles of binary differential evolution.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Runtime analysis for self-adaptive mutation rates.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

On the runtime analysis of selection hyper-heuristics with adaptive learning periods.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Significance-based estimation-of-distribution algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Theory for non-theoreticians: tutorial.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Better runtime guarantees via stochastic domination (hot-off-the-press track at GECCO 2018).
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

A new analysis method for evolutionary optimization of dynamic and noisy objective functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

A tight runtime analysis for the (μ + λ) EA.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Better Runtime Guarantees via Stochastic Domination.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2018

2017
Detecting structural breaks in time series via genetic algorithms.
Soft Comput., 2017

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

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

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

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

Randomized Rumor Spreading Revisited.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Fast genetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Bounding bloat in genetic programming.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

The (1+λ) evolutionary algorithm with self-adjusting mutation rate.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Unknown solution length problems with no asymptotically optimal run time.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Theory for non-theoreticians.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016
How to Generate Randomized Roundings with Dependencies and How to Derandomize Them.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Playing Mastermind With Many Colors.
J. ACM, 2016

The Unrestricted Black-Box Complexity of Jump Functions.
Evolutionary Computation, 2016

Simple and optimal randomized fault-tolerant rumor spreading.
Distributed Computing, 2016

Guest Editorial: Theory of Evolutionary Computation.
Algorithmica, 2016

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

k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016


Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax.
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.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Theory for Non-Theoreticians.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm.
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.
Theor. Comput. Sci., 2015

From black-box complexity to designing new genetic algorithms.
Theor. Comput. Sci., 2015

Online Checkpointing with Improved Worst-Case Guarantees.
INFORMS Journal on Computing, 2015

Unbiased Black-Box Complexities of Jump Functions.
Evolutionary Computation, 2015

Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).
Dagstuhl Reports, 2015

Optimising Spatial and Tonal Data for PDE-based Inpainting.
CoRR, 2015

Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization.
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.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ.
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.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015

2014
The Price of Anarchy for Selfish Ring Routing is Two.
ACM Trans. Economics and Comput., 2014

Editorial for the Special Issue on Theoretical Foundations of Evolutionary Computation.
IEEE Trans. Evolutionary Computation, 2014

Reducing the arity in unbiased black-box complexity.
Theor. Comput. Sci., 2014

Quasirandom Rumor Spreading.
ACM Trans. Algorithms, 2014

Playing Mastermind with Constant-Size Memory.
Theory Comput. Syst., 2014

Randomized Rounding in the Presence of a Cardinality Constraint.
ACM Journal of Experimental Algorithmics, 2014

A lower bound for the discrepancy of a random point set.
J. Complexity, 2014

Ranking-Based Black-Box Complexity.
Algorithmica, 2014

The unbiased black-box complexity of partition is polynomial.
Artif. Intell., 2014

Unbiased black-box complexities of jump functions: how to cross large plateaus.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Monotonic functions in EC: anything but monotone!
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Tight Analysis of Randomized Rumor Spreading in Complete Graphs.
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013
Black-box complexities of combinatorial problems.
Theor. Comput. Sci., 2013

More effective crossover operators for the all-pairs shortest path problem.
Theor. Comput. Sci., 2013

Improved approximation algorithms for the Min-Max Selecting Items problem.
Inf. Process. Lett., 2013

Mutation Rate Matters Even When Optimizing Monotonic Functions.
Evolutionary Computation, 2013

Strong robustness of randomized rumor spreading protocols.
Discrete Applied Mathematics, 2013

Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271).
Dagstuhl Reports, 2013

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

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

Collecting Coupons with Random Initial Stake.
CoRR, 2013

Adaptive Drift Analysis.
Algorithmica, 2013

How the (1+λ) evolutionary algorithm optimizes linear functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

A method to derive fixed budget results from expected optimisation times.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Evolutionary algorithms for the detection of structural breaks in time series: extended abstract.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Lessons from the black-box: fast crossover-based genetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Black-box complexity: from complexity theory to playing mastermind.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

When do evolutionary algorithms optimize separable functions in parallel?
Proceedings of the Foundations of Genetic Algorithms XII, 2013

Lower bounds for the runtime of a global multi-objective evolutionary algorithm.
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.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

The Query Complexity of Finding a Hidden Permutation.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Non-existence of linear universal drift functions.
Theor. Comput. Sci., 2012

Crossover can provably be useful in evolutionary computation.
Theor. Comput. Sci., 2012

Memory-restricted black-box complexity of OneMax.
Inf. Process. Lett., 2012

The Deterministic and Randomized Query Complexity of a Simple Guessing Game.
Electronic Colloquium on Computational Complexity (ECCC), 2012

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

Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity
CoRR, 2012

Why rumors spread so quickly in social networks.
Commun. ACM, 2012

Multiplicative Drift Analysis.
Algorithmica, 2012

Asynchronous Rumor Spreading in Preferential Attachment Graphs.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Experimental Analysis of Rumor Spreading in Social Networks.
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.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Ants easily solve stochastic shortest path problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Black-box complexity: from complexity theory to playing mastermind.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
Runtime analysis of the 1-ANT ant colony optimizer.
Theor. Comput. Sci., 2011

Evolutionary algorithms and dynamic programming.
Theor. Comput. Sci., 2011

Quasirandom rumor spreading: An experimental analysis.
ACM Journal of Experimental Algorithmics, 2011

Quasi-random rumor spreading: Reducing randomness can be costly.
Inf. Process. Lett., 2011

Social Networks Spread Rumors in Sublogarithmic Time.
Electronic Notes in Discrete Mathematics, 2011

Asymptotically Optimal Randomized Rumor Spreading.
Electronic Notes in Discrete Mathematics, 2011

Memory-Restricted Black-Box Complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2011

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

Theory of Evolutionary Computation.
Algorithmica, 2011

Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2011

Too fast unbiased black-box algorithms.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Sharp bounds by probability-generating functions and variable drift.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

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

Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Faster black-box algorithms through higher arity operators.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity.
Proceedings of the Computer Science - Theory and Applications, 2011

Memory-Constrained Algorithms for Shortest Path Problem.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Dependent Randomized Rounding: The Bipartite Case.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes.
Proceedings of the Artificial Evolution, 2011

Analyzing Randomized Search Heuristics: Tools from Probability Theory.
Proceedings of the Theory of Randomized Search Heuristics: Foundations and Recent Developments., 2011

2010
Hereditary Discrepancies in Different Numbers of Colors II.
SIAM J. Discrete Math., 2010

Algorithmic construction of low-discrepancy point sets via dependent randomized rounding.
J. Complexity, 2010

Editorial.
Algorithmica, 2010

In Memoriam: Ingo Wegener.
Algorithmica, 2010

Randomized Rounding for Routing and Covering Problems: Experiments and Improvements.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Brief Announcement: Stabilizing Consensus with the Power of Two Choices.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Optimizing Monotone Functions Can Be Difficult.
Proceedings of the Parallel Problem Solving from Nature, 2010

Drift Analysis with Tail Bounds.
Proceedings of the Parallel Problem Solving from Nature, 2010

Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem.
Proceedings of the Parallel Problem Solving from Nature, 2010

Edge-based representation beats vertex-based representation in shortest path problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Quasirandom evolutionary algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Drift analysis and linear functions revisited.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009
Quasirandom Rumor Spreading on Expanders.
Electronic Notes in Discrete Mathematics, 2009

A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading.
Electronic Notes in Discrete Mathematics, 2009

Deterministic Random Walks on the Two-Dimensional Grid.
Combinatorics, Probability & Computing, 2009

Tight Bounds for Quasirandom Rumor Spreading.
Electr. J. Comb., 2009

Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Improved analysis methods for crossover-based algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

BBOB: Nelder-Mead with resize and halfruns.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Evolutionary algorithms and dynamic programming.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Computing single source shortest paths using single-objective fitness.
Proceedings of the Foundations of Genetic Algorithms, 2009

Stabilizing Consensus with the Power of Two Choices.
Proceedings of the Algorithmic Methods for Distributed Cooperative Systems, 06.09., 2009

Introducing Quasirandomness to Computer Science.
Proceedings of the Efficient Algorithms, 2009

2008
Component-by-component construction of low-discrepancy point sets of small size.
Monte Carlo Meth. and Appl., 2008

How Single Ant ACO Systems Optimize Pseudo-Boolean Functions.
Proceedings of the Parallel Problem Solving from Nature, 2008

Comparing global and local mutations on bit strings.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Directed trees: A powerful representation for sorting and ordering problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2008

2007
Roundings Respecting Hard Constraints.
Theory Comput. Syst., 2007

On the minimum load coloring problem.
J. Discrete Algorithms, 2007

Unbiased Matrix Rounding.
Electronic Notes in Discrete Mathematics, 2007

The Interval Liar Game.
Electronic Notes in Discrete Mathematics, 2007

Partial Colorings of Unimodular Hypergraphs.
Electronic Notes in Discrete Mathematics, 2007

Deterministic Random Walks on Regular Trees.
Electronic Notes in Discrete Mathematics, 2007

Matrix approximation and Tusnády's problem.
Eur. J. Comb., 2007

Deterministic random walks on the integers.
Eur. J. Comb., 2007

Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators.
Evolutionary Computation, 2007

Randomly Rounding Rationals with Cardinality Constraints and Derandomizations.
Proceedings of the STACS 2007, 2007

On the runtime analysis of the 1-ANT ACO algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Adjacency list matchings: an ideal genotype for cycle covers.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Faster Evolutionary Algorithms by Superior Graph Representation.
Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2007

Refined runtime analysis of a basic ant colony optimization algorithm.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

A rigorous view on neutrality.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

2006
Improved bounds and schemes for the declustering problem.
Theor. Comput. Sci., 2006

Matrix rounding with respect to small submatrices.
Random Struct. Algorithms, 2006

Error Propagation in Game Trees.
Math. Meth. of OR, 2006

Inserting Points Uniformly at Every Instance.
IEICE Transactions, 2006

Controlled Randomized Rounding.
Electronic Notes in Discrete Mathematics, 2006

Quasirandomness in Graphs.
Electronic Notes in Discrete Mathematics, 2006

Speeding up Evolutionary Algorithms by Restricted Mutation Operators.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Non-independent randomized rounding and coloring.
Discrete Applied Mathematics, 2006

Discrepancy of Symmetric Products of Hypergraphs.
Electr. J. Comb., 2006

Generating Randomized Roundings with Cardinality Constraints and Derandomizations.
Proceedings of the STACS 2006, 2006

Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators.
Proceedings of the Parallel Problem Solving from Nature, 2006

Unbiased Rounding of Rational Matrices.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Deterministic Random Walks.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005
Bounds and constructions for the star-discrepancy via ?-covers.
J. Complexity, 2005

Rounding of Sequences and Matrices, with Applications.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Matrix rounding with low error in small submatrices.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
European tenure games.
Theor. Comput. Sci., 2004

Typical rounding problems.
Theor. Comput. Sci., 2004

Nonindependent Randomized Rounding and an Application to Digital Halftoning.
SIAM J. Comput., 2004

Global roundings of sequences.
Inf. Process. Lett., 2004

An Improved Discrepancy Approach to Declustering.
Electronic Notes in Discrete Mathematics, 2004

Coloring Graphs with Minimal Edge Load.
Electronic Notes in Discrete Mathematics, 2004

Discrepancy of Cartesian Products of Arithmetic Progressions.
Electr. J. Comb., 2004

Linear Discrepancy of Totally Unimodular Matrices.
Combinatorica, 2004

Matrix rounding and approximation.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Multicolour Discrepancies.
Combinatorics, Probability & Computing, 2003

Non-independent randomized rounding.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
On the discrepancy of combinatorial rectangles.
Random Struct. Algorithms, 2002

Discrepancy in different numbers of colors.
Discrete Mathematics, 2002

Balanced Coloring: Equally Easy for All Numbers of Colors?
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Antirandomizing the Wrong Game.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Non-independent Randomized Rounding and an Application to Digital Halftoning.
Proceedings of the Algorithms, 2002

2001
Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract.
Electronic Notes in Discrete Mathematics, 2001

Multi-Color Discrepancies - Extended Abstract -.
Electronic Notes in Discrete Mathematics, 2001

Vector Balancing Games with Aging.
Electronic Notes in Discrete Mathematics, 2001

Coloring t-dimensional m-Boxes.
Discrete Mathematics, 2001

Recursive Randomized Coloring Beats Fair Dice Random Colorings.
Proceedings of the STACS 2001, 2001

Lattice approximation and linear discrepency of totally unimodular matrices.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Structured Randomized Rounding and Coloring.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000
Linear And Hereditary Discrepancy.
Combinatorics, Probability & Computing, 2000

Linear Discrepancy of Basic Totally Unimodular Matrices.
Electr. J. Comb., 2000

1999
Approximation of Multi-color Discrepancy.
Proceedings of the Randomization, 1999


  Loading...