@inproceedings(Wagner:2011:foga,
  title = {Faster black-box algorithms through higher arity operators},
  author = {Benjamin Doerr and Daniel Johannsen and Timo Kotzing and Per 
Kristian Lehre and Markus Wagner and Carola Winzen},
  booktitle =	{Foundations of Genetic Algorithms},
  year =	2011,
  editor = 	{Hans-Georg Beyer and W.B. Langdon},
  pages =       {163--172},
  address = 	{Schwarzenberg, Austria},
  month = 	{5-9 Jan},
  organisation = {SigEvo},
  publisher = 	{ACM},
  note =	{},
  keywords =    {},
  ISBN13 =      {978-1-4503-0633-1},
  url =         {},
  size = 	{},
  doi = {doi:10.1145/1967654.1967669},
  abstract = {We
 extend the work of Lehre and Witt (GECCO 2010) on the unbiased 
black-box model by considering higher arity variation operators. In 
particular, we show that already for binary operators the black-box 
complexity of LeadingOnes drops from Theta(n<sup>2</sup>) for unary 
operators to O(n log n). For OneMax, the Omega(n log n) unary black-box 
complexity drops to O(n) in the binary case. For k-ary operators, k lteq 
n, the OneMax-complexity further decreases to O(n / log k).},
  notes =	{ACM order number 910114},
)