Your search returned the following 5 documents:

5. Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
   Greg Durrett, Frank Neumann, and Una-May O'Reilly
   In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 69-80
   
4. Faster black-box algorithms through higher arity operators
   Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Christian Lehre, Markus Wagner, and Carola Winzen
   In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), Schwarzenberg, Austria, 2011, 163-172
   
3. Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
   Benjamin Doerr, Daniel Johannsen, and Martin Schmidt
   In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 119-126
   [PDF: Download: DoerrJohannsenSchmidt11.pdf]
   
2. Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
   Timo Kötzing, Frank Neumann, Dirk Sudholt, and Markus Wagner
   In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 209-218
   
1. The Logarithmic Hypervolume Indicator
   Tobias Friedrich, Karl Bringmann, Thomas Voss, and Christian Igel
   In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 81-92