1. L. Altenberg, The Schema Theorem, Price’s Theorem, in Foundations of Genetic Algorithms 3, Estes Park, ed. by L.D. Whitley, M.D. Vose (Morgan Kaufmann, 1994), pp. 23–49.
http://dynamics.org/~altenber/PAPERS/STPT/
. Published 1995
2. P.J. Angeline, An investigation into the sensitivity of genetic programming to the frequency of leaf selection during subtree crossover, in Genetic Programming 1996: Proceedings of the First Annual Conference, Stanford University, ed. by J.R. Koza, D.E. Goldberg, D.B. Fogel, R.L. Riolo (MIT, 1996), pp. 21–29
3. W. Banzhaf, W.B. Langdon, Some considerations on the reason for bloat. Genet. Program. Evol. Mach. 3(1), 81–91 (2002). doi:10.1023/A:1014548204452.
http://web.cs.mun.ca/~banzhaf/papers/genp_bloat.pdf
4. R. Crawford-Marks, L. Spector, Size control via size fair genetic operators in the PushGP genetic programming system, in GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, ed. by W.B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M.A. Potter, A.C. Schultz, J.F. Miller, E. Burke, N. Jonoska (Morgan Kaufmann, 2002), pp. 733–739
5. S. Dignum, R. Poli, Generalisation of the limiting distribution of program sizes in tree-based genetic programming and analysis of its effects on bloat, in GECCO ’07: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, London, vol. 2, ed. by D. Thierens, H.G. Beyer, J. Bongard, J. Branke, J.A. Clark, D. Cliff, C.B. Congdon, K. Deb, B. Doerr, T. Kovacs, S. Kumar, J.F. Miller, J. Moore, F. Neumann, M. Pelikan, R. Poli, K. Sastry, K.O. Stanley, T. Stützle, R.A. Watson, I. Wegener (ACM, 2007), pp. 1588–1595.
http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p1588.pdf