Your search returned the following 27 documents:

27. Ranking-Based Black-Box Complexity
    Benjamin Doerr and Carola Winzen
    Algorithmica , 2014. Note: To appear.
    
26. Black-Box Complexities of Combinatorial Problems
    Benjamin Doerr, Timo Kötzing, Johannes Lengler, and Carola Winzen
    Theoretical Computer Science 471: 84-106, 2013
    
25. Direction-Reversing Quasi-Random Rumor Spreading with Restarts
    Carola Winzen
    Information Processing Letters 113: 921-926, 2013
    
24. 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
    
23. 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
    
22. A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
    Michael Gnewuch, Magnus Wahlström, and Carola Winzen
    SIAM Journal on Numerical Analysis 50 (2): 781-807, 2012. Note: Also available from arxiv.
    
21. 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
    
20. Memory-restricted black-box complexity of OneMax
    Benjamin Doerr and Carola Winzen
    Information Processing Letters 112: 32-34, 2012
    
19. Multiplicative Drift Analysis
    Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    Algorithmica 64 (4): 673-697, 2012
    
18. Non-existence of linear universal drift functions
    Benjamin Doerr, Daniel Johannsen, and Carola Winzen
    Theoretical Computer Science 436: 71-86, 2012
    
17. 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
    
16. 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
    
15. Playing Mastermind with Constant-Size Memory
    Benjamin Doerr and Carola Winzen
    Theory of Computing Systems Online First: 1-27, 2012. Note: to appear
    
14. 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
    
13. Simple and Optimal Fault-Tolerant Rumor Spreading
    Benjamin Doerr, Shay Moran, Shlomo Moran, and Carola Winzen
    arXiv abs/1209.6158: 1-18, 2012
    
12. 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
    
    
11. 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
    
10. 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
    
9. Direction-Reversing Quasi-Random Rumor Spreading with Restarts
   Carola Winzen
   
   
8. 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
   
7. Memory-Restricted Black-Box Complexity
   Benjamin Doerr and Carola Winzen
   Electronic Colloquium on Computational Complexity 18: 7 p., 2011
   
6. 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
   
5. Toward a complexity theory for randomized search heuristics : black box models
   Carola Winzen
   Doctoral dissertation, Universität des Saarlandes, 2011
   
4. 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
   
3. 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
   
2. 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
   
1. 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