- THE HEREDITARY DISCREPANCY IS NEARLY INDEPENDENT OF THE NUMBER OF COLORS
- Structured Randomized Rounding and Coloring Benjamin Doerr ?
- arXiv:cs.DS/0604068 Unbiased Matrix Rounding
- Improved Bounds and Schemes for the Declustering Problem ?
- Typical Rounding Problems Benjamin Doerr
- Crossover Can Provably be Useful in Evolutionary Computation
- An Improved Discrepancy Approach to Declustering
- Unbiased Matrix Rounding Tobias Friedrich
- Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
- Benjamin Doerr # and Ulf Lorenz # # Mathematisches Seminar II, Christian{Albrechts{Universitat zu Kiel,
- Generating Randomized Roundings with Cardinality Constraints and Derandomizations
- L p Linear Discrepancy of Totally Unimodular Benjamin Doerr +
- Matrix Rounding with Low Error in Small Submatrices Benjamin Doerr y
- Balanced Partitions of Vector Sequences Imre Barany # Benjamin Doerr +
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1--1 Deterministic Random Walks on the Integers
- ON THE DISCREPANCY OF COMBINATORIAL RECTANGLES
- Discrepancy of Cartesian Products of Arithmetic Progressions
- LINEAR AND HEREDITARY DISCREPANCY BENJAMIN DOERR
- Balanced Partitions of Vector Sequences Imre Barany
- Unbiased Rounding of Rational Matrices Benjamin Doerr and Christian Klein
- Rules of Good Scientific Practice -adopted by the senate of the of the Max Planck Society
- Speeding up Evolutionary Algorithms Through Restricted Mutation Operators
- Multi{Color Discrepancies Benjamin Doerr
- MULTI{COLOR DISCREPANCIES BENJAMIN DOERR AND ANAND SRIVASTAV
- Linear Discrepancy of Totally Unimodular Benjamin Doerr
- Deterministic Random Walks on the Two-Dimensional Grid
- Deterministic Random Walks on the Integers Joshua Cooper
- Discrepancy of Symmetric Products of Hypergraphs Benjamin Doerr
- Improved Bounds and Schemes for the Declustering Problem
- Global Roundings of Sequences Benjamin Doerr
- LINEAR AND HEREDITARY DISCREPANCY BENJAMIN DOERR
- Asymptotically Optimal Randomized Rumor Spreading
- Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy
- Directed Trees: A Powerful Representation for Sorting and Ordering Problems
- Faster Evolutionary Algorithms by Superior Graph Representation
- The Interval Liar Game Benjamin Doerr1
- arXiv:cs.DS/0604068v220Apr2006 Unbiased Matrix Rounding
- Generating Randomized Roundings with Cardinality Constraints and Derandomizations
- Inserting Points Uniformly at Every Instance Sachio Teramoto1, Tetsuo Asano1, Benjamin Doerr2, and Naoki Katoh3
- Roundings Respecting Hard Constraints Benjamin Doerr
- Improved Bounds and Schemes for the Declustering Problem
- Quasirandomness in Graphs Benjamin Doerr and Tobias Friedrich
- Multi{Color Discrepancies Dissertation
- European Tenure Games Benjamin Doerr ?
- THE HEREDITARY DISCREPANCY IS NEARLY INDEPENDENT OF THE NUMBER OF COLORS
- Improved Bounds and Schemes for the Declustering Problem #
- ON THE DISCREPANCY OF COMBINATORIAL RECTANGLES
- Social Networks Spread Rumors in Sublogarithmic Time Benjamin Doerr
- Quasirandomness in Graphs Benjamin Doerr and Tobias Friedrich
- Deterministic Random Walks on Regular Trees Joshua Cooper a Benjamin Doerr b
- Quasirandom Rumor Spreading: An Experimental Analysis BENJAMIN DOERR, Max-Planck-Institut fur Informatik, Saarbrucken, Germany
- Deterministic Random Walks on the TwoDimensional Grid
- Non-independent Randomized Rounding and an Application to Digital Halftoning
- Integral Approximation Habilitationsschrift
- Lattice Approximation and Linear Discrepancy of Totally Unimodular Matrices | Extended Abstract |
- Rounding of Sequences and Matrices, with Applications
- Antirandomizing the Wrong Game Benjamin Doerr
- Unbiased Matrix Rounding Tobias Friedrich
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 11 Deterministic Random Walks on the Integers
- Matrix Rounding with Low Error in Small Submatrices Benjamin Doerr
- Mathematisches Seminar Christian--Albrechts--Universit at
- Matrix Rounding with Respect to Small Submatrices
- MULTICOLOR DISCREPANCIES BENJAMIN DOERR AND ANAND SRIVASTAV
- Non-Independent Randomized Rounding and Benjamin Doerr y
- Roundings Respecting Hard Constraints Benjamin Doerr
- Computing Single Source Shortest Paths using Single-Objective Fitness Functions
- Monday morning 9.30-11.00
- Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and
- On the Minimum Load Coloring Problem Nitin Ahuja a
- On the Minimum Load Coloring Problem Nitin Ahuja a Andreas Baltz b,# Benjamin Doerr c
- Recursive Randomized Coloring Beats Fair Dice Random Colorings
- MULTICOLOR DISCREPANCY OF ARITHMETIC PROGRESSIONS {EXTENDED ABSTRACT{
- Approximation of Multi{Color Discrepancy Benjamin Doerr1? and Anand Srivastav2
- I N F O R M A T I K Universitat
- Rounding of Sequences and Matrices, with Applications
- Unbiased Rounding of Rational Matrices Benjamin Doerr and Christian Klein
- Partial Colorings of Unimodular Hypergraphs Benjamin Doerr
- Multi-Color Discrepancies | Extended Abstract |
- Matrix Approximation and Tusn ady's Problem Benjamin Doerr
- Speeding up Evolutionary Algorithms Through Restricted Mutation Operators
- Approximation of Multi--Color Discrepancy Benjamin Doerr 1? and Anand Srivastav 2
- Deterministic Random Walks on the Integers # Joshua Cooper + Benjamin Doerr # Joel Spencer
- Crossover Can Provably be Useful in Evolutionary Computation
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
- IEICE TRANS. INF. & SYST., VOL.Exx??, NO.xx XXXX 200x Inserting Points Uniformly at Every Instance
- Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
- Vector Balancing Games with Aging Benjamin Doerr
- Balanced Coloring: Equally Easy for all Numbers of Colors?
- Vector Balancing Games with Aging | Extended Abstract |
- Comparing Global and Local Mutations on Bit This work benefited from being presented and discussed at the Dagstuhl seminar
- Deterministic Random Walks on the Two-Dimensional Grid
- Inserting Points Uniformly at Every Instance Sachio Teramoto 1 , Tetsuo Asano 1 , Benjamin Doerr 2 , and Naoki Katoh 3
- COLORING t{DIMENSIONAL m{BOXES GEIR AGNARSSON, BENJAMIN DOERR, AND TOMASZ SCHOEN
- The Interval Liar Game Benjamin Doerr 1 , Johannes Lengler 2 , and David Steurer 3
- Linear Discrepancy of Totally Unimodular Matrices y
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1--1 Deterministic Random Walks on the Integers
- Matrix Rounding and Approximation Benjamin Doerr y
- Partial Colorings of Unimodular Hypergraphs Benjamin Doerr
- A Tight Analysis of the (1 + 1)-EA for the Single Source Shortest Path Problem
- Quasirandom Rumor Spreading Benjamin Doerr
- Deterministic Random Walks # Joshua Cooper + Benjamin Doerr # Joel Spencer Garbor Tardos
- IEICE TRANS. INF. & SYST., VOL.Exx--??, NO.xx XXXX 200x Inserting Points Uniformly at Every Instance
- Non-independent Randomized Rounding Benjamin Doerr y
- Bounds and Constructions for the StarDiscrepancy via #Covers
- Non-independent Randomized Rounding and an Application to Digital Halftoning
- Faster Evolutionary Algorithms by Superior Graph Representation
- Typical Rounding Problems Benjamin Doerr
- On the Minimum Load Coloring Problem --Extended Abtract--
- Lp Linear Discrepancy of Totally Unimodular Benjamin Doerr
- Tight Bounds for Quasirandom Rumor Spreading Spyros Angelopoulos Benjamin Doerr Anna Huber
- Matrix Rounding with Respect to Small Submatrices
- Discrepancy of Symmetric Products of Hypergraphs Benjamin Doerr Michael Gnewuch y Nils Hebbinghaus z
- Discrepancy in Di erent Numbers of Colors Benjamin Doerr
- Global Roundings of Sequences Benjamin Doerr
- On the Minimum Load Coloring Problem Extended Abtract
- Deterministic Random Walks on Regular Trees Joshua Cooper
- Rules of Procedure in Cases of Suspected Scientific Misconduct
- Guidelines of the Scientific Council for Electing Ombudspersons to Max Planck Institutes and the Sections of the Max Planck Society
- Tight Analysis of the (1 + 1)-EA for the Single Source Shortest Path Problem
