Anon Photo

Harold Connamacher

Associate Department Chair, Computer and Data Sciences Department
Robert J. Herbold Professor of Transformative Teaching
Associate Professor, Computer and Data Sciences Department
Applies theoretical computer science techniques to discover problem structures and improve algorithm performance
Office: 803F Olin
Phone Number: (216) 368-5877
Email: harold.connamacher@case.edu

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., & Molloy, M. (2012). The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem. SIAM Journal on Discrete Mathematics, 26 (2), 768-800.
Connamacher, H. (2012). Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT. Theoretical Computer Science, 421 (), 25-55.
Connamacher, H., & Proskurowski, A. (2003). The complexity of minimizing certain cost metrics for k-source spanning trees. Discrete Applied Mathematics, 131 (1), 113-127.