1. Ankenbrandt, C. A. (1991). An extension to the theory of convergence and a proof of the time complexity of genetic algorithms. In Foundations of Genetic Algorithm, San Mateo, CA, pp. 53–68. Morgan Kaufmann.
2. Baluja, S. (1993). Structure and performance of fine-grained parallelism in genetic search. In Proceedings of the Fifth International Conference on Genetic Algorithms, Urbana-Champaign, IL, pp. 155–162. Morgan Kaufmann.
3. Banks, R. B. (1994). Growth and Diffusion Phenomena. Springer-Verlag.
4. Collins, R. J. and D. R. Jefferson (1991). Selection in massively parallel genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA, pp. 249–256. Morgan Kaufmann.
5. De Jong, K. and J. Sarma (1995). On decentralizing selection algorithms. In Proceedings of the Sixth International Conference on Genetic Algorithms, Pittsburgh, PA, pp. 17–23. Morgan Kaufmann.