Incomparable Prime Ideals of Recursively Enumerable Degrees. - William C. Calhoun (Ann. Pure Appl. Log., 1993)

The Pi20 Enumeration Degrees Are Not Dense. - William C. Calhoun; Theodore A. Slaman (J. Symb. Log., 1996)

Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees. - William C. Calhoun; Manuel Lerman (J. Symb. Log., 2001)

Panel on integrating security concepts into existing computer courses. - Paul Mullins 001; Jim Wolfe; Michael Fry 003; Erik L. Wynters; William C. Calhoun; Robert Montante; William Oblitey (SIGCSE, 2002)

Totally magic labelings of graphs. - William C. Calhoun; Kevin Ferland; Lisa Lister; John B. Polhill (Australas. J Comb., 2005)

Degrees of monotone complexity. - William C. Calhoun (J. Symb. Log., 2006)

Perfect distance forests. - William C. Calhoun; John B. Polhill (Australas. J Comb., 2008)

Predicting the types of file fragments. - William C. Calhoun; Drue Coles (Digit. Investig., 2008)

Triviality and Minimality in the Degrees of Monotone Complexity. - William C. Calhoun (J. Log. Comput., 2012)