| 2007 | GECCO | SNDL-MOEA: stored non-domination level MOEA. | Matt D. Johnson, Daniel R. Tauritz, Ralph W. Wilkerson |
| 1998 | SAC | Parallel genetic algorithm to solve the satisfiability problem. | Nicole Nemer-Preece, Ralph W. Wilkerson |
| 1997 | SAC | Direct finite first-order model generation with negative constraint propagation heuristic. | Olga Shumsky, Ralph W. Wilkerson, William McCune, Fikret Eral |
| 1996 | SAC | R-by-C Crozzle: an NP-hard problem. | Michelle Gower, Ralph W. Wilkerson |
| 1995 | PDPTA | A Fast Maze Routing Algorithm on Reconfigurable Meshes. | Hsi-Chieh Lee, Fikret Eral, Ralph W. Wilkerson |
| 1994 | SAC | Conjugating polynomials on finite rings. | Matt Insall, L. Mullin, Ralph W. Wilkerson |
| 1993 | SAC | Finding Fixed Point Combinators Using Prolog. | Richard Rankin, Ralph W. Wilkerson |
| 1993 | SAC | A Hybrid Genetic Algorithm for an NP-Complete Problem with an Expensive Evaluation Function. | Richard Rankin, Ralph W. Wilkerson, Geoff Harris, Jo Spring |
| 1992 | SAC | Experimentation with proof methods for non-Horn sets. | Chris Merz, Ralph W. Wilkerson |
| 1992 | SAC | Proving functionally difficult problems through model generation. | Richard Rankin, Ralph W. Wilkerson |
| 1990 | COMPSAC | An expert system to convert knowledge-based geological engineering systems into Fortran. | Jill J. Cress, Ralph W. Wilkerson |
| 1989 | COMPSAC | Expectations for associative-commutative unification speedups in a multicomputer environment. | Ralph W. Wilkerson, Bruce M. McMillin |
| 1987 | SIGCSE | A logic programming model of the game of sprouts. | Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson |