Skip to content

Harold S. Connamacher

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

8

Venues

3

Active years

2004–2025

Best venue rank

A*

Where they publish

Papers

8 indexed papers, newest first.

YearVenueTitleAuthors
2025ITiCSEDeveloping an AI Concept Inventory for Non-Experts.Linda Mannila, Julie Henry, Tobias Bahr, Christos Chytas, Harold S. Connamacher, Henry Hickman, Barbara C. N. Mller, Simone Opel, Andreas Scholl
2025ITiCSETowards Validating an Artificial Intelligence Concept Inventory for Non-Experts (AICI-NE): Common Misconceptions and Item Development.Linda Mannila, Julie Henry, Tobias Bahr, Christos Chytas, Harold S. Connamacher, Barbara C. N. Mller, Simone Opel, Andreas Scholl
2024ITiCSEIntroducing Code Quality at CS1 Level: Examples and Activities.Cruz Izu, Claudio Mirolo, Jrgen Brstler, Harold S. Connamacher, Ryan Crosby, Richard Glassey, Georgiana Haldeman, Olli Kiljunen, Amruth N. Kumar, David Liu, Andrew Luxton-Reilly, Stephanos Matsumoto, Eduardo Carneiro de Oliveira, Sen Russell, Anshul Shah
2024ITiCSEIntroducing Code Quality in the CS1 Classroom.Cruz Izu, Claudio Mirolo, Jrgen Brstler, Harold S. Connamacher, Ryan Crosby, Richard Glassey, Georgiana Haldeman, Olli Kiljunen, Amruth N. Kumar, David Liu, Andrew Luxton-Reilly, Stephanos Matsumoto, Eduardo Carneiro de Oliveira, Sen Russell, Anshul Shah
2022ITiCSEToward 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, Mara Marques Samary
2022ITiCSEProfessional 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, Mara Marques Samary, Krassen Stefanov
2004FOCSThe Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem.Harold S. Connamacher, Michael Molloy
2004SATA Random Constraint Satisfaction Problem That Seems Hard for DPLL.Harold S. Connamacher