Search the dblp DataBase
Benjamin Doerr :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Benjamin Doerr Typical Rounding Problems. [Citation Graph (0, 0)][DBLP ] APPROX, 2002, pp:81-93 [Conf ] Benjamin Doerr , Henning Schnieder Non-independent Randomized Rounding and an Application to Digital Halftoning. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:399-410 [Conf ] Benjamin Doerr Structured Randomized Rounding and Coloring. [Citation Graph (0, 0)][DBLP ] FCT, 2001, pp:461-471 [Conf ] Benjamin Doerr , Christian Klein Unbiased Rounding of Rational Matrices. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2006, pp:200-211 [Conf ] Benjamin Doerr Antirandomizing the Wrong Game. [Citation Graph (0, 0)][DBLP ] ICALP, 2002, pp:876-887 [Conf ] Benjamin Doerr , Tobias Friedrich Deterministic Random Walks on the Two-Dimensional Grid. [Citation Graph (0, 0)][DBLP ] ISAAC, 2006, pp:474-483 [Conf ] Benjamin Doerr , Johannes Lengler , David Steurer The Interval Liar Game. [Citation Graph (0, 0)][DBLP ] ISAAC, 2006, pp:318-327 [Conf ] Benjamin Doerr , Nils Hebbinghaus , Sören Werth Improved Bounds and Schemes for the Declustering Problem. [Citation Graph (0, 0)][DBLP ] MFCS, 2004, pp:760-771 [Conf ] Benjamin Doerr , Nils Hebbinghaus , Frank Neumann Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. [Citation Graph (0, 0)][DBLP ] PPSN, 2006, pp:978-987 [Conf ] Benjamin Doerr , Anand Srivastav Approximation of Multi-color Discrepancy. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:39-50 [Conf ] Benjamin Doerr Lattice approximation and linear discrepency of totally unimodular matrices. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:119-125 [Conf ] Benjamin Doerr Non-independent randomized rounding. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:506-507 [Conf ] Benjamin Doerr Matrix rounding and approximation. [Citation Graph (0, 0)][DBLP ] SODA, 2004, pp:575-576 [Conf ] Benjamin Doerr Matrix rounding with low error in small submatrices. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:1067-1068 [Conf ] Benjamin Doerr Balanced Coloring: Equally Easy for All Numbers of Colors? [Citation Graph (0, 0)][DBLP ] STACS, 2002, pp:112-120 [Conf ] Benjamin Doerr Roundings Respecting Hard Constraints. [Citation Graph (0, 0)][DBLP ] STACS, 2005, pp:617-628 [Conf ] Benjamin Doerr Generating Randomized Roundings with Cardinality Constraints and Derandomizations. [Citation Graph (0, 0)][DBLP ] STACS, 2006, pp:571-583 [Conf ] Benjamin Doerr , Anand Srivastav Recursive Randomized Coloring Beats Fair Dice Random Colorings. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:183-194 [Conf ] Benjamin Doerr Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. [Citation Graph (0, 0)][DBLP ] STACS, 2007, pp:441-452 [Conf ] Benjamin Doerr , Tobias Friedrich , Christian Klein , Ralf Osbild Unbiased Matrix Rounding. [Citation Graph (0, 0)][DBLP ] SWAT, 2006, pp:102-112 [Conf ] Nitin Ahuja , Andreas Baltz , Benjamin Doerr , Ales Prívetivý , Anand Srivastav On the Minimum Load Coloring Problem. [Citation Graph (0, 0)][DBLP ] WAOA, 2005, pp:15-26 [Conf ] Benjamin Doerr , Tobias Friedrich , Christian Klein , Ralf Osbild Rounding of Sequences and Matrices, with Applications. [Citation Graph (0, 0)][DBLP ] WAOA, 2005, pp:96-109 [Conf ] Benjamin Doerr Linear Discrepancy of Totally Unimodular Matrices. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2004, v:24, n:1, pp:117-125 [Journal ] Benjamin Doerr Linear Discrepancy of Basic Totally Unimodular Matrices. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2000, v:7, n:, pp:- [Journal ] Benjamin Doerr , Anand Srivastav , Petra Wehr Discrepancy of Cartesian Products of Arithmetic Progressions. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal ] Benjamin Doerr Linear And Hereditary Discrepancy. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2000, v:9, n:4, pp:- [Journal ] Benjamin Doerr , Anand Srivastav Multicolour Discrepancies. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2003, v:12, n:4, pp:365-399 [Journal ] Benjamin Doerr Non-independent randomized rounding and coloring. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:4, pp:650-659 [Journal ] Geir Agnarsson , Benjamin Doerr , Tomasz Schoen Coloring t -dimensional m -Boxes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:226, n:1-3, pp:21-33 [Journal ] Benjamin Doerr Discrepancy in different numbers of colors. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:250, n:1-3, pp:63-70 [Journal ] Benjamin Doerr Matrix approximation and Tusnády's problem. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2007, v:28, n:3, pp:990-995 [Journal ] Benjamin Doerr Global roundings of sequences. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:92, n:3, pp:113-116 [Journal ] Benjamin Doerr , Michael Gnewuch , Anand Srivastav Bounds and constructions for the star-discrepancy via ?-covers. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2005, v:21, n:5, pp:691-709 [Journal ] Benjamin Doerr Vector Balancing Games with Aging. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2001, v:95, n:2, pp:219-233 [Journal ] Noga Alon , Benjamin Doerr , Tomasz Luczak , Tomasz Schoen On the discrepancy of combinatorial rectangles. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:21, n:3-4, pp:205-215 [Journal ] Benjamin Doerr Matrix rounding with respect to small submatrices. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2006, v:28, n:1, pp:107-112 [Journal ] Benjamin Doerr Nonindependent Randomized Rounding and an Application to Digital Halftoning. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:34, n:2, pp:299-317 [Journal ] Benjamin Doerr Typical rounding problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:312, n:2-3, pp:463-477 [Journal ] Benjamin Doerr European tenure games. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:303, n:3, pp:339-351 [Journal ] Benjamin Doerr , Nils Hebbinghaus , Sören Werth Improved bounds and schemes for the declustering problem. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:359, n:1-3, pp:123-132 [Journal ] Benjamin Doerr , Daniel Johannsen Adjacency list matchings: an ideal genotype for cycle covers. [Citation Graph (0, 0)][DBLP ] GECCO, 2007, pp:1203-1210 [Conf ] Benjamin Doerr , Frank Neumann , Dirk Sudholt , Carsten Witt On the runtime analysis of the 1-ANT ACO algorithm. [Citation Graph (0, 0)][DBLP ] GECCO, 2007, pp:33-40 [Conf ] Benjamin Doerr , Christian Klein , Tobias Storch Faster Evolutionary Algorithms by Superior Graph Representation. [Citation Graph (0, 0)][DBLP ] FOCI, 2007, pp:245-250 [Conf ] Benjamin Doerr , Mahmoud Fouz Hereditary Discrepancies in Different Numbers of Colors II [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Benjamin Doerr , Nils Hebbinghaus , Sören Werth Improved Bounds and Schemes for the Declustering Problem [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Benjamin Doerr , Tobias Friedrich , Christian Klein , Ralf Osbild Unbiased Matrix Rounding [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Benjamin Doerr Roundings Respecting Hard Constraints. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:40, n:4, pp:467-483 [Journal ] Quasirandom Rumor Spreading: An Experimental Analysis. [Citation Graph (, )][DBLP ] Randomized Rounding in the Presence of a Cardinality Constraint. [Citation Graph (, )][DBLP ] Introducing Quasirandomness to Computer Science. [Citation Graph (, )][DBLP ] Comparing global and local mutations on bit strings. [Citation Graph (, )][DBLP ] Crossover can provably be useful in evolutionary computation. [Citation Graph (, )][DBLP ] Improved analysis methods for crossover-based algorithms. [Citation Graph (, )][DBLP ] Evolutionary algorithms and dynamic programming. [Citation Graph (, )][DBLP ] BBOB: Nelder-Mead with resize and halfruns. [Citation Graph (, )][DBLP ] Quasirandom evolutionary algorithms. [Citation Graph (, )][DBLP ] Edge-based representation beats vertex-based representation in shortest path problems. [Citation Graph (, )][DBLP ] Multiplicative drift analysis. [Citation Graph (, )][DBLP ] Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. [Citation Graph (, )][DBLP ] How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. [Citation Graph (, )][DBLP ] More Effective Crossover Operators for the All-Pairs Shortest Path Problem. [Citation Graph (, )][DBLP ] Optimizing Monotone Functions Can Be Difficult. [Citation Graph (, )][DBLP ] Drift Analysis with Tail Bounds. [Citation Graph (, )][DBLP ] Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. [Citation Graph (, )][DBLP ] Adaptive Drift Analysis. [Citation Graph (, )][DBLP ] Deterministic random walks on regular trees. [Citation Graph (, )][DBLP ] Quasirandom rumor spreading. [Citation Graph (, )][DBLP ] Brief Announcement: Stabilizing Consensus with the Power of Two Choices. [Citation Graph (, )][DBLP ] Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. [Citation Graph (, )][DBLP ] A rigorous view on neutrality. [Citation Graph (, )][DBLP ] Refined runtime analysis of a basic ant colony optimization algorithm. [Citation Graph (, )][DBLP ] A tight analysis of the (1 + 1)-EA for the single source shortest path problem. [Citation Graph (, )][DBLP ] Directed trees: A powerful representation for sorting and ordering problems. [Citation Graph (, )][DBLP ] Editorial. [Citation Graph (, )][DBLP ] Discrepancy of Symmetric Products of Hypergraphs. [Citation Graph (, )][DBLP ] Strong Robustness of Randomized Rumor Spreading Protocols [Citation Graph (, )][DBLP ] Deterministic Random Walks on Regular Trees [Citation Graph (, )][DBLP ] Randomized Rounding for Routing and Covering Problems: Experiments and Improvements [Citation Graph (, )][DBLP ] Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly [Citation Graph (, )][DBLP ] Deterministic Random Walks on the Two-Dimensional Grid. [Citation Graph (, )][DBLP ] Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. [Citation Graph (, )][DBLP ] Speeding up Evolutionary Algorithms by Restricted Mutation Operators. [Citation Graph (, )][DBLP ] Deterministic random walks on the integers. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.457secs