Harold S. Connamacher

According to our database, Harold S. Connamacher authored at least 10 papers between 2003 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

Professional Accreditation and Competency-Based Computing Education.

Rajendra K. Raj, John Impagliazzo, Sherif G. Aly, David S. Bowers, Harold S. Connamacher, Stan Kurkovsky, Bonnie K. MacKellar, Tom Prickett, Maíra Marques Samary, Krassen Stefanov

Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022

Toward Competency-Based Professional Accreditation in Computing.

Rajendra K. Raj, John Impagliazzo, Sherif G. Aly, David S. Bowers, Harold S. Connamacher, Stan Kurkovsky, Bonnie K. MacKellar, Tom Prickett, Maíra Marques Samary

Proceedings of the 2022 Working Group Reports on Innovation and Technology in Computer Science Education, 2022

2020

Rankboost+: an improvement to Rankboost.

Harold S. Connamacher, Nikil Pancha, Rui Liu, Soumya Ray

Mach. Learn., 2020

On the uniformity of the approximation for r-associated Stirling numbers of the second Kind.

Harold S. Connamacher, Julia A. Dobrosotskaya

Contributions Discret. Math., 2020

2012

Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT.

Harold S. Connamacher

Theor. Comput. Sci., 2012

The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem.

Harold S. Connamacher, Michael Molloy

SIAM J. Discret. Math., 2012

2008

Threshold Phenomena in Random Constraint Satisfaction Problems.

Harold S. Connamacher

PhD thesis, 2008

2004

A Random Constraint Satisfaction Problem That Seems Hard for DPLL.

Harold S. Connamacher

Proceedings of the SAT 2004, 2004

The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem.

Harold S. Connamacher, Michael Molloy

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

The complexity of minimizing certain cost metrics for k-source spanning trees.

Harold S. Connamacher, Andrzej Proskurowski

Discret. Appl. Math., 2003