enumeration
degrees are not dense, with Theodore A. Slaman, Journal of Symbolic Logic,
61, No. 4 (Dec. 1996), 1364-1379 PUBLICATIONS
1. Degrees of monotone complexity, Journal of Symbolic Logic, to appear (accepted). pdf
2. Minimal distinct distance trees, with K. Ferland, L. Lister and J. Polhill, The Journal of Combinatorial Mathematics and Combinatorial Computing, to appear (accepted).
3. From Hilbert's program to computer programming, a chapter of the book From Calculus to Computers (A. Shell-Gellash and D. Jardine editors), Mathematical Association of America (November 2005).
4. Totally magic labelings of graphs, with K. Ferland, L. Lister and J. Polhill, Australasian Journal of Combinatorics, Vol. 32 (June 2005), pp. 47-60.
5. Volleyball scoring systems, with G. R. Dargahi-Noubary and Yixun Shi, Mathematics and Computer Education, Vol. 36, No. 1 (Winter 2002) pp. 70-79.
6. Embedding finite lattices into the ideals of computably enumerable Turing degrees, with Manuel Lerman, The Journal of Symbolic Logic, 66, No. 4 (Dec. 2001), 1891-1802
7. Changing the rules of tennis: An exercise in mathematical modeling, with Reza Noubary, Carver, 15, No. 1 (Spring 1998), Bloomsburg University, 15-23
8. Least squares and projections, with Mikhail Bouniaev, David Hill, Leigh Ann Myers, and Fred Worth, Academic Forum, No. 14 (1997), Henderson State University, 94-104
9. The
enumeration
degrees are not dense, with Theodore A. Slaman, Journal of Symbolic Logic,
61, No. 4 (Dec. 1996), 1364-1379
10. Incomparable prime ideals of recursively enumerable degrees, Annals of Pure and Applied Logic, 63 (1993), 39 - 56
11. The lattice of ideals of r.e. degrees, (research announcement), The Recursive Function Theory Newsletter, 38 (July, 1989), 377
12. Counting the subgroups of some finite groups, American Mathematical Monthly, 94, No. 1 (January, 1987), 54-59
THIS LIST IS UNDER CONSTRUCTION. (More links will be added.)