The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Benjamin Doerr: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Benjamin Doerr
    Typical Rounding Problems. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:81-93 [Conf]
  2. 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]
  3. Benjamin Doerr
    Structured Randomized Rounding and Coloring. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:461-471 [Conf]
  4. Benjamin Doerr, Christian Klein
    Unbiased Rounding of Rational Matrices. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:200-211 [Conf]
  5. Benjamin Doerr
    Antirandomizing the Wrong Game. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:876-887 [Conf]
  6. Benjamin Doerr, Tobias Friedrich
    Deterministic Random Walks on the Two-Dimensional Grid. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:474-483 [Conf]
  7. Benjamin Doerr, Johannes Lengler, David Steurer
    The Interval Liar Game. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:318-327 [Conf]
  8. 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]
  9. 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]
  10. Benjamin Doerr, Anand Srivastav
    Approximation of Multi-color Discrepancy. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:39-50 [Conf]
  11. Benjamin Doerr
    Lattice approximation and linear discrepency of totally unimodular matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:119-125 [Conf]
  12. Benjamin Doerr
    Non-independent randomized rounding. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:506-507 [Conf]
  13. Benjamin Doerr
    Matrix rounding and approximation. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:575-576 [Conf]
  14. Benjamin Doerr
    Matrix rounding with low error in small submatrices. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1067-1068 [Conf]
  15. Benjamin Doerr
    Balanced Coloring: Equally Easy for All Numbers of Colors? [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:112-120 [Conf]
  16. Benjamin Doerr
    Roundings Respecting Hard Constraints. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:617-628 [Conf]
  17. Benjamin Doerr
    Generating Randomized Roundings with Cardinality Constraints and Derandomizations. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:571-583 [Conf]
  18. Benjamin Doerr, Anand Srivastav
    Recursive Randomized Coloring Beats Fair Dice Random Colorings. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:183-194 [Conf]
  19. Benjamin Doerr
    Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:441-452 [Conf]
  20. Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
    Unbiased Matrix Rounding. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:102-112 [Conf]
  21. 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]
  22. 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]
  23. Benjamin Doerr
    Linear Discrepancy of Totally Unimodular Matrices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:1, pp:117-125 [Journal]
  24. Benjamin Doerr
    Linear Discrepancy of Basic Totally Unimodular Matrices. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  25. 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]
  26. Benjamin Doerr
    Linear And Hereditary Discrepancy. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:4, pp:- [Journal]
  27. Benjamin Doerr, Anand Srivastav
    Multicolour Discrepancies. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:4, pp:365-399 [Journal]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. Benjamin Doerr
    Global roundings of sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:3, pp:113-116 [Journal]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. Benjamin Doerr
    Typical rounding problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:2-3, pp:463-477 [Journal]
  39. Benjamin Doerr
    European tenure games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:339-351 [Journal]
  40. 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]
  41. Benjamin Doerr, Daniel Johannsen
    Adjacency list matchings: an ideal genotype for cycle covers. [Citation Graph (0, 0)][DBLP]
    GECCO, 2007, pp:1203-1210 [Conf]
  42. 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]
  43. Benjamin Doerr, Christian Klein, Tobias Storch
    Faster Evolutionary Algorithms by Superior Graph Representation. [Citation Graph (0, 0)][DBLP]
    FOCI, 2007, pp:245-250 [Conf]
  44. Benjamin Doerr, Mahmoud Fouz
    Hereditary Discrepancies in Different Numbers of Colors II [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  45. 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]
  46. Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
    Unbiased Matrix Rounding [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  47. Benjamin Doerr
    Roundings Respecting Hard Constraints. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:4, pp:467-483 [Journal]

  48. Quasirandom Rumor Spreading: An Experimental Analysis. [Citation Graph (, )][DBLP]


  49. Randomized Rounding in the Presence of a Cardinality Constraint. [Citation Graph (, )][DBLP]


  50. Introducing Quasirandomness to Computer Science. [Citation Graph (, )][DBLP]


  51. Comparing global and local mutations on bit strings. [Citation Graph (, )][DBLP]


  52. Crossover can provably be useful in evolutionary computation. [Citation Graph (, )][DBLP]


  53. Improved analysis methods for crossover-based algorithms. [Citation Graph (, )][DBLP]


  54. Evolutionary algorithms and dynamic programming. [Citation Graph (, )][DBLP]


  55. BBOB: Nelder-Mead with resize and halfruns. [Citation Graph (, )][DBLP]


  56. Quasirandom evolutionary algorithms. [Citation Graph (, )][DBLP]


  57. Edge-based representation beats vertex-based representation in shortest path problems. [Citation Graph (, )][DBLP]


  58. Multiplicative drift analysis. [Citation Graph (, )][DBLP]


  59. Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. [Citation Graph (, )][DBLP]


  60. How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. [Citation Graph (, )][DBLP]


  61. More Effective Crossover Operators for the All-Pairs Shortest Path Problem. [Citation Graph (, )][DBLP]


  62. Optimizing Monotone Functions Can Be Difficult. [Citation Graph (, )][DBLP]


  63. Drift Analysis with Tail Bounds. [Citation Graph (, )][DBLP]


  64. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. [Citation Graph (, )][DBLP]


  65. Adaptive Drift Analysis. [Citation Graph (, )][DBLP]


  66. Deterministic random walks on regular trees. [Citation Graph (, )][DBLP]


  67. Quasirandom rumor spreading. [Citation Graph (, )][DBLP]


  68. Brief Announcement: Stabilizing Consensus with the Power of Two Choices. [Citation Graph (, )][DBLP]


  69. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. [Citation Graph (, )][DBLP]


  70. A rigorous view on neutrality. [Citation Graph (, )][DBLP]


  71. Refined runtime analysis of a basic ant colony optimization algorithm. [Citation Graph (, )][DBLP]


  72. A tight analysis of the (1 + 1)-EA for the single source shortest path problem. [Citation Graph (, )][DBLP]


  73. Directed trees: A powerful representation for sorting and ordering problems. [Citation Graph (, )][DBLP]


  74. Editorial. [Citation Graph (, )][DBLP]


  75. Discrepancy of Symmetric Products of Hypergraphs. [Citation Graph (, )][DBLP]


  76. Strong Robustness of Randomized Rumor Spreading Protocols [Citation Graph (, )][DBLP]


  77. Deterministic Random Walks on Regular Trees [Citation Graph (, )][DBLP]


  78. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements [Citation Graph (, )][DBLP]


  79. Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly [Citation Graph (, )][DBLP]


  80. Deterministic Random Walks on the Two-Dimensional Grid. [Citation Graph (, )][DBLP]


  81. Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. [Citation Graph (, )][DBLP]


  82. Speeding up Evolutionary Algorithms by Restricted Mutation Operators. [Citation Graph (, )][DBLP]


  83. Deterministic random walks on the integers. [Citation Graph (, )][DBLP]


Search in 0.021secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002