Using Galois fields in computer science (abstract only). - William A. Greene; Wayne Patterson (ACM Conference on Computer Science, 1985)

Partitioning Sets with Genetic Algorithms. - William A. Greene (FLAIRS, 2000)

A Non-Linear Schema Theorem for Genetic Algorithms. - William A. Greene (GECCO, 2000)

Dynamic Load-Balancing via a Genetic Algorithm. - William A. Greene (ICTAI, 2001)

Genetic Algorithms for Partitioning Sets. - William A. Greene (Int. J. Artif. Intell. Tools, 2001)

A Genetic Algorithm With Self-distancing Bits But No Overt Linkage. - William A. Greene (GECCO, 2002)

A Kernighan-Lin Local Improvement Heuristic that Softens Some Hard Problems in Genetic Algorithms. - William A. Greene (GECCO Late Breaking Papers, 2002)

Unsupervised hierarchical clustering via a genetic algorithm. - William A. Greene (IEEE Congress on Evolutionary Computation, 2003)

A Kernighan-Lin local improvement heuristic that softens several hard problems in genetic algorithms. - William A. Greene (IEEE Congress on Evolutionary Computation, 2003)

A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms. - William A. Greene (GECCO, 2003)

Schema Disruption in Chromosomes That Are Structured as Binary Trees. - William A. Greene (GECCO (1), 2004)

Schema disruption in tree-structured chromosomes. - William A. Greene (GECCO, 2005)

A tree-based genetic algorithm for building rectilinear Steiner arborescences. - William A. Greene (GECCO, 2006)