{"id":"https://openalex.org/W4366852977","doi":"https://doi.org/10.1145/3558481.3591082","title":"Provably-Efficient and Internally-Deterministic Parallel Union-Find","display_name":"Provably-Efficient and Internally-Deterministic Parallel Union-Find","publication_year":2023,"publication_date":"2023-05-31","ids":{"openalex":"https://openalex.org/W4366852977","doi":"https://doi.org/10.1145/3558481.3591082"},"language":"en","primary_location":{"id":"doi:10.1145/3558481.3591082","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3558481.3591082","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3558481.3591082","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3558481.3591082","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101962939","display_name":"Alexander Fedorov","orcid":"https://orcid.org/0000-0002-5109-9595"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Alexander Fedorov","raw_affiliation_strings":["Institute of Science and Technology Austria, Klosterneuburg, Austria"],"raw_orcid":"https://orcid.org/0000-0002-5109-9595","affiliations":[{"raw_affiliation_string":"Institute of Science and Technology Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001364199","display_name":"Diba Hashemi","orcid":"https://orcid.org/0009-0007-5940-4084"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Diba Hashemi","raw_affiliation_strings":["Institute of Science and Technology Austria, Klosterneuburg, Austria"],"raw_orcid":"https://orcid.org/0009-0007-5940-4084","affiliations":[{"raw_affiliation_string":"Institute of Science and Technology Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025497029","display_name":"Giorgi Nadiradze","orcid":"https://orcid.org/0000-0001-5634-0731"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Giorgi Nadiradze","raw_affiliation_strings":["Institute of Science and Technology Austria, Klosterneuburg, Austria"],"raw_orcid":"https://orcid.org/0000-0001-5634-0731","affiliations":[{"raw_affiliation_string":"Institute of Science and Technology Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083822059","display_name":"Dan Alistarh","orcid":"https://orcid.org/0000-0003-3650-940X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Dan Alistarh","raw_affiliation_strings":["Institute of Science and Technology Austria, Klosterneuburg, Austria"],"raw_orcid":"https://orcid.org/0000-0003-3650-940X","affiliations":[{"raw_affiliation_string":"Institute of Science and Technology Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101962939"],"corresponding_institution_ids":["https://openalex.org/I157556583"],"apc_list":null,"apc_paid":null,"fwci":0.5819,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69692645,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"261","last_page":"271"},"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.9994999766349792,"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.9994999766349792,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.7141754627227783},{"id":"https://openalex.org/keywords/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.640910267829895},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5864633917808533},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.497802734375},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4828956127166748},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4671613276004791},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43739423155784607},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41905859112739563},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.415500670671463},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41313329339027405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3683522343635559},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.26293277740478516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23408332467079163}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7141754627227783},{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.640910267829895},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5864633917808533},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.497802734375},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4828956127166748},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4671613276004791},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43739423155784607},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41905859112739563},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.415500670671463},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41313329339027405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3683522343635559},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26293277740478516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23408332467079163},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3558481.3591082","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3558481.3591082","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3558481.3591082","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3558481.3591082","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3558481.3591082","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3558481.3591082","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4366852977.pdf","grobid_xml":"https://content.openalex.org/works/W4366852977.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1965850153","https://openalex.org/W1979201594","https://openalex.org/W1983610133","https://openalex.org/W1986022261","https://openalex.org/W2013081353","https://openalex.org/W2151690061","https://openalex.org/W2258635823","https://openalex.org/W2469481711","https://openalex.org/W2736812013","https://openalex.org/W2886779068","https://openalex.org/W2962741105","https://openalex.org/W2984673154","https://openalex.org/W2993198966","https://openalex.org/W3006157595","https://openalex.org/W3041103022","https://openalex.org/W3132364392","https://openalex.org/W3159302701","https://openalex.org/W3161374268","https://openalex.org/W4220783457","https://openalex.org/W4245889724","https://openalex.org/W4366852977"],"related_works":["https://openalex.org/W4285069850","https://openalex.org/W1974634278","https://openalex.org/W4240963716","https://openalex.org/W2891970004","https://openalex.org/W4301075503","https://openalex.org/W1596637634","https://openalex.org/W1996916724","https://openalex.org/W2321918740","https://openalex.org/W1513982482","https://openalex.org/W2102802671"],"abstract_inverted_index":{"Determining":[0],"the":[1,41,46,117,140,147,186,230],"degree":[2],"of":[3,33,60,142,174,188,233],"inherent":[4],"parallelism":[5],"in":[6,21,50,119,133,146],"classical":[7,34],"sequential":[8,75,176],"algorithms":[9,76],"and":[10,24,62,137,144,181,225],"leveraging":[11],"it":[12],"for":[13,29,45,77,197,207],"fast":[14],"parallel":[15,22,106,120,158],"execution":[16],"is":[17,162,191,221,236],"a":[18,30,55,58,86,96,156,175],"key":[19],"topic":[20],"computing,":[23],"detailed":[25],"analyses":[26],"are":[27,53,80,109,139,169],"known":[28],"wide":[31],"range":[32],"algorithms.":[35],"In":[36],"this":[37,78,152],"paper,":[38],"we":[39,52,93],"perform":[40],"first":[42],"such":[43],"analysis":[44,220],"fundamental":[47],"Union-Find":[48,159],"problem,":[49],"which":[51,205,216],"given":[54],"graph":[56,118],"as":[57,183,185],"sequence":[59],"edges,":[61],"must":[63],"maintain":[64],"its":[65,167],"connectivity":[66],"structure":[67],"under":[68,82,101],"edge":[69,104],"additions.":[70],"We":[71,150,212],"prove":[72],"that":[73,161,218,229],"classic":[74],"problem":[79],"well-parallelizable":[81],"reasonable":[83],"assumptions,":[84],"addressing":[85],"conjecture":[87],"by":[88],"[Blelloch,":[89],"2017].":[90],"More":[91],"precisely,":[92],"show":[94,217],"via":[95],"new":[97,157],"potential":[98],"argument":[99],"that,":[100],"uniform":[102],"random":[103],"ordering,":[105],"union-find":[107],"operations":[108],"unlikely":[110],"to":[111,154,171,223],"interfere:":[112],"T":[113,190],"concurrent":[114],"threads":[115,189],"processing":[116],"will":[121],"encounter":[122],"memory":[123],"contention":[124],"O(T2":[125],"\u00b7":[126,129],"log":[127,130],"|V|":[128,138],"|E|)":[131],"times":[132],"expectation,":[134],"where":[135],"|E|":[136],"number":[141,187],"edges":[143],"nodes":[145],"graph,":[148],"respectively.":[149],"leverage":[151],"result":[153],"design":[155],"algorithm":[160],"both":[163],"internally":[164],"deterministic,":[165],"i.e.,":[166],"results":[168,227],"guaranteed":[170],"match":[172],"those":[173],"execution,":[177],"but":[178],"also":[179],"work-efficient":[180],"scalable,":[182],"long":[184],"O(|E|1":[192],"over":[193],"3":[194],"-":[195],"\u03b5),":[196],"an":[198],"arbitrarily":[199],"small":[200],"constant":[201],"\u03b5":[202],">":[203],"0,":[204],"holds":[206],"most":[208],"large":[209],"real-world":[210],"graphs.":[211],"present":[213],"lower":[214],"bounds":[215],"our":[219],"close":[222],"optimal,":[224],"experimental":[226],"suggesting":[228],"performance":[231],"cost":[232],"internal":[234],"determinism":[235],"limited.":[237]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}