1. Aaronson, S.: Lower bounds for local search by quantum arguments. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC’04), pp. 465–474. ACM Press, New York (2004)
2. Aldous, D.: Minimization algorithms and random walk on the d-cube. Ann. Probab. 11, 403–413 (1983)
3. Anil, G., Wiegand, R.P.: Black-box search by elimination of fitness functions. In: Proceedings of Foundations of Genetic Algorithms (FOGA’09), pp. 67–78. ACM Press, New York (2009)
4. Chvátal, V.: Mastermind. Combinatorica 3, 325–329 (1983)
5. Doerr, B., Johannsen, D., Kötzing, T., Lehre, P.K., Wagner, M., Winzen, C.: Faster black-box algorithms through higher arity operators. In: Proceedings of Foundations of Genetic Algorithms (FOGA’11), pp. 163–172. ACM Press, New York (2011)