Your search returned the following 144 documents:

144. Ranking-Based Black-Box Complexity
     Benjamin Doerr and Carola Winzen
     Algorithmica , 2014. Note: To appear.
     
143. Adaptive Drift Analysis
     Benjamin Doerr and Leslie Ann Goldberg
     Algorithmica 65: 224-250, 2013
     
142. Black-Box Complexities of Combinatorial Problems
     Benjamin Doerr, Timo Kötzing, Johannes Lengler, and Carola Winzen
     Theoretical Computer Science 471: 84-106, 2013
     
141. How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
     Benjamin Doerr and Marvin Künnemann
     In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), Amsterdam, The Netherlands, 2013, 1589-1596
     
140. Improved approximation algorithms for the Min-Max Selecting Items problem
     Benjamin Doerr
     Information Processing Letters 113: 747-749, 2013
     
139. Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
     Benjamin Doerr, Carola Doerr, and Franziska Ebel
     In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), Amsterdam, Netherlands, 2013, 781-788
     
138. Lower bounds for the runtime of a global multi-objective evolutionary algorithm
     Benjamin Doerr, Bojana Kodric, and Marco Voigt
     In: IEEE Congress on Evolutionary Computation, Cancun, Mexico, 2013, 432-439
     
137. More effective crossover operators for the all-pairs shortest path problem
     Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, and Madeleine Theile
     Theoretical Computer Science 471: 12-26, 2013
     
136. Mutation rate matters even when optimizing monotonic functions
     Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, and Christine Zarges
     Evolutionary Computation 21 (1): 1-27, 2013
     
135. Online Checkpointing with Improved Worst-Case Guarantees
     Karl Bringmann, Benjamin Doerr, Adrian Neumann, and Jakub Sliacan
     In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), Riga, Latvia, 2013, 255-266
     
134. Playing Mastermind with many colors
     Benjamin Doerr, Reto Spöhel, Henning Thomas, and Carola Winzen
     In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, USA, 2013, 695-704
     
133. Playing Mastermind with Many Colors
     Benjamin Doerr, Carola Doerr, Reto Spöhel, and Henning Thomas
     arXiv abs/1207.0773: 1-22, 2013
     
132. Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations
     Benjamin Doerr and Marvin Künnemann
     In: 2013 IEEE Congress on Evolutionary Computation (CEC 2013), Cancun, Mexico, 2013, 424-431
     
131. Strong robustness of randomized rumor spreading protocols
     Benjamin Doerr, Anna Huber, and Ariel Levavi
     Discrete Applied Mathematics 161 (6): 778-793, 2013
     
130. The Query Complexity of Finding a Hidden Permutation
     Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, and Kurt Mehlhorn
     In: Space-Efficient Data Structures, Streams, and Algorithms, 2013, 1-11
     
129. When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
     Benjamin Doerr, Dirk Sudholt, and Carsten Witt
     In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), Adelaide, Australia, 2013, 51-63
     
128. Ants easily solve stochastic shortest path problems
     Benjamin Doerr, Ashish Hota, and Timo Kötzing
     In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012, 17-24
     
127. Asynchronous rumor spreading in preferential attachment graphs
     Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
     In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, 2012, 307-315
     
126. Black-box complexity: from complexity theory to playing mastermind
     Benjamin Doerr
     In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012, 1079-1092
     
125. Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
     Benjamin Doerr and Carola Winzen
     In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, Angers, France, 2012, 205-216
     
124. Crossover can provably be useful in evolutionary computation
     Benjamin Doerr, Edda Happ, and Christian Klein
     Theoretical Computer Science 425: 17-33, 2012
     
123. Experimental analysis of rumor spreading in social networks
     Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
     In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, Ein Gedi, Israel, 2012, 159-173. Note: To appear
     
122. Memory-restricted black-box complexity of OneMax
     Benjamin Doerr and Carola Winzen
     Information Processing Letters 112: 32-34, 2012
     
121. Multiplicative Drift Analysis
     Benjamin Doerr, Daniel Johannsen, and Carola Winzen
     Algorithmica 64 (4): 673-697, 2012
     
