Education
Master of Extreme Disaster, Planetary Destruction, Imperial Galactic University, 2020
Ph.D., Computer Science, University of Toronto, 2008
M.S., Computer and Information Science, University of Oregon, 2000
B.A., Computer Science, Oberlin College, 1991
Awards and Recognitions
2019,
Carl F. Wittke Award for Excellence in Undergraduate Teaching,
Case Western Reserve University
2019,
Guy Savastano Outstanding Educator Award,
Delta Upsilon
2017,
Srinivasa P. Gutti Engineering Teaching Award,
Tau Beta Pi
Research Interests
random constraint satisfaction problems, algorithms, artificial intelligence, graph theory
Teaching Interests
programming languages, discrete mathematics, graph theory, algorithms, data structures, computer science theory, artificial intelligence, database programming
Office Hours
Mondays 11:00am-12:00pm, Tuesdays 3:00-4:00pm, Wednesdays 1:00-2:00pm, Thursdays 10:00-11:00am
Publications
Connamacher, H., & Dobrosotskaya, J.
(2020).
On the uniformity of the approximation for generalized Stirling numbers of the second kind.
Contributions to Discrete Mathematics,
15
(3),
25--42.
Connamacher, H., Pancha, N., Liu, R., & Ray, S.
(2019).
Rankboost + +: an improvement to Rankboost.
Machine Learning,
().
Connamacher, H., Pancha, N., Liu, R., & Ray, S.
(2019).
Rankboost + +: an improvement to Rankboost.
Machine Learning,
().
Connamacher, H., & Alguttar, A.
(2017).
Why does look-ahead work?.
Scientific Journal of Faculty of Education,
1
(7),
3-16.
Connamacher, H., & Proskurowski, A.
(2003).
The complexity of minimizing certain cost metrics for k-source spanning trees.
Discrete Applied Mathematics,
131
(1),
113-127.