Database Entry Point
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications, generated: 11:28, 22 May 2013

Search the publication database

  . Return

Your search returned the following 136 documents:

  1. Benjamin Doerr and Leslie Ann Goldberg
    Adaptive Drift Analysis
    Algorithmica 65: 224-250, 2013
  2. Benjamin Doerr, Timo Kötzing, Johannes Lengler, and Carola Winzen
    Black-Box Complexities of Combinatorial Problems
    Theoretical Computer Science 471: 84-106, 2013. Note: To appear
  3. Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, and Madeleine Theile
    More effective crossover operators for the all-pairs shortest path problem
    Theoretical Computer Science 471 (3): 12-26, 2013. Note: To appear
  4. Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, and Christine Zarges
    Mutation rate matters even when optimizing monotonic functions
    Evolutionary Computation , 2013. Note: To appear
  5. Benjamin Doerr, Reto Spöhel, Henning Thomas, and Carola Winzen
    Playing Mastermind with many colors
    In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, USA, 2013, 695-704
  6. Benjamin Doerr and Carola Winzen
    Ranking-Based Black-Box Complexity
    Algorithmica , 2013. Note: To appear.
  7. Benjamin Doerr, Anna Huber, and Ariel Levavi
    Strong robustness of randomized rumor spreading protocols
    Discrete Applied Mathematics , 2013. Note: To appear
  8. Benjamin Doerr, Dirk Sudholt, and Carsten Witt
    When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
    In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), Adelaide, Australia, 2013. Note: To appear
  9. Benjamin Doerr, Ashish Hota, and Timo Kötzing
    Ants easily solve stochastic shortest path problems
    In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012, 17-24
  10. Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    Asynchronous rumor spreading in preferential attachment graphs
    In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, 2012, 307-315
  11. Benjamin Doerr
    Black-box complexity: from complexity theory to playing mastermind
    In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012, 1079-1092
  12. Benjamin Doerr and Carola Winzen
    Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
    In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, Angers, France, 2012, 205-216
  13. Benjamin Doerr, Edda Happ, and Christian Klein
    Crossover can provably be useful in evolutionary computation
    Theoretical Computer Science 425: 17-33, 2012
  14. Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    Experimental analysis of rumor spreading in social networks
    In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, Ein Gedi, Israel, 2012, 159-173. Note: To appear
  15. Benjamin Doerr, Shay Moran, Shlomo Moran, and Carola Winzen
    Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity
    arXiv abs/1209.6158: 1-18, 2012
  16. Benjamin Doerr and Carola Winzen
    Memory-restricted black-box complexity of OneMax
    Information Processing Letters 112: 32-34, 2012
  17. Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    Multiplicative Drift Analysis
    Algorithmica 64 (4): 673-697, 2012
  18. Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    Non-existence of linear universal drift functions
    Theoretical Computer Science 436: 71-86, 2012
  19. Benjamin Doerr and Carola Winzen
    Playing Mastermind with Constant-Size Memory
    In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, Paris, France, 2012, 441-452
  20. Benjamin Doerr and Carola Winzen
    Playing Mastermind with Constant-Size Memory
    Theory of Computing Systems Online First: 1-27, 2012. Note: to appear
  21. Benjamin Doerr, Carola Doerr, Reto Spöhel, and Henning Thomas
    Playing Mastermind with Many Colors
    arXiv abs/1207.0773: 1-22, 2012
  22. Benjamin Doerr and Carola Winzen
    Reducing the arity in unbiased black-box complexity
    In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012, 1309-1316
  23. Benjamin Doerr and Sebastian Pohl
    Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
    In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012, 1317-1324
  24. Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, and Carola Winzen
    The Price of Anarchy for Selfish Ring Routing is Two
    In: Internet and Network Economics : 8th International Workshop, WINE 2012, Liverpool, UK, 2012, 420-433

  25. Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Kasper Green Larsen, Kurt Mehlhorn, and Carola Winzen
    The Query Complexity of Finding a Hidden Permutation
    Electronic Colloquium on Computational Complexity (ECCC): Report Series 87 (Revision 1): 1-36, 2012
  26. Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    Why Rumors Spread Fast in Social Networks
    Communications of the ACM 55: 70-75, 2012
  27. Benjamin Doerr and Mahmoud Fouz
    Asymptotically optimal randomized rumor spreading
    Electronic Notes in Discrete Mathematics 38: 297-302, 2011
  28. Benjamin Doerr and Mahmoud Fouz
    Asymptotically Optimal Randomized Rumor Spreading
    In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zürich, Switzerland, 2011, 502-513
  29. Benjamin Doerr, Johannes Lengler, Timo Kötzing, and Carola Winzen
    Black-box complexities of combinatorial problems
    In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 981-988
  30. Benjamin Doerr, Marvin Künnemann, and Magnus Wahlström
    Dependent Randomized Rounding: The Bipartite Case
    In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), San Francisco, California, USA, 2011, 96-106
  31. Benjamin Doerr
    Drift analysis
    In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 1311-1320
  32. Benjamin Doerr, Anton Eremeev, Frank Neumann, Madeleine Theile, and Christian Thyssen
    Evolutionary algorithms and dynamic programming
    Theoretical Computer Science 412: 6020-6035, 2011
  33. Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Christian Lehre, Markus Wagner, and Carola Winzen
    Faster black-box algorithms through higher arity operators
    In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), Schwarzenberg, Austria, 2011, 163-172
  34. Tetsuo Asano and Benjamin Doerr
    Memory-constrained algorithms for shortest path problem
    In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Canada, 2011, 315-319
  35. Benjamin Doerr and Carola Winzen
    Memory-Restricted Black-Box Complexity
    Electronic Colloquium on Computational Complexity 18: 7 p., 2011
  36. Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, and Benjamin Doerr
    Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
    In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, Ein-Gedi, Israel, 2011, 26-37
  37. Benjamin Doerr and Mahmoud Fouz
    Quasi-random rumor spreading: Reducing randomness can be costly
    Information Processing Letters 111 (5): 227-230, 2011
  38. Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, and Thomas Sauerwald
    Quasirandom Rumor Spreading: An Experimental Analysis
    ACM Journal of Experimental Algorithmics 16: Article No. 3.3 p., 2011
  39. Benjamin Doerr, Daniel Johannsen, and Martin Schmidt
    Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
    In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 119-126
    [PDF: Download: DoerrJohannsenSchmidt11.pdf]
  40. Benjamin Doerr, Frank Neumann, Dirk Sudholt, and Carsten Witt
    Runtime analysis of the 1-ANT ant colony optimizer
    Theoretical Computer Science 412 (17): 1629-1644, 2011
  41. Benjamin Doerr, Mahmoud Fouz, and Carsten Witt
    Sharp bounds by probability-generating functions and variable drift
    In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 2083-2090
  42. Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    Social Networks Spread Rumors in Sublogarithmic Time
    In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, San Jose, CA, 2011, 21-30
  43. Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    Social Networks Spread Rumors in Sublogarithmic Time
    In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, Budapaest, 2011, 303-308
  44. Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler
    Stabilizing consensus with the power of two choices
    In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), San Jose, USA, 2011, 149-158
  45. Benjamin Doerr and Thomas Jansen
    Theory of Evolutionary Computation
    Algorithmica 59 (3): 299-300, 2011
  46. Benjamin Doerr, Edda Happ, and Christian Klein
    Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
    Evolutionary Computation 19 (4): 673-691, 2011
  47. Benjamin Doerr, Timo Kötzing, and Carola Winzen
    Too fast unbiased black-box algorithms
    In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 2043-2050
  48. Benjamin Doerr and Carola Winzen
    Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
    In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), St. Petersburg, Russia, 2011, 15-28
  49. Benjamin Doerr and Leslie Ann Goldberg
    Adaptive Drift Analysis
    In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, Krakow, Poland, 2010, 32-41
  50. Benjamin Doerr, Michael Gnewuch, and Magnus Wahlström
    Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
    Journal of Complexity 26 (5): 490-507, 2010
  51. Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler
    Brief Announcement: Stabilizing Consensus with the Power of Two Choices
    In: Distributed Computing : 24th International Symposium, DISC 2010, Cambridge, MA USA, 2010, 528-530
  52. Joshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer
    Deterministic Random Walks on Regular Trees
    Random Structures and Algorithms 37 (3): 353-366, 2010
  53. Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    Drift Analysis and Linear Functions Revisited
    In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, Barcelona, Spain, 2010, 1967-1974
  54. Benjamin Doerr and Leslie Ann Goldberg
    Drift Analysis with Tail Bounds
    In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, Krakow, Poland, 2010, 174-183
  55. Benjamin Doerr and Daniel Johannsen
    Edge-based representation beats vertex-based representation in shortest path problems
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 759-766
    [PDF: Download: DoerrJohannsen10.pdf]
  56. Benjamin Doerr, Frank Neumann, and Ingo Wegener
    Editorial
    Algorithmica 57 (1): 119-120, 2010
  57. Benjamin Doerr and Mahmoud Fouz
    Hereditary Discrepancies in Different Numbers of Colors II
    SIAM Journal on Discrete Mathematics 24 (3): 1205-1213, 2010
  58. Benjamin Doerr and Frank Neumann
    In Memoriam: Ingo Wegener
    Algorithmica 58 (3): 541-542, 2010
  59. Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, and Madeleine Theile
    More Effective Crossover Operators for the All-Pairs Shortest Path Problem
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 184-193
  60. Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    Multiplicative Drift Analysis
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 1449-1456. Note: Best Paper Award
  61. Süntje Böttcher, Benjamin Doerr, and Frank Neumann
    Optimal fixed and adaptive mutation rates for the LeadingOnes problem
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 1-10
  62. Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, and Christine Zarges
    Optimizing Monotone Functions Can Be Difficult
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 42-51
  63. Benjamin Doerr, Mahmoud Fouz, and Carsten Witt
    Quasirandom Evolutionary Algorithms
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 1457-1464
  64. Benjamin Doerr, Marvin Künnemann, and Magnus Wahlström
    Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
    In: Experimental Algorithms : 9th International Symposium, SEA 2010, Naples, Italy, 2010, 190-201
  65. Benjamin Doerr and Mahmoud Fouz
    A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
    Electronic Notes in Discrete Mathematics 34: 335 - 339, 2009
  66. Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, and Frank Neumann
    Computing Single Source Shortest Paths using Single-Objective Fitness Functions
    In: FOGA'09 : revised selected papers from ACM SIGEVO Foundations of Genetic Algorithms X, Orlando, USA, 2009, 59-66
  67. Benjamin Doerr and Tobias Friedrich
    Deterministic Random Walks on the Two-Dimensional Grid
    Combinatorics, Probability and Computing 18 (1-2): 123-144, 2009
  68. Benjamin Doerr, Anton Eremeev, Christian Horoba, Frank Neumann, and Madeleine Theile
    Evolutionary Algorithms and Dynamic Programming
    In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009, 771-777
  69. Benjamin Doerr, Michael Gnewuch, and Magnus Wahlström
    Implementation of a component-by-component algorithm to generate small low-discrepancy samples
    In: Monte Carlo and Quasi-Monte Carlo Methods 2008, Montreal, Canada, 2009, 323-338
  70. Benjamin Doerr and Madeleine Theile
    Improved Analysis Methods for Crossover-Based Algorithms
    In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009, 247-254
  71. Benjamin Doerr
    Introducing Quasirandomness to Computer Science
    In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 2009, 99-111
  72. Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
    Quasirandom Rumor Spreading on Expanders
    Electronic Notes in Discrete Mathematics 34: 243 - 247, 2009
  73. Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, and Thomas Sauerwald
    Quasirandom Rumor Spreading: An Experimental Analysis
    In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), New York, USA, 2009, 145-153
  74. Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
    Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
    In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, 2009, 366-377
  75. Benjamin Doerr and Magnus Wahlström
    Randomized Rounding in the Presence of a Cardinality Constraint
    In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), New York, USA, 2009, 162-174
  76. Benjamin Doerr, Anna Huber, and Ariel Levavi
    Strong robustness of randomized rumor spreading protocols
    In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, Hawaii, USA, 2009, 812-821. Note: Full version available from arXiv:1001.3056
  77. Spyros Angelopoulos, Benjamin Doerr, Anna Huber, and Konstantinos Panagiotou
    Tight bounds for quasirandom rumor spreading
    The Electronic Journal of Combinatorics 16 (1): R102,1-R102,19, 2009
  78. Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, and Magnus Wahlström
    BBOB: Nelder-Mead with resize and halfruns
    In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), Montreal, Québec, Canada, 2009, 2239-2246
  79. Benjamin Doerr, Michael Gnewuch, Peter Kritzer, and Peter Pillichshammer
    Component-by-component construction of low-discrepancy point sets of small size
    Monte Carlo Methods Applications 14 (2): 129-150, 2008
  80. Benjamin Doerr, Thomas Jansen, and Christian Klein
    Comparing local and global mutations on bit-strings.
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 929-936
  81. Benjamin Doerr, Michael Gnewuch, Peter Kritzer, and Friedrich Pillichshammer
    Component-by-component construction of low-discrepancy point sets of small size
    Monte Carlo Methods and Applications 14: 129-149, 2008
  82. Benjamin Doerr and Michael Gnewuch
    Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
    In: Monte Carlo and Quasi-Monte Carlo Methods 2006, Ulm, Germany, 2008, 299-312
  83. Benjamin Doerr, Edda Happ, and Christian Klein
    Crossover Can Provably be Useful in Evolutionary Computation
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 539-546. Note: Best paper award
  84. Joshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer
    Deterministic Random Walks on Regular Trees
    In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, USA, 2008, 766-772
  85. Benjamin Doerr and Edda Happ
    Directed trees: A Powerful Representation for Sorting and Ordering Problems
    In: Proceedings of CEC 2008, Hong Kong, 2008, 3606-3613
  86. Benjamin Doerr, Daniel Johannsen, and Ching Hoo Tang
    How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
    In: Parallel Problem Solving from Nature – PPSN X, Dortmund, Germany, 2008, 378-388
    [PDF: Download: DoerrJohannsenTang_HowSingleAntACOSystemsOptimizePseudo-BooleanFunctions.pdf] [PDF: Download: DoerrJohannsenTang_Appendix_HowSingleAntACOSystemsOptimizePseudo-BooleanFunctions.pdf]
  87. Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
    Quasirandom Rumor Spreading
    In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, USA, 2008, 773-781
  88. Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, and Frank Neumann
    A Rigorous View On Neutrality
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, 2007, 2591-2597
  89. Benjamin Doerr, Edda Happ, and Christian Klein
    A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, 2007, 1890-1895
  90. Benjamin Doerr and Daniel Johannsen
    Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
    In: Genetic and Evolutionary Computation Conference (GECCO-2007), London, UK, 2007, 1203-1210
    [PDF: Download: DoerrJohannsen_2007_AdjacencyListMatchings-AnIdealGenotypeForCycleCovers.pdf]
  91. Joshua Cooper, Benjamin Doerr, Joel Spencer, and Gábor Tardos
    Deterministic random walks on the integers
    European Journal of Combinatorics 28 (8): 2072-2090, 2007
  92. Joshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer
    Deterministic Random Walks on Regular Trees
    Electronic Notes in Discrete Mathematics 29: 509-513, 2007
  93. Benjamin Doerr, Christian Klein, and Tobias Storch
    Faster Evolutionary Algorithms by Superior Graph Representation
    In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), Honolulu, USA, 2007, 245-250
    [PDF: Download: foci2007.pdf]
  94. Benjamin Doerr
    Lp Linear discrepancy of totally unimodular matrices
    Linear Algebra and Its Applications 420 (2/3): 663-666, 2007

  95. Benjamin Doerr
    Matrix approximation and Tusnády's problem
    European Journal of Combinatorics 28 (3): 990-995, 2007

  96. Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Privetivy, and Anand Srivastav
    On the Minimum Load Coloring Problem
    Journal of Discrete Algorithms 5: 533-545, 2007
  97. Benjamin Doerr, Frank Neumann, Dirk Sudholt, and Carsten Witt
    On the Runtime Analysis of the 1-ANT ACO algorithm
    In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 33-40. Note: Best paper award
  98. Benjamin Doerr
    Partial Colorings of Unimodular Hypergraphs
    Electronic Notes in Discrete Mathematics 29: 359-363, 2007
  99. Benjamin Doerr
    Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
    In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, 2007, 441-452

  100. Benjamin Doerr and Daniel Johannsen
    Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, 2007, 501-507
    [PDF: Download: DoerrJohannsen_2007_RefinedRuntimeAnalysisOfABasicAntColonyOptimizationAlgorithm.pdf]
  101. Benjamin Doerr
    Roundings respecting hard constraints
    Theory of Computing Systems 40 (4): 467-483, 2007
  102. Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann
    Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
    Evolutionary Computation 15 (4): 401-410, 2007
  103. Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
    Unbiased Matrix Rounding
    Electronic Notes in Discrete Mathematics 28: 41-46, 2007
  104. Imre Bárány and Benjamin Doerr
    Balanced partitions of vector sequences
    Linear Algebra and Its Applications 414 (2-3): 464-469, 2006

  105. Benjamin Doerr and Michael Gnewuch
    Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding
    University Kiel, Kiel, 06-14, Research Report
  106. Benjamin Doerr and Christian Klein
    Controlled Randomized Rounding
    Electronic Notes in Discrete Mathematics 25: 39-40, 2006
  107. Joshua Cooper, Benjamin Doerr, Joel Spencer, and Gábor Tardos
    Deterministic Random Walks
    In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), Miami, FL, USA, 2006, 185-197
  108. Joshua Cooper, Benjamin Doerr, Joel Spencer, and Gabor Tardos
    Deterministic Random Walks on the Integers
    Internet
  109. Benjamin Doerr and Tobias Friedrich
    Deterministic Random Walks on the Two-Dimensional Grid
    In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, 2006, 474-483
    [PDF: Download: 2006ISAAC.pdf]
  110. Benjamin Doerr, Michael Gnewuch, and Nils Hebbinghaus
    Discrepancy of Symmetric Products of Hypergraphs
    The Electronic Journal of Combinatorics 13: 1-12, 2006
    [PDF: Download: v13i1r40.pdf]
  111. Benjamin Doerr and Ulf Lorenz
    Error Propagation in Game Trees
    Mathematical Methods of Operations Research 64 (1): 79-93, 2006

  112. Benjamin Doerr
    Generating Randomized Roundings with Cardinality Constraints and Derandomizations
    In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, 2006, 571-583

  113. Benjamin Doerr and Mahmoud Fouz
    Hereditary Discrepancies in Different Numbers of Colors II
    Internet
  114. Benjamin Doerr, Nils Hebbinghaus, and Sören Werth
    Improved Bounds and Schemes for the Declustering Problem
    Theoretical Computer Science 359 (1-3): 123-132, 2006

  115. Sachio Teramoto, Tetsuo Asano, Naoki Katoh, and Benjamin Doerr
    Inserting Points Uniformly at Every Instance
    IEICE - Transactions on Information and Systems E89-D (8): 2348-2356, 2006
  116. Benjamin Doerr
    Matrix Rounding With Respect to Small Submatrices
    Random Structures & Algorithms 28 (1): 107-112, 2006

  117. Benjamin Doerr
    Non-independent randomized rounding and coloring
    Discrete Applied Mathematics 154 (4): 650-659, 2006

  118. Benjamin Doerr
    Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
    Eurocomb '03 3: 95-99, 2006
  119. Benjamin Doerr and Tobias Friedrich
    Quasirandomness in Graphs
    Electronic Notes in Discrete Mathematics 25: 61-64, 2006

  120. Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann
    Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
    In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, Reykjavik, Iceland, 2006, 978-987

  121. Benjamin Doerr, Johannes Lengler, and Daniel Steurer
    The Interval Liar Game
    In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, 2006, 318-327

  122. Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
    Unbiased Matrix Rounding
    In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, 2006, 102-112
    [PDF: Download: 2006SWATofficial_rounding.pdf]
  123. Benjamin Doerr and Christian Klein
    Unbiased Rounding of Rational Matrices
    In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, Kolkata, India, 2006, 200-211

  124. Benjamin Doerr, Michael Gnewuch, and Anand Srivastav
    Bounds and Constructions for the Star-Discrepancy via Delta-Covers
    Journal of Complexity 21 (5): 691-709, 2005
  125. Joshua Cooper, Benjamin Doerr, Joel Spencer, and Gabor Tardos
    Deterministic Random Walks on the Integers
    In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Berlin, Germany, 2005, 73-76
  126. Benjamin Doerr and Nils Hebbinghaus
    Discrepancy of Products of Hypergraphs
    In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Berlin, Germany, 2005, 323-328
  127. Benjamin Doerr
    Integral Approximation
    Habilitation thesis, Christian-Albrechts-Universität zu Kiel, 2005
  128. Benjamin Doerr
    Matrix Rounding with Low Error in Small Submatrices
    In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, 2005, 1067-1068
  129. Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Privetivy, and Anand Srivastav
    On the Minimum Load Coloring Problem
    In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), Palma de Mallorca, Spain, 2005, 15-26
    [PDF: Download: mlcp_waoa05.pdf]
  130. Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
    Rounding of Sequences and Matrices, with Applications
    In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), Palma de Mallorca, Spain, 2005, 96-109
    [PDF: Download: public.pdf] [PDF: Download: final.pdf]
  131. Benjamin Doerr
    Roundings Respecting Hard Constraints
    In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), Stuttgart, Germany, 2005, 617-628
  132. Nitin Ahuja, Andreas Baltz, Benjamin Doerr, and Anand Srivastav
    Coloring Graphs with Minimal Load
    Electronic Notes in Discrete Mathematics 17: 129-133, 2004
  133. Benjamin Doerr
    Multi-color discrepancies
    Oberwolfach Reports 1: 683-685, 2004
  134. Benjamin Doerr and Anand Srivastav
    Multi-Color Discrepancies
    Electronic Notes in Discrete Mathematics 7, 2001
  135. Benjamin Doerr and Anand Srivastav
    Multi-Color Discrepancy of Arithmetic Progressions
    Electronic Notes in Discrete Mathematics 8: 27-30, 2001
  136. Benjamin Doerr
    Vector Balancing Games with Aging
    Electronic Notes in Discrete Mathematics 10, 2001