Carola Winzen

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