{"id":"https://openalex.org/W2772781679","doi":"https://doi.org/10.1145/3147211","title":"Parallel Algorithms and Concentration Bounds for the Lov\u00e1sz Local Lemma via Witness DAGs","display_name":"Parallel Algorithms and Concentration Bounds for the Lov\u00e1sz Local Lemma via Witness DAGs","publication_year":2017,"publication_date":"2017-10-31","ids":{"openalex":"https://openalex.org/W2772781679","doi":"https://doi.org/10.1145/3147211","mag":"2772781679"},"language":"en","primary_location":{"id":"doi:10.1145/3147211","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3147211","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101783327","display_name":"David G. Harris","orcid":"https://orcid.org/0000-0002-3021-3555"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David G. Harris","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080591933"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.9085,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.77796005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"4","first_page":"1","last_page":"25"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9955000281333923,"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/T12288","display_name":"Optimization and Search Problems","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7431503534317017},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5695793628692627},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5476070046424866},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5424992442131042},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5420352816581726},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4974344074726105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46917444467544556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4353753924369812},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4269745647907257},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42487871646881104},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.42215192317962646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39646220207214355}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7431503534317017},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5695793628692627},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5476070046424866},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5424992442131042},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5420352816581726},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4974344074726105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46917444467544556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4353753924369812},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4269745647907257},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42487871646881104},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.42215192317962646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39646220207214355},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3147211","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3147211","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1449276546","display_name":null,"funder_award_id":"CCF-1527110, CCF-1618280, CNS-1010789 and CCF-1422569","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1666479227","https://openalex.org/W1967680338","https://openalex.org/W2006557844","https://openalex.org/W2042125214","https://openalex.org/W2047290604","https://openalex.org/W2066969286","https://openalex.org/W2072870176","https://openalex.org/W2100061495","https://openalex.org/W2109693504","https://openalex.org/W2156584294","https://openalex.org/W2198255326","https://openalex.org/W2552762966","https://openalex.org/W2586408513","https://openalex.org/W2616078511","https://openalex.org/W2963333553","https://openalex.org/W2964046371","https://openalex.org/W2964282105"],"related_works":["https://openalex.org/W2279830512","https://openalex.org/W3046990805","https://openalex.org/W3097369619","https://openalex.org/W4287691960","https://openalex.org/W2963181990","https://openalex.org/W2007715402","https://openalex.org/W2913663107","https://openalex.org/W2960354271","https://openalex.org/W2036758175","https://openalex.org/W1972433940"],"abstract_inverted_index":{"The":[0],"Lov\u00e1sz":[1],"Local":[2],"Lemma":[3],"(LLL)":[4],"is":[5,209],"a":[6,16,67,103,125,163],"cornerstone":[7],"principle":[8],"in":[9,47,84,131,152,202],"the":[10,99,111,115,181,184,204],"probabilistic":[11],"method":[12],"of":[13,19,66,118,168,183],"combinatorics,":[14],"and":[15,21,45,79,120,177,186,194],"seminal":[17],"algorithm":[18,28,39,106,117,150,167],"Moser":[20,119,193],"Tardos":[22,121],"(2010)":[23],"provides":[24],"an":[25,38,55,139,148],"efficient":[26],"randomized":[27],"to":[29,36,146,198],"implement":[30],"it.":[31],"This":[32,142],"can":[33,143],"be":[34,144],"parallelized":[35],"give":[37,102,147],"that":[40,107],"uses":[41,123],"polynomially":[42],"many":[43],"processors":[44],"runs":[46],"O":[48,60,86,132,154],"(log":[49,61,87,133,155],"3":[50],"n":[51,62,89,135,157],")":[52,63,136,158],"time":[53,85,137,153],"on":[54,138,180],"EREW":[56,140],"PRAM,":[57],"stemming":[58],"from":[59],"adaptive":[64],"computations":[65],"maximal":[68],"independent":[69],"set":[70],"(MIS).":[71],"Chung":[72],"et":[73,170],"al.":[74,171],"(2014)":[75],"developed":[76,191],"faster":[77],"local":[78],"parallel":[80,105,187],"algorithms,":[81],"potentially":[82],"running":[83,130,151],"2":[88,134,156],"),":[90],"but":[91,122],"these":[92],"algorithms":[93,189],"require":[94],"more":[95],"stringent":[96],"conditions":[97,113],"than":[98],"LLL.":[100],"We":[101,173],"new":[104],"works":[108],"under":[109],"essentially":[110],"same":[112],"as":[114,159],"original":[116],"only":[124],"single":[126],"MIS":[127],"computation,":[128],"thus":[129],"PRAM.":[141],"derandomized":[145],"NC":[149,165],"well,":[160],"speeding":[161],"up":[162],"previous":[164],"LLL":[166,207],"Chandrasekaran":[169],"(2013).":[172],"also":[174],"provide":[175],"improved":[176],"tighter":[178,205],"bounds":[179],"runtimes":[182],"sequential":[185],"resampling-based":[188],"originally":[190],"by":[192],"Tardos.":[195],"These":[196],"apply":[197],"any":[199],"problem":[200],"instance":[201],"which":[203],"Shearer":[206],"criterion":[208],"satisfied.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}