120. Non-existence of linear universal drift functions
     Benjamin Doerr, Daniel Johannsen, and Carola Winzen
     Theoretical Computer Science 436: 71-86, 2012
     
119. Playing Mastermind with Many Colors
     Benjamin Doerr, Reto Spöhel, Henning Thomas, and Carola Winzen
     In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), Munich. Germany, 2012
     
118. Playing Mastermind with Constant-Size Memory
     Benjamin Doerr and Carola Winzen
     Theory of Computing Systems Online First: 1-27, 2012. Note: to appear
     
117. Playing Mastermind with Constant-Size Memory
     Benjamin Doerr and Carola Winzen
     In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, Paris, France, 2012, 441-452
     
116. Reducing the arity in unbiased black-box complexity
     Benjamin Doerr and Carola Winzen
     In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012, 1309-1316
     
115. Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
     Benjamin Doerr and Sebastian Pohl
     In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, PA, 2012, 1317-1324
     
114. Simple and Optimal Fault-Tolerant Rumor Spreading
     Benjamin Doerr, Shay Moran, Shlomo Moran, and Carola Winzen
     arXiv abs/1209.6158: 1-18, 2012
     
113. The Price of Anarchy for Selfish Ring Routing is Two
     Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, and Carola Winzen
     In: Internet and Network Economics : 8th International Workshop, WINE 2012, Liverpool, UK, 2012, 420-433
     
     
112. The Query Complexity of Finding a Hidden Permutation
     Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Kasper Green Larsen, Kurt Mehlhorn, and Carola Winzen
     Electronic Colloquium on Computational Complexity (ECCC): Report Series 87 (Revision 1): 1-36, 2012
     
111. Why Rumors Spread Fast in Social Networks
     Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
     Communications of the ACM 55: 70-75, 2012
     
110. Asymptotically optimal randomized rumor spreading
     Benjamin Doerr and Mahmoud Fouz
     Electronic Notes in Discrete Mathematics 38: 297-302, 2011
     
109. Asymptotically Optimal Randomized Rumor Spreading
     Benjamin Doerr and Mahmoud Fouz
     In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zürich, Switzerland, 2011, 502-513
     
108. Black-box complexities of combinatorial problems
     Benjamin Doerr, Johannes Lengler, Timo Kötzing, and Carola Winzen
     In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 981-988
     
107. Dependent Randomized Rounding: The Bipartite Case
     Benjamin Doerr, Marvin Künnemann, and Magnus Wahlström
     In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), San Francisco, California, USA, 2011, 96-106
     
106. Drift analysis
     Benjamin Doerr
     In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 1311-1320
     
105. Evolutionary algorithms and dynamic programming
     Benjamin Doerr, Anton Eremeev, Frank Neumann, Madeleine Theile, and Christian Thyssen
     Theoretical Computer Science 412: 6020-6035, 2011
     
104. Faster black-box algorithms through higher arity operators
     Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Christian Lehre, Markus Wagner, and Carola Winzen
     In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), Schwarzenberg, Austria, 2011, 163-172
     
103. Memory-constrained algorithms for shortest path problem
     Tetsuo Asano and Benjamin Doerr
     In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Canada, 2011, 315-319
     
102. Memory-Restricted Black-Box Complexity
     Benjamin Doerr and Carola Winzen
     Electronic Colloquium on Computational Complexity 18: 7 p., 2011
     
101. Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
     Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, and Benjamin Doerr
     In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, Ein-Gedi, Israel, 2011, 26-37
     
100. Quasi-random rumor spreading: Reducing randomness can be costly
     Benjamin Doerr and Mahmoud Fouz
     Information Processing Letters 111 (5): 227-230, 2011
     
99. Quasirandom Rumor Spreading: An Experimental Analysis
    Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, and Thomas Sauerwald
    ACM Journal of Experimental Algorithmics 16: Article No. 3.3 p., 2011
    
98. Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
    Benjamin Doerr, Daniel Johannsen, and Martin Schmidt
    In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 119-126
    [PDF: Download: DoerrJohannsenSchmidt11.pdf]
    
