Educational Background

BA, Mathematics, Florida State University

MS, Mathematics, Florida State University

PhD, Computer Science,University of Illinois at Urbana-Champaign

Current Courses

CSE 1002, Fundamentals of Software Development 2

CSE 4250, Programming Language Concepts

Selected Publications

D. R. Luginbuhl, Review of “Connecting Discrete Mathematics and Computer Science,
by David Liben-Nowell. ACM SIGACT News (Nicholas Tran, Book Review Editor), vol.
54, no. 4, pp. 15-19, December 2023.

M. A. Holliday and D. R. Luginbuhl, “Peer-Centered Service Learning,” Proceedings of
the 34th ASEE/IEEE Frontiers in Education Conference (FIE04), October, 2004.

M. A. Holliday and D. R. Luginbuhl, “CS1 Assessment Using Memory Diagrams,”
Proceedings of the 35th ACM Technical Symposium on Computer Science Education
(SIGCSE 2004), February 2004.

M. A. Holliday and D. R. Luginbuhl, “Using Memory Diagrams When Teaching a Java-
Based CS1,” Proceedings of the 41st ACM Southeast Regional Conference, March 2003,
pp 376-381.

D. R. Luginbuhl and M. C. Loui, “Hierarchies and Space Measures for Pointer
Machines,” Information and Computation, vol. 104, no. 2, pp. 253-270, June 1993.

M. C. Loui and D. R. Luginbuhl, “Optimal On-Line Simulations of Tree Machines by
Random Access Machines,” SIAM Journal on Computing, vol. 21, no. 5, pp. 959-971,
October 1992.

M. C. Loui and D. R. Luginbuhl, “The Complexity of On-Line Simulations Between
Multidimensional Turing Machines and Random Access Machines,” Mathematical
Systems Theory, vol. 25, no. 4, pp. 293-308, October 1992.