B.A. (Computer Science), B.A. (Mathematics), State University of New York at Geneseo M.C.S., Ph.D., University of Virginia
Sean McCulloch joined the faculty in 2001, and teaches a wide variety of computer science courses. He participates in Ohio Wesleyan's Summer Science Research Program that provides summer research opportunities for OWU students. From 2007-2019, he participated in OWU's National Science Foundation sponsored Research Experiences for Undergraduates program.
I maintain the Discussions of NP-Complete Problems site, where I discuss the problems in Garey and Johnson's classic book Computers and Intractability: A Guide to the Theory of NP-Completeness. I explain the reductions for the problems from the point of view of an educator who teaches these kinds of problems in an upper-level Analysis of Algorithms class.