$Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes$

Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes

24 October 2012

Papers citing "Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes"

2 / 2 papers shown

Title
Playing Mastermind With Constant-Size Memory Benjamin Doerr Carola Doerr LRM 72 44 0 17 Oct 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