| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Benjamin Doerr, Carola Winzen |
Memory-restricted black-box complexity of OneMax.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Edda Happ, Christian Klein |
Crossover can provably be useful in evolutionary computation. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Reducing the Arity in Unbiased Black-Box Complexity |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Playing Mastermind With Constant-Size Memory. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz |
Asymptotically Optimal Randomized Rumor Spreading. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich |
Social Networks Spread Rumors in Sublogarithmic Time. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz |
Quasi-random rumor spreading: Reducing randomness can be costly. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Memory-Restricted Black-Box Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt |
Runtime analysis of the 1-ANT ant colony optimizer. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen |
Evolutionary algorithms and dynamic programming. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Thomas Jansen |
Theory of Evolutionary Computation. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Edda Happ, Christian Klein |
Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem. |
Evolutionary Computation |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
Multiplicative Drift Analysis |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen |
Black-Box Complexities of Combinatorial Problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Playing Mastermind With Constant-Size Memory |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg |
Adaptive Drift Analysis |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald |
Quasirandom rumor spreading: An experimental analysis. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen |
Black-box complexities of combinatorial problems. |
GECCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr |
Drift analysis. |
GECCO (Companion) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz, Carsten Witt |
Sharp bounds by probability-generating functions and variable drift. |
GECCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Timo Kötzing, Carola Winzen |
Too fast unbiased black-box algorithms. |
GECCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz |
Asymptotically Optimal Randomized Rumor Spreading. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Marvin Künnemann, Magnus Wahlström |
Dependent Randomized Rounding: The Bipartite Case. |
ALENEX |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tetsuo Asano, Benjamin Doerr |
Memory-Constrained Algorithms for Shortest Path Problem. |
CCCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, Benjamin Doerr |
Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. |
SSVM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler |
Stabilizing consensus with the power of two choices. |
SPAA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen |
Faster black-box algorithms through higher arity operators. |
FOGA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Martin Schmidt |
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. |
FOGA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich |
Social networks spread rumors in sublogarithmic time. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Michael Gnewuch, Magnus Wahlström |
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. |
J. Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Frank Neumann, Ingo Wegener |
Editorial. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Frank Neumann |
In Memoriam: Ingo Wegener. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer |
Deterministic random walks on regular trees. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz |
Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
Non-Existence of Linear Universal Drift Functions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges |
Optimizing Monotone Functions Can Be Difficult |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz |
Asymptotically Optimal Randomized Rumor Spreading |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Anna Huber, Ariel Levavi |
Strong Robustness of Randomized Rumor Spreading Protocols |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Marvin Künnemann, Magnus Wahlström |
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald |
Quasirandom Rumor Spreading: An Experimental Analysis |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer |
Deterministic Random Walks on Regular Trees |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald |
Quasirandom Rumor Spreading |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen |
Faster Black-Box Algorithms Through Higher Arity Operators |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz |
Hereditary Discrepancies in Different Numbers of Colors II. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg |
Adaptive Drift Analysis. |
PPSN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges |
Optimizing Monotone Functions Can Be Difficult. |
PPSN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Süntje Böttcher, Benjamin Doerr, Frank Neumann |
Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. |
PPSN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg |
Drift Analysis with Tail Bounds. |
PPSN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile |
More Effective Crossover Operators for the All-Pairs Shortest Path Problem. |
PPSN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen |
Edge-based representation beats vertex-based representation in shortest path problems. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
evolutionary algorithm, shortest path, runtime analysis |
| 1 | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
Multiplicative drift analysis. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
theory, running time analysis |
| 1 | Benjamin Doerr, Mahmoud Fouz, Carsten Witt |
Quasirandom evolutionary algorithms. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
quasirandomness, evolutionary algorithms |
| 1 | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
Drift analysis and linear functions revisited. |
IEEE Congress on Evolutionary Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Marvin Künnemann, Magnus Wahlström |
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. |
SEA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler |
Brief Announcement: Stabilizing Consensus with the Power of Two Choices. |
DISC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Mahmoud Fouz |
A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald |
Quasirandom Rumor Spreading on Expanders. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Spyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou |
Tight Bounds for Quasirandom Rumor Spreading. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Tobias Friedrich |
Deterministic Random Walks on the Two-Dimensional Grid. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile |
Evolutionary algorithms and dynamic programming. |
GECCO |
2009 |
DBLP DOI BibTeX RDF |
evolutionary algorithms, dynamic programming, combinatorial optimization |
| 1 | Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, Magnus Wahlström |
BBOB: Nelder-Mead with resize and halfruns. |
GECCO (Companion) |
2009 |
DBLP DOI BibTeX RDF |
evolutionary computation, benchmarking, black-box optimization |
| 1 | Benjamin Doerr, Madeleine Theile |
Improved analysis methods for crossover-based algorithms. |
GECCO |
2009 |
DBLP DOI BibTeX RDF |
evolutionary algorithm, combinatorial optimization, crossover |
| 1 | Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald |
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald |
Quasirandom Rumor Spreading: An Experimental Analysis. |
ALENEX |
2009 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Magnus Wahlström |
Randomized Rounding in the Presence of a Cardinality Constraint. |
ALENEX |
2009 |
DBLP BibTeX RDF |
|
| 1 | Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann |
Computing single source shortest paths using single-objective fitness. |
FOGA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr |
Introducing Quasirandomness to Computer Science. |
Efficient Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Anna Huber, Ariel Levavi |
Strong Robustness of Randomized Rumor Spreading Protocols. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Ching Hoo Tang |
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions. |
PPSN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Thomas Jansen, Christian Klein |
Comparing global and local mutations on bit strings. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
randomized local search, evolutionary computation, analysis, mutation |
| 1 | Benjamin Doerr, Edda Happ, Christian Klein |
Crossover can provably be useful in evolutionary computation. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
evolutionary computation, combinatorial optimization, analysis, crossover |
| 1 | Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer |
Deterministic random walks on regular trees. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald |
Quasirandom rumor spreading. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Edda Happ |
Directed trees: A powerful representation for sorting and ordering problems. |
IEEE Congress on Evolutionary Computation |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer |
Deterministic Random Walks on Regular Trees. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Johannes Lengler, David Steurer |
The Interval Liar Game. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr |
Partial Colorings of Unimodular Hypergraphs. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich, Benjamin Doerr, Christian Klein, Ralf Osbild |
Unbiased Matrix Rounding. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr |
Matrix approximation and Tusnády's problem. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer, Gábor Tardos |
Deterministic random walks on the integers. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Nils Hebbinghaus, Frank Neumann |
Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. |
Evolutionary Computation |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr |
Roundings Respecting Hard Constraints. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav |
On the minimum load coloring problem. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Christian Klein, Tobias Storch |
Faster Evolutionary Algorithms by Superior Graph Representation. |
FOCI |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen |
Adjacency list matchings: an ideal genotype for cycle covers. |
GECCO |
2007 |
DBLP DOI BibTeX RDF |
randomized local, evolutionary algorithm, search, runtime analysis, cycle cover, Euler tour |
| 1 | Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt |
On the runtime analysis of the 1-ANT ACO algorithm. |
GECCO |
2007 |
DBLP DOI BibTeX RDF |
ant colony optimization, runtime analysis |
| 1 | Benjamin Doerr |
Randomly Rounding Rationals with Cardinality Constraints and Derandomizations. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen |
Refined runtime analysis of a basic ant colony optimization algorithm. |
IEEE Congress on Evolutionary Computation |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann |
A rigorous view on neutrality. |
IEEE Congress on Evolutionary Computation |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Edda Happ, Christian Klein |
A tight analysis of the (1 + 1)-EA for the single source shortest path problem. |
IEEE Congress on Evolutionary Computation |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Tobias Friedrich |
Quasirandomness in Graphs. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Christian Klein |
Controlled Randomized Rounding. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nils Hebbinghaus, Benjamin Doerr, Frank Neumann |
Speeding up Evolutionary Algorithms by Restricted Mutation Operators. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Nils Hebbinghaus, Sören Werth |
Improved bounds and schemes for the declustering problem. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr |
Inserting Points Uniformly at Every Instance. |
IEICE Transactions |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus |
Discrepancy of Symmetric Products of Hypergraphs. |
Electr. J. Comb. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr |
Matrix rounding with respect to small submatrices. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild |
Unbiased Matrix Rounding |
CoRR |
2006 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")