A framework for program verification in the context of linked structures and pointer variables. - Tom P. Whaley (SIGCSE, 1991)

Postorder Trees and Eulerian Numbers. - Thomas P. Whaley (Acta Informatica, 1991)

A Case Study in ADT Implementation Verification. - Tom P. Whaley (Comput. Sci. Educ., 1992)

Alternative Developments of Cyclic-Permutation Algorithms. - Tom P. Whaley (Inf. Process. Lett., 1992)

Describing the CS forest to undergraduates (abstract). - Henry MacKay Walker; Kim B. Bruce; James Bradley; Tom P. Whaley (SIGCSE, 1994)

Generating strings for bipartite Steinhaus graphs. - Wayne M. Dymàcek; Tom P. Whaley (Discret. Math., 1995)

Parallel searches for hereditary node properties in binary trees. - Tom P. Whaley; Anurag Chandra; Noah Egorin; Wayne M. Dymàcek (ACM Southeast Regional Conference, 1998)

Characterizations of bipartite Steinhaus graphs. - Gerard J. Chang; Bhaskar DasGupta; Wayne M. Dymàcek; Martin Fürer; Matthew Koerlin; Yueh-Shin Lee; Tom P. Whaley (Discret. Math., 1999)

Adding web access to database projects - a simple approach. - Tom P. Whaley (J. Comput. Sci. Coll., 2000)

Disconnected Complements of Steinhaus graphs. - Wayne M. Dymàcek; Matthew Koerlin; Jean-Guy Speton; Tom P. Whaley; Jennifer Yanulavich (Electron. Notes Discret. Math., 2002)

Undergraduate participation in the development of the Alsos digital library for nuclear issues. - Tom P. Whaley; Frank A. Settle; Elizabeth R. Blackmer (J. Comput. Sci. Coll., 2002)

Including a web/database unit in CS0. - Tom P. Whaley (J. Comput. Sci. Coll., 2005)

Using a blog for enrichment readings in CSO. - Tom P. Whaley (J. Comput. Sci. Coll., 2006)