Carola Winzen

ORCID

Publication Activity (10 Years)

Years Active: 2009-2014
Publications (10 Years): 0

Top Venues

Universität Saarbrücken (PHD)

Education History

Universität Saarbrücken

PHD

Publications

Benjamin Doerr, Carola Winzen
Ranking-Based Black-Box Complexity. Algorithmica 68 (3) (2014)
Benjamin Doerr, Carola Winzen
Playing Mastermind with Constant-Size Memory. Theory Comput. Syst. 55 (4) (2014)
Benjamin Doerr, Carola Winzen
Reducing the arity in unbiased black-box complexity. Theor. Comput. Sci. 545 (2014)
Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
Mutation Rate Matters Even When Optimizing Monotonic Functions. Evol. Comput. 21 (1) (2013)
Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen
Playing Mastermind with Many Colors. SODA (2013)
Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen
Black-box complexities of combinatorial problems. Theor. Comput. Sci. 471 (2013)
Carola Winzen
Direction-reversing quasi-random rumor spreading with restarts. Inf. Process. Lett. 113 (22-24) (2013)
Benjamin Doerr, Shay Moran, Shlomo Moran, Carola Winzen
Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity CoRR (2012)
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn
The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electron. Colloquium Comput. Complex. 19 (2012)
Benjamin Doerr, Carola Winzen
Reducing the Arity in Unbiased Black-Box Complexity CoRR (2012)
Benjamin Doerr, Carola Winzen
Memory-restricted black-box complexity of OneMax. Inf. Process. Lett. 112 (1-2) (2012)
Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen
The Price of Anarchy for Selfish Ring Routing is Two CoRR (2012)
Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, Carola Winzen
The Price of Anarchy for Selfish Ring Routing Is Two. WINE (2012)
Benjamin Doerr, Carola Winzen
Reducing the arity in unbiased black-box complexity. GECCO (2012)
Michael Gnewuch, Magnus Wahlström, Carola Winzen
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting. SIAM J. Numer. Anal. 50 (2) (2012)
Benjamin Doerr, Carola Winzen
Playing Mastermind With Constant-Size Memory. STACS (2012)
Benjamin Doerr, Carola Winzen
Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes CoRR (2012)
Benjamin Doerr, Daniel Johannsen, Carola Winzen
Non-existence of linear universal drift functions. Theor. Comput. Sci. 436 (2012)
Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen
Playing Mastermind with Many Colors CoRR (2012)
Benjamin Doerr, Daniel Johannsen, Carola Winzen
Multiplicative Drift Analysis. Algorithmica 64 (4) (2012)
Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen
Playing Mastermind with Many Colors. CTW (2012)
Benjamin Doerr, Carola Winzen
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity CoRR (2011)
Carola Winzen
Direction-Reversing Quasi-Random Rumor Spreading with Restarts CoRR (2011)
Michael Gnewuch, Magnus Wahlström, Carola Winzen
A Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy CoRR (2011)
Benjamin Doerr, Carola Winzen
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. CSR (2011)
Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen
Faster black-box algorithms through higher arity operators. FOGA (2011)
Benjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen
Black-box complexities of combinatorial problems. GECCO (2011)
Benjamin Doerr, Carola Winzen
Memory-Restricted Black-Box Complexity. Electron. Colloquium Comput. Complex. 18 (2011)
Benjamin Doerr, Timo Kötzing, Carola Winzen
Too fast unbiased black-box algorithms. GECCO (2011)
Carola Winzen
Entwicklung einer Komplexitätstheorie für randomisierte Suchheuristiken: Black-Box-Modelle. Ausgezeichnete Informatikdissertationen (2011)
Benjamin Doerr, Carola Winzen
Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes. Artificial Evolution (2011)
Benjamin Doerr, Carola Winzen
Playing Mastermind With Constant-Size Memory CoRR (2011)
Benjamin Doerr, Daniel Johannsen, Carola Winzen
Multiplicative Drift Analysis CoRR (2011)
Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen
Black-Box Complexities of Combinatorial Problems CoRR (2011)
Benjamin Doerr, Daniel Johannsen, Carola Winzen
Multiplicative drift analysis. GECCO (2010)
Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
Optimizing Monotone Functions Can Be Difficult CoRR (2010)
Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
Optimizing Monotone Functions Can Be Difficult. PPSN (1) (2010)
Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen
Faster Black-Box Algorithms Through Higher Arity Operators CoRR (2010)
Benjamin Doerr, Daniel Johannsen, Carola Winzen
Non-Existence of Linear Universal Drift Functions CoRR (2010)
Benjamin Doerr, Daniel Johannsen, Carola Winzen
Drift analysis and linear functions revisited. IEEE Congress on Evolutionary Computation (2010)
Michael Gnewuch, Anand Srivastav, Carola Winzen
Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. J. Complex. 25 (2) (2009)

Carola Winzen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Carola Winzen