Publications

Articles in Refereed Journals and Books

1. Evaluating a Program to Increase Faculty Use of Technology in Teaching and Learning, with Carmen Latterell, e-Journal of Instructional Science and Technology (e-JIST), Vol. 9 No. 2, http://www.usq.edu.au/e-JIST/.
2. Hand-held computers in the classroom and the library: teaching and learning resource issues resulting from widespread deployment at the University of Minnesota Duluth, with James Allert, Library Hi Tech, Vol. 21, No. 4 (2003), 419-425.
3. All in the Family: Searching for Success in Internal Partnerships, with Linda E. Parry, Robert Wharton, and Dan Burrows, The International Journal of Organizational Analysis, Vol. 7, No. 4 (1999), 333-351.
4. Information and Analysis: Managing by Fact, with Valerie Broughton. Chapter 7 of The Malcolm Baldrige National Quality Award as a Framework for Improving American Higher Education, ed. Daniel Seymour, 1995.
5. A Probably Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees, with Gary Shute and Clark Thomborson, Random Structures and Algorithms, Vol. 5, No. 4 (1994), 535-557.
6. A Dualizable Representation for General Graphs, with Clark D. Thomborson and Gary M. Shute, Graph Theory, Combinatorics, and Applications, Vol. 1, 1991.
7. An O(n log n) Plane-Sweep Algorithm for L_1 and L_infinity Delaunay Triangulations, with Gary M. Shute and Clark D. Thomborson, Algorithmica, Vol.6, 1991, 207-221.
8. Program Development and Documentation: A Four--Year Approach, with Keith R. Pierce, Proceedings of the 19th SIGCSE Technical Symposium on Computer Science Education, February 1988.
9. Polygonizations of Point Sets in the Plane, with Gary M. Shute, Journal of Discrete and Computational Geometry, 3:77--87 (1988).
10. Secret Encryption with Public Keys, The UMAP Journal, Vol. 8, No. 1, Spring 1987, 9-29.
11. On the Lattice of Subalgebras of an Algebra, Proceedings of the American Mathematical Society, vol. 86, no. 2, October 1982.

Articles in Refereed Conference Proceedings

1. Paradigms for Program Design, with Keith Pierce and Gary Shute, Proceedings of the Fifth SEI Conference on Software Engineering Education, October 1991.
2. Program Development and Documentation: A Four-Year Approach, with Keith R. Pierce, Proceedings of the 20th Annual Small College Computing Symposium, April 1987, 326-338.
3. The Contour Model as a Instructional Tool in Elementary Computer Science Courses, Proceedings of the 18th SIGCSE Technical Symposium on Computer Science Education, February 1987, 170-178.
4. Teaching Procedures, Parameters, and Scope Rules in an Introductory Programming Course Using the Contour Model of Block Structured Processes, Proceedings of the 19th Annual Small College Computing Symposium, April 1986, 130-139.

Articles in Nonrefereed Conference Proceedings

1. A Probably Fast, Provably Optimal Divide-And-Conquer Algorithm for Rectilinear Steiner Trees, with Gary Shute and Clark Thomborson, appeared in Proceedings of the Fourth Canadian Conference on Computational Geometry, August 1992.
2. Treasures in an Art Gallery, with Shashikant Joshi, appeared in Proceedings of the Fourth Canadian Conference on Computational Geometry, August 1992.
3. Students Mentoring Students: Recruiting and Retaining Women in Science and Engineering, with Dianne Dorland, appeared in the Proceedings of the Women in Engineering Conference, Washington D.C., May-June, 1992.
4. Using Partitioning and Clustering Techniques to Generate Rectilinear Steiner Trees, with Jeanne B. Dezell, appeared in the Proceedings of the Second Canadian Conference on Computational Geometry (1990).
5. Computing a Rectilinear Steiner Minimal Tree in n^(O(sqrt(n))) Time, with Clark D. Thomborson and Gary M. Shute, Parallel Algorithms and Architectures, Ed. Albrecht et al., Akademic-Verlag, Berlin, 1987.

Technical Reports

1. Paradigms for Program Design, with Keith Pierce and Gary Shute, UMD Technical Report 91-01, February 1991.
2. A Plane-Sweep Algorithm for Rectilinear Steiner Tress with Deferred Connections, with Gary Shute, UMD Technical Report 90-6, June 1990.
3. An O(n log n) Plane-Sweep Algorithm for L_1 and L_infinity Delaunay Triangulations, with Gary M. Shute and Clark D. Thomborson, UMD Technical Report 87-5, September 1987.
4. Polygonizations of Point Sets in the Plane, with Gary M. Shute, UMD Technical Report 86--9, July 1986.
5. Secret Encryption with Public Keys, UMD Technical Report 85-7, October 1985.
6. Some Results on Separability and Pure Inseparability for Algebras over Commutative Rings, Ph.D. Dissertation, Michigan State University, December 1980.