97. Runtime analysis of the 1-ANT ant colony optimizer
    Benjamin Doerr, Frank Neumann, Dirk Sudholt, and Carsten Witt
    Theoretical Computer Science 412 (17): 1629-1644, 2011
    
96. Sharp bounds by probability-generating functions and variable drift
    Benjamin Doerr, Mahmoud Fouz, and Carsten Witt
    In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 2083-2090
    
95. Social Networks Spread Rumors in Sublogarithmic Time
    Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, Budapaest, 2011, 303-308
    
94. Social Networks Spread Rumors in Sublogarithmic Time
    Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich
    In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, San Jose, CA, 2011, 21-30
    
93. Stabilizing consensus with the power of two choices
    Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler
    In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), San Jose, USA, 2011, 149-158
    
92. Theory of Evolutionary Computation
    Benjamin Doerr and Thomas Jansen
    Algorithmica 59 (3): 299-300, 2011
    
91. Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
    Benjamin Doerr, Edda Happ, and Christian Klein
    Evolutionary Computation 19 (4): 673-691, 2011
    
90. Too fast unbiased black-box algorithms
    Benjamin Doerr, Timo Kötzing, and Carola Winzen
    In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 2043-2050
    
89. Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
    Benjamin Doerr and Carola Winzen
    In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), St. Petersburg, Russia, 2011, 15-28
    
88. Adaptive Drift Analysis
    Benjamin Doerr and Leslie Ann Goldberg
    In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, Krakow, Poland, 2010, 32-41
    
87. Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
    Benjamin Doerr, Michael Gnewuch, and Magnus Wahlström
    Journal of Complexity 26 (5): 490-507, 2010
    
86. Brief Announcement: Stabilizing Consensus with the Power of Two Choices
    Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler
    In: Distributed Computing : 24th International Symposium, DISC 2010, Cambridge, MA USA, 2010, 528-530
    
85. Deterministic Random Walks on Regular Trees
    Joshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer
    Random Structures and Algorithms 37 (3): 353-366, 2010
    
84. Drift Analysis and Linear Functions Revisited
    Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, Barcelona, Spain, 2010, 1967-1974
    
83. Drift Analysis with Tail Bounds
    Benjamin Doerr and Leslie Ann Goldberg
    In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, Krakow, Poland, 2010, 174-183
    
82. Edge-based representation beats vertex-based representation in shortest path problems
    Benjamin Doerr and Daniel Johannsen
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 759-766
    [PDF: Download: DoerrJohannsen10.pdf]
    
81. Editorial
    Benjamin Doerr, Frank Neumann, and Ingo Wegener
    Algorithmica 57 (1): 119-120, 2010
    
80. Hereditary Discrepancies in Different Numbers of Colors II
    Benjamin Doerr and Mahmoud Fouz
    SIAM Journal on Discrete Mathematics 24 (3): 1205-1213, 2010
    
79. In Memoriam: Ingo Wegener
    Benjamin Doerr and Frank Neumann
    Algorithmica 58 (3): 541-542, 2010
    
78. More Effective Crossover Operators for the All-Pairs Shortest Path Problem
    Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, and Madeleine Theile
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 184-193
    
77. Multiplicative Drift Analysis
    Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 1449-1456. Note: Best Paper Award
    
76. Optimal fixed and adaptive mutation rates for the LeadingOnes problem
    Süntje Böttcher, Benjamin Doerr, and Frank Neumann
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 1-10
    
75. Optimizing Monotone Functions Can Be Difficult
    Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, and Christine Zarges
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 42-51
    
74. Quasirandom Evolutionary Algorithms
    Benjamin Doerr, Mahmoud Fouz, and Carsten Witt
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 1457-1464
    
73. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
    Benjamin Doerr, Marvin Künnemann, and Magnus Wahlström
    In: Experimental Algorithms : 9th International Symposium, SEA 2010, Naples, Italy, 2010, 190-201
    
72. A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
    Benjamin Doerr and Mahmoud Fouz
    Electronic Notes in Discrete Mathematics 34: 335 - 339, 2009
    
