Computational complexity of random-access models - David R. Luginbuhl (1990)

Teaching Software Verification and Validation to Software Practitioner. - James E. Cardow; David R. Luginbuhl (CSEE, 1992)

The Complexity of On-Line Simulations Between Multidimensional Turing Machines and Random Access Machines. - Michael C. Loui; David R. Luginbuhl (Math. Syst. Theory, 1992)

Optimal On-Line Simulations of Tree Machines by Random Access Machines. - Michael C. Loui; David R. Luginbuhl (SIAM J. Comput., 1992)

Hierarchies and Space Measures for Pointer Machines - David R. Luginbuhl; Michael C. Loui (Inf. Comput., 1993)

Issues in Concurrent Systems Research. - David R. Luginbuhl (ACM Comput. Surv., 1996)

Challenges and rewards of teaching in a small computer science department. - Barbara Boucher Owens; Anne Gates Applin; Adel M. Abunawass; Laura Baker; David R. Luginbuhl; Mike Way (J. Comput. Sci. Coll., 2003)

CS1 assessment using memory diagrams. - Mark A. Holliday; David R. Luginbuhl (SIGCSE, 2004)

Basic research opportunities in computer science through the United States Air Force. - David R. Luginbuhl (ACM Southeast Regional Conference, 2007)