1. Borenstein, Y., Poli, R.: Kolmogorov complexity, optimization and hardness. In: CEC 2006 (2006)
2. Borenstein, Y., Poli, R.: No free lunch, Kolmogorov Complexity and the information landscape. In: Proceedings of IEEE CEC 2005, vol. 3 (2005)
3. Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. In: ECCC (048) (2003)
4. Lecture Notes in Computer Science;T.M. English,2004
5. Grunwald, P., Vitanyi, P.: Shannon information and kolmogorov complexity. IEEE Transactions on Information Theory (2004) (in Review)