71. Computing Single Source Shortest Paths using Single-Objective Fitness Functions
    Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, and Frank Neumann
    In: FOGA'09 : revised selected papers from ACM SIGEVO Foundations of Genetic Algorithms X, Orlando, USA, 2009, 59-66
    
70. Deterministic Random Walks on the Two-Dimensional Grid
    Benjamin Doerr and Tobias Friedrich
    Combinatorics, Probability and Computing 18 (1-2): 123-144, 2009
    
69. Evolutionary Algorithms and Dynamic Programming
    Benjamin Doerr, Anton Eremeev, Christian Horoba, Frank Neumann, and Madeleine Theile
    In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009, 771-777
    
68. Implementation of a component-by-component algorithm to generate small low-discrepancy samples
    Benjamin Doerr, Michael Gnewuch, and Magnus Wahlström
    In: Monte Carlo and Quasi-Monte Carlo Methods 2008, Montreal, Canada, 2009, 323-338
    
67. Improved Analysis Methods for Crossover-Based Algorithms
    Benjamin Doerr and Madeleine Theile
    In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009, 247-254
    
66. Introducing Quasirandomness to Computer Science
    Benjamin Doerr
    In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 2009, 99-111
    
65. Quasirandom Rumor Spreading on Expanders
    Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
    Electronic Notes in Discrete Mathematics 34: 243 - 247, 2009
    
64. Quasirandom Rumor Spreading: An Experimental Analysis
    Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, and Thomas Sauerwald
    In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), New York, USA, 2009, 145-153
    
63. Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
    Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
    In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, 2009, 366-377
    
62. Randomized Rounding in the Presence of a Cardinality Constraint
    Benjamin Doerr and Magnus Wahlström
    In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), New York, USA, 2009, 162-174
    
61. Strong robustness of randomized rumor spreading protocols
    Benjamin Doerr, Anna Huber, and Ariel Levavi
    In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, Hawaii, USA, 2009, 812-821. Note: Full version available from arXiv:1001.3056
    
60. Tight bounds for quasirandom rumor spreading
    Spyros Angelopoulos, Benjamin Doerr, Anna Huber, and Konstantinos Panagiotou
    The Electronic Journal of Combinatorics 16 (1): R102,1-R102,19, 2009
    
59. BBOB: Nelder-Mead with resize and halfruns
    Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, and Magnus Wahlström
    In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), Montreal, Québec, Canada, 2009, 2239-2246
    
58. Component-by-component construction of low-discrepancy point sets of small size
    Benjamin Doerr, Michael Gnewuch, Peter Kritzer, and Peter Pillichshammer
    Monte Carlo Methods Applications 14 (2): 129-150, 2008
    
57. Comparing local and global mutations on bit-strings.
    Benjamin Doerr, Thomas Jansen, and Christian Klein
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 929-936
    
56. Component-by-component construction of low-discrepancy point sets of small size
    Benjamin Doerr, Michael Gnewuch, Peter Kritzer, and Friedrich Pillichshammer
    Monte Carlo Methods and Applications 14: 129-149, 2008
    
55. Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
    Benjamin Doerr and Michael Gnewuch
    In: Monte Carlo and Quasi-Monte Carlo Methods 2006, Ulm, Germany, 2008, 299-312
    
54. Crossover Can Provably be Useful in Evolutionary Computation
    Benjamin Doerr, Edda Happ, and Christian Klein
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 539-546. Note: Best paper award
    
53. Deterministic Random Walks on Regular Trees
    Joshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer
    In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, USA, 2008, 766-772
    
52. Directed trees: A Powerful Representation for Sorting and Ordering Problems
    Benjamin Doerr and Edda Happ
    In: Proceedings of CEC 2008, Hong Kong, 2008, 3606-3613
    
51. How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
    Benjamin Doerr, Daniel Johannsen, and Ching Hoo Tang
    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]
    
50. Quasirandom Rumor Spreading
    Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald
    In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, USA, 2008, 773-781
    
49. A Rigorous View On Neutrality
    Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, and Frank Neumann
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, 2007, 2591-2597
    
