1. Daida, Jason M., Hilss, Adam M., Ward, David J., and Long, Stephen L. (2005). Visualizing tree structures in genetic programming. Genetic Programming and Evolvable Machines, 6(1):79–110.
2. Langdon, W. B. (2002a). Convergence rates for the distribution of program outputs. In Langdon, W. B., Cantú-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M. A., Schultz, A. C., Miller, J. F., Burke, E., and Jonoska, N., editors, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 812–819, New York. Morgan Kaufmann Publishers.
3. Langdon, W. B. (2002b). How many good programs are there? How long are they? In De Jong, Kenneth A., Poli, Riccardo, and Rowe, Jonathan E., editors, Foundations of Genetic Algorithms VII, pages 183–202, Torremolinos, Spain. Morgan Kaufmann. Published 2003.
4. LNCS;W. B. Langdon,2003
5. Langdon, W. B. (2003b). The distribution of reversible functions is Normal. In Riolo, Rick L. and Worzel, Bill, editors, Genetic Programming Theory and Practise, chapter 11, pages 173–188. Kluwer.