{"id":"https://openalex.org/W2061496873","doi":"https://doi.org/10.1016/0022-0000(79)90045-x","title":"Fast probabilistic algorithms for hamiltonian circuits and matchings","display_name":"Fast probabilistic algorithms for hamiltonian circuits and matchings","publication_year":1979,"publication_date":"1979-04-01","ids":{"openalex":"https://openalex.org/W2061496873","doi":"https://doi.org/10.1016/0022-0000(79)90045-x","mag":"2061496873"},"language":"en","primary_location":{"id":"doi:10.1016/0022-0000(79)90045-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0022-0000(79)90045-x","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022630792","display_name":"Dana Angluin","orcid":"https://orcid.org/0000-0002-6907-2999"},"institutions":[{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["FR","GB"],"is_corresponding":true,"raw_author_name":"D. Angluin","raw_affiliation_strings":["Computer Science Department, University of Edinburgh, Edinburgh, Scotland"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Edinburgh, Edinburgh, Scotland","institution_ids":["https://openalex.org/I98677209","https://openalex.org/I4210156583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015531084","display_name":"Leslie G. Valiant","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["FR","GB"],"is_corresponding":false,"raw_author_name":"L.G. Valiant","raw_affiliation_strings":["Computer Science Department, University of Edinburgh, Edinburgh, Scotland"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Edinburgh, Edinburgh, Scotland","institution_ids":["https://openalex.org/I98677209","https://openalex.org/I4210156583"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022630792"],"corresponding_institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I98677209"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":null,"fwci":11.1341,"has_fulltext":false,"cited_by_count":586,"citation_normalized_percentile":{"value":0.98755093,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"18","issue":"2","first_page":"155","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.7393909692764282},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7279983162879944},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6702580451965332},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5600714683532715},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5527148842811584},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5293655395507812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5268793702125549},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5193035006523132},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.504776120185852},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4860287308692932},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4847283363342285},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4766845703125},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4484651982784271},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44708094000816345},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4423177242279053},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.43959885835647583},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.4158766269683838},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3839500844478607},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3432350754737854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1402619183063507},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07150241732597351}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.7393909692764282},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7279983162879944},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6702580451965332},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5600714683532715},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5527148842811584},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5293655395507812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5268793702125549},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5193035006523132},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.504776120185852},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4860287308692932},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4847283363342285},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4766845703125},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4484651982784271},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44708094000816345},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4423177242279053},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.43959885835647583},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.4158766269683838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3839500844478607},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3432350754737854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1402619183063507},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07150241732597351}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0022-0000(79)90045-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0022-0000(79)90045-x","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W73733072","https://openalex.org/W1552744309","https://openalex.org/W1566129741","https://openalex.org/W1655990431","https://openalex.org/W1964053266","https://openalex.org/W1967384930","https://openalex.org/W1971367602","https://openalex.org/W1979469777","https://openalex.org/W1996028864","https://openalex.org/W2009232680","https://openalex.org/W2036265926","https://openalex.org/W2056084678","https://openalex.org/W2059608229","https://openalex.org/W2065295938","https://openalex.org/W2066356146","https://openalex.org/W2068789164","https://openalex.org/W2111559003","https://openalex.org/W2112575355","https://openalex.org/W2401610261","https://openalex.org/W2913222977","https://openalex.org/W3200447518","https://openalex.org/W4233756358","https://openalex.org/W4255102326","https://openalex.org/W4312512934","https://openalex.org/W6643314614","https://openalex.org/W6644040475","https://openalex.org/W6645281855","https://openalex.org/W6664656630","https://openalex.org/W6667096333","https://openalex.org/W6676858213"],"related_works":["https://openalex.org/W4250757898","https://openalex.org/W2174440985","https://openalex.org/W2112526268","https://openalex.org/W4245606755","https://openalex.org/W1964089073","https://openalex.org/W2011643166","https://openalex.org/W4243213822","https://openalex.org/W2248910422","https://openalex.org/W2035721896","https://openalex.org/W2083455476"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":21},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":10}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}