Reducing the Arity in Unbiased Black-Box Complexity

19 March 2012

Papers citing "Reducing the Arity in Unbiased Black-Box Complexity"

6 / 6 papers shown

Title
$Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes$ Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes Benjamin Doerr Carola Doerr 68 16 0 24 Oct 2012
More Effective Crossover Operators for the All-Pairs Shortest Path Problem Benjamin Doerr Daniel Johannsen Timo Kotzing Frank Neumann M. Theile 78 53 0 02 Jul 2012
Playing Mastermind With Constant-Size Memory Benjamin Doerr Carola Doerr LRM 72 44 0 17 Oct 2011
Black-Box Complexities of Combinatorial Problems Benjamin Doerr Timo Kotzing Johannes Lengler Carola Doerr 77 39 0 01 Aug 2011
Multiplicative Drift Analysis Benjamin Doerr Daniel Johannsen Carola Doerr 75 282 0 04 Jan 2011
Faster Black-Box Algorithms Through Higher Arity Operators Benjamin Doerr Daniel Johannsen Timo Kotzing Per Kristian Lehre Markus Wagner Carola Doerr 70 64 0 04 Dec 2010