{"id":"https://openalex.org/W2501233964","doi":"https://doi.org/10.1145/2933057.2933108","title":"A Randomized Concurrent Algorithm for Disjoint Set Union","display_name":"A Randomized Concurrent Algorithm for Disjoint Set Union","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2501233964","doi":"https://doi.org/10.1145/2933057.2933108","mag":"2501233964"},"language":"en","primary_location":{"id":"doi:10.1145/2933057.2933108","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933108","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-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/A5008303793","display_name":"Siddhartha Jayanti","orcid":"https://orcid.org/0000-0002-2681-1632"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Siddhartha V. Jayanti","raw_affiliation_strings":["Princeton University, Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Princeton University, Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008303793"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":0.8898,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.78290487,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"75","last_page":"82"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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.9991000294685364,"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/T11567","display_name":"semigroups and automata theory","score":0.9919999837875366,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.9247940182685852},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6769328117370605},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6644363403320312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.597311794757843},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5953434705734253},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5194172859191895},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5186225771903992},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.48156335949897766},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.47727981209754944},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3647751212120056},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.29786792397499084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26552918553352356},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.25515931844711304}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.9247940182685852},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6769328117370605},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6644363403320312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.597311794757843},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5953434705734253},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5194172859191895},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5186225771903992},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.48156335949897766},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.47727981209754944},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3647751212120056},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.29786792397499084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26552918553352356},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25515931844711304},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/2933057.2933108","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933108","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W374967721","https://openalex.org/W1967960741","https://openalex.org/W1986022261","https://openalex.org/W2001331197","https://openalex.org/W2002240881","https://openalex.org/W2041645051","https://openalex.org/W2044146725","https://openalex.org/W2065808229","https://openalex.org/W2085407655","https://openalex.org/W2089620427","https://openalex.org/W2101939036","https://openalex.org/W2114496697","https://openalex.org/W2159037239","https://openalex.org/W2280483494","https://openalex.org/W2294430699","https://openalex.org/W2751862591"],"related_works":["https://openalex.org/W2584763881","https://openalex.org/W1974895073","https://openalex.org/W2036758175","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W3097369619","https://openalex.org/W1994598067","https://openalex.org/W2061496873","https://openalex.org/W2011106535","https://openalex.org/W2963622642"],"abstract_inverted_index":{"Disjoint":[0],"set":[1],"union":[2],"is":[3,48,90,101],"a":[4,11,18,28,54,59,102],"basic":[5],"problem":[6,25,60],"in":[7,62],"data":[8],"structures":[9],"with":[10,116],"wide":[12],"variety":[13],"of":[14,51,105],"applications.":[15],"We":[16],"extend":[17],"known":[19],"efficient":[20,31],"sequential":[21],"algorithm":[22,34,74,98],"for":[23,58],"this":[24],"to":[26,45],"obtain":[27],"simple":[29],"and":[30,70,99],"concurrent":[32],"wait-free":[33],"running":[35],"on":[36],"an":[37],"asynchronous":[38],"parallel":[39],"random":[40,93],"access":[41],"machine":[42],"(APRAM).":[43],"Crucial":[44],"our":[46,73],"result":[47],"the":[49,88,92,97],"use":[50],"randomization.":[52],"Under":[53],"certain":[55],"independence":[56],"assumption,":[57],"instance":[61],"which":[63],"there":[64],"are":[65],"n":[66],"elements,":[67],"m":[68],"operations,":[69],"l":[71],"processes,":[72],"does":[75],"\u03b8(m":[76],"(\u03b1{n,":[77],"m/nl)":[78],"+":[79,82],"log":[80],"(nl/m":[81],"1":[83],")))":[84],"expected":[85],"work,":[86],"where":[87],"expectation":[89],"over":[91],"choices":[94],"made":[95],"by":[96],"\u03b1":[100],"functional":[103],"inverse":[104],"Ackermann's":[106],"function.":[107],"In":[108],"addition,":[109],"each":[110],"operation":[111],"takes":[112],"O(log":[113],"n)":[114],"steps":[115],"high":[117],"probability.":[118]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}