48. A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
    Benjamin Doerr, Edda Happ, and Christian Klein
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, 2007, 1890-1895
    
47. Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
    Benjamin Doerr and Daniel Johannsen
    In: Genetic and Evolutionary Computation Conference (GECCO-2007), London, UK, 2007, 1203-1210
    [PDF: Download: DoerrJohannsen_2007_AdjacencyListMatchings-AnIdealGenotypeForCycleCovers.pdf]
    
46. Deterministic random walks on the integers
    Joshua Cooper, Benjamin Doerr, Joel Spencer, and Gábor Tardos
    European Journal of Combinatorics 28 (8): 2072-2090, 2007
    
45. Deterministic Random Walks on Regular Trees
    Joshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer
    Electronic Notes in Discrete Mathematics 29: 509-513, 2007
    
44. Faster Evolutionary Algorithms by Superior Graph Representation
    Benjamin Doerr, Christian Klein, and Tobias Storch
    In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), Honolulu, USA, 2007, 245-250
    [PDF: Download: foci2007.pdf]
    
43. Lp Linear discrepancy of totally unimodular matrices
    Benjamin Doerr
    Linear Algebra and Its Applications 420 (2/3): 663-666, 2007
    
    
42. Matrix approximation and Tusnády's problem
    Benjamin Doerr
    European Journal of Combinatorics 28 (3): 990-995, 2007
    
    
41. On the Minimum Load Coloring Problem
    Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Privetivy, and Anand Srivastav
    Journal of Discrete Algorithms 5: 533-545, 2007
    
40. On the Runtime Analysis of the 1-ANT ACO algorithm
    Benjamin Doerr, Frank Neumann, Dirk Sudholt, and Carsten Witt
    In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 33-40. Note: Best paper award
    
39. Partial Colorings of Unimodular Hypergraphs
    Benjamin Doerr
    Electronic Notes in Discrete Mathematics 29: 359-363, 2007
    
38. Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
    Benjamin Doerr
    In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, 2007, 441-452
    
    
37. Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
    Benjamin Doerr and Daniel Johannsen
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, 2007, 501-507
    [PDF: Download: DoerrJohannsen_2007_RefinedRuntimeAnalysisOfABasicAntColonyOptimizationAlgorithm.pdf]
    
36. Roundings respecting hard constraints
    Benjamin Doerr
    Theory of Computing Systems 40 (4): 467-483, 2007
    
35. Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
    Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann
    Evolutionary Computation 15 (4): 401-410, 2007
    
34. Unbiased Matrix Rounding
    Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
    Electronic Notes in Discrete Mathematics 28: 41-46, 2007
    
33. Balanced partitions of vector sequences
    Imre Bárány and Benjamin Doerr
    Linear Algebra and Its Applications 414 (2-3): 464-469, 2006
    
    
32. Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding
    Benjamin Doerr and Michael Gnewuch
    University Kiel, Kiel, 06-14, Research Report
    
31. Controlled Randomized Rounding
    Benjamin Doerr and Christian Klein
    Electronic Notes in Discrete Mathematics 25: 39-40, 2006
    
30. Deterministic Random Walks
    Joshua Cooper, Benjamin Doerr, Joel Spencer, and Gábor Tardos
    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
    
29. Deterministic Random Walks on the Integers
    Joshua Cooper, Benjamin Doerr, Joel Spencer, and Gabor Tardos
    Internet
    
28. Deterministic Random Walks on the Two-Dimensional Grid
    Benjamin Doerr and Tobias Friedrich
    In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, 2006, 474-483
    [PDF: Download: 2006ISAAC.pdf]
    
27. Discrepancy of Symmetric Products of Hypergraphs
    Benjamin Doerr, Michael Gnewuch, and Nils Hebbinghaus
    The Electronic Journal of Combinatorics 13: 1-12, 2006
    [PDF: Download: v13i1r40.pdf]
    
26. Error Propagation in Game Trees
    Benjamin Doerr and Ulf Lorenz
    Mathematical Methods of Operations Research 64 (1): 79-93, 2006
    
    
