default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarold S. Connamacher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2008
[b1]Harold S. Connamacher:
Threshold Phenomena in Random Constraint Satisfaction Problems. University of Toronto, Canada, 2008
Journal Articles
- 2020
- [j5]Harold S. Connamacher, Julia A. Dobrosotskaya:
On the uniformity of the approximation for r-associated Stirling numbers of the second Kind. Contributions Discret. Math. 15(3): 25-42 (2020) - [j4]Harold S. Connamacher
, Nikil Pancha, Rui Liu, Soumya Ray:
Rankboost+: an improvement to Rankboost. Mach. Learn. 109(1): 51-78 (2020) - 2012
- [j3]Harold S. Connamacher, Michael Molloy:
The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem. SIAM J. Discret. Math. 26(2): 768-800 (2012) - [j2]Harold S. Connamacher:
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT. Theor. Comput. Sci. 421: 25-55 (2012) - 2003
- [j1]Harold S. Connamacher, Andrzej Proskurowski:
The complexity of minimizing certain cost metrics for k-source spanning trees. Discret. Appl. Math. 131(1): 113-127 (2003)
Conference and Workshop Papers
- 2024
- [c5]Cruz Izu, Claudio Mirolo, Jürgen Börstler, 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, Seán Russell, Anshul Shah:
Introducing Code Quality in the CS1 Classroom. ITiCSE (2) 2024 - 2022
- [c4]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:
Toward Competency-Based Professional Accreditation in Computing. ITiCSE-WGR 2022: 1-35 - [c3]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:
Professional Accreditation and Competency-Based Computing Education. ITiCSE (2) 2022: 564-565 - 2004
- [c2]Harold S. Connamacher, Michael Molloy:
The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem. FOCS 2004: 590-599 - [c1]Harold S. Connamacher:
A Random Constraint Satisfaction Problem That Seems Hard for DPLL. SAT 2004
Informal and Other Publications
- 2012
- [i1]Harold S. Connamacher, Michael Molloy:
The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem. CoRR abs/1202.0042 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