25. Generating Randomized Roundings with Cardinality Constraints and Derandomizations
    Benjamin Doerr
    In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, 2006, 571-583
    
    
24. Hereditary Discrepancies in Different Numbers of Colors II
    Benjamin Doerr and Mahmoud Fouz
    Internet
    
23. Improved Bounds and Schemes for the Declustering Problem
    Benjamin Doerr, Nils Hebbinghaus, and Sören Werth
    Theoretical Computer Science 359 (1-3): 123-132, 2006
    
    
22. Inserting Points Uniformly at Every Instance
    Sachio Teramoto, Tetsuo Asano, Naoki Katoh, and Benjamin Doerr
    IEICE - Transactions on Information and Systems E89-D (8): 2348-2356, 2006
    
21. Matrix Rounding With Respect to Small Submatrices
    Benjamin Doerr
    Random Structures & Algorithms 28 (1): 107-112, 2006
    
    
20. Non-independent randomized rounding and coloring
    Benjamin Doerr
    Discrete Applied Mathematics 154 (4): 650-659, 2006
    
    
19. Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
    Benjamin Doerr
    Eurocomb '03 3: 95-99, 2006
    
18. Quasirandomness in Graphs
    Benjamin Doerr and Tobias Friedrich
    Electronic Notes in Discrete Mathematics 25: 61-64, 2006
    
    
17. Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
    Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann
    In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, Reykjavik, Iceland, 2006, 978-987
    
    
16. The Interval Liar Game
    Benjamin Doerr, Johannes Lengler, and Daniel Steurer
    In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, 2006, 318-327
    
    
15. Unbiased Matrix Rounding
    Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
    In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, 2006, 102-112
    [PDF: Download: 2006SWATofficial_rounding.pdf]
    
14. Unbiased Rounding of Rational Matrices
    Benjamin Doerr and Christian Klein
    In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, Kolkata, India, 2006, 200-211
    
    
13. Bounds and Constructions for the Star-Discrepancy via Delta-Covers
    Benjamin Doerr, Michael Gnewuch, and Anand Srivastav
    Journal of Complexity 21 (5): 691-709, 2005
    
12. Deterministic Random Walks on the Integers
    Joshua Cooper, Benjamin Doerr, Joel Spencer, and Gabor Tardos
    In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Berlin, Germany, 2005, 73-76
    
11. Discrepancy of Products of Hypergraphs
    Benjamin Doerr and Nils Hebbinghaus
    In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Berlin, Germany, 2005, 323-328
    
10. Integral Approximation
    Benjamin Doerr
    Habilitation thesis, Christian-Albrechts-Universität zu Kiel, 2005
    
9. Matrix Rounding with Low Error in Small Submatrices
   Benjamin Doerr
   In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, 2005, 1067-1068
   
8. On the Minimum Load Coloring Problem
   Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Privetivy, and Anand Srivastav
   In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), Palma de Mallorca, Spain, 2005, 15-26
   [PDF: Download: mlcp_waoa05.pdf]
   
7. Rounding of Sequences and Matrices, with Applications
   Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
   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]
   
6. Roundings Respecting Hard Constraints
   Benjamin Doerr
   In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), Stuttgart, Germany, 2005, 617-628
   
5. Coloring Graphs with Minimal Load
   Nitin Ahuja, Andreas Baltz, Benjamin Doerr, and Anand Srivastav
   Electronic Notes in Discrete Mathematics 17: 129-133, 2004
   
4. Multi-color discrepancies
   Benjamin Doerr
   Oberwolfach Reports 1: 683-685, 2004
   
3. Multi-Color Discrepancies
   Benjamin Doerr and Anand Srivastav
   Electronic Notes in Discrete Mathematics 7, 2001
   
2. Multi-Color Discrepancy of Arithmetic Progressions
   Benjamin Doerr and Anand Srivastav
   Electronic Notes in Discrete Mathematics 8: 27-30, 2001
   
1. Vector Balancing Games with Aging
   Benjamin Doerr
   Electronic Notes in Discrete Mathematics 10, 2001