{"id":"https://openalex.org/W1974993532","doi":"https://doi.org/10.1145/2636922","title":"Union-Find with Constant Time Deletions","display_name":"Union-Find with Constant Time Deletions","publication_year":2014,"publication_date":"2014-08-25","ids":{"openalex":"https://openalex.org/W1974993532","doi":"https://doi.org/10.1145/2636922","mag":"1974993532"},"language":"en","primary_location":{"id":"doi:10.1145/2636922","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2636922","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/A5034291253","display_name":"Stephen Alstrup","orcid":"https://orcid.org/0000-0001-7896-8386"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Stephen Alstrup","raw_affiliation_strings":["University of Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["University of Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070148734","display_name":"Inge Li G\u00f8rtz","orcid":"https://orcid.org/0000-0002-8322-4952"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Inge Li G\u00f8rtz","raw_affiliation_strings":["Technical University of Denmark","#N##TAB##TAB##TAB##TAB# Technical University of Denmark#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# Technical University of Denmark#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048329619","display_name":"Theis Rauhe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Theis Rauhe","raw_affiliation_strings":["Octoshape Aps"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Octoshape Aps","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Uri Zwick","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7868,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.84185951,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"28"},"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.9991999864578247,"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.9991999864578247,"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/T10237","display_name":"Cryptography and Data Security","score":0.9805999994277954,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.9028780460357666},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.897954523563385},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6741300821304321},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6701146960258484},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.63607257604599},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5578123927116394},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5392585396766663},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5091716647148132},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5076264142990112},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5032631754875183},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2626284956932068}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.9028780460357666},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.897954523563385},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6741300821304321},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6701146960258484},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.63607257604599},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5578123927116394},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5392585396766663},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5091716647148132},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5076264142990112},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5032631754875183},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2626284956932068},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2636922","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2636922","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"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/1e044b4a-a68b-4a2d-b221-affaa942c79f","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/unionfind-with-constant-time-deletions(1e044b4a-a68b-4a2d-b221-affaa942c79f).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alstrup , S , Thorup , M , G\u00f8rtz , I L , Rauhe , T & Zwick , U 2014 , ' Union-find with constant time deletions ' , A C M Transactions on Algorithms , vol. 11 , no. 1 , 6 . https://doi.org/10.1145/2636922","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/1e044b4a-a68b-4a2d-b221-affaa942c79f","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/1e044b4a-a68b-4a2d-b221-affaa942c79f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alstrup , S , Thorup , M , G\u00f8rtz , I L , Rauhe , T & Zwick , U 2014 , ' Union-find with constant time deletions ' , A C M Transactions on Algorithms , vol. 11 , no. 1 , 6 . https://doi.org/10.1145/2636922","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321504","display_name":"Carlsbergfondet","ror":"https://ror.org/01kpjmx04"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"},{"id":"https://openalex.org/F4320335016","display_name":"Israeli Centers for Research Excellence","ror":"https://ror.org/03w2v9593"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W1489273657","https://openalex.org/W1513400187","https://openalex.org/W1655990431","https://openalex.org/W1965680834","https://openalex.org/W1981830935","https://openalex.org/W1982512167","https://openalex.org/W1986022261","https://openalex.org/W1988615825","https://openalex.org/W1994796030","https://openalex.org/W2006290442","https://openalex.org/W2009802499","https://openalex.org/W2014686215","https://openalex.org/W2018895114","https://openalex.org/W2034641516","https://openalex.org/W2036896087","https://openalex.org/W2037118252","https://openalex.org/W2037658490","https://openalex.org/W2044146725","https://openalex.org/W2049105156","https://openalex.org/W2055456564","https://openalex.org/W2062666771","https://openalex.org/W2067411846","https://openalex.org/W2089620427","https://openalex.org/W2090523578","https://openalex.org/W2098873146","https://openalex.org/W2101344335","https://openalex.org/W2156153879","https://openalex.org/W2752885492","https://openalex.org/W3139578191","https://openalex.org/W3145128584","https://openalex.org/W4252460087"],"related_works":["https://openalex.org/W2584763881","https://openalex.org/W8290509","https://openalex.org/W2184537587","https://openalex.org/W2065411828","https://openalex.org/W3092127654","https://openalex.org/W2013923536","https://openalex.org/W1482484961","https://openalex.org/W4205704978","https://openalex.org/W2006811735","https://openalex.org/W2076407808"],"abstract_inverted_index":{"A":[0],"union-find":[1,31,170,223],"data":[2,24,171,224],"structure":[3,172,225],"maintains":[4],"a":[5,46,60,125,163,214],"collection":[6],"of":[7,29,36,45,59,86,101,110,128,167,220,244,256,275],"disjoint":[8],"sets":[9,38],"under":[10],"the":[11,30,37,54,57,84,89,93,98,107,134,168,221,242,252,276],"operations":[12,103,112,138,191],"makeset,":[13],"union,":[14],"and":[15,19,69,114,180,199],"find.":[16],"Kaplan,":[17],"Shafrir,":[18],"Tarjan":[20],"[SODA":[21],"2002]":[22],"designed":[23],"structures":[25],"for":[26,147],"an":[27,228],"extension":[28],"problem":[32,160],"in":[33,49,88,149,183,192,212],"which":[34],"items":[35,87],"maintained":[39],"may":[40],"be":[41,140],"deleted.":[42],"The":[43],"cost":[44,58,243],"delete":[47,137],"operation":[48],"their":[50],"implementations":[51],"is":[52,83,97,106,124],"essentially":[53],"same":[55],"as":[56,176,178,281],"find":[61,94,111,145,190,245],"operation;":[62],"namely,":[63],"O":[64,70,193,200,229,257],"(log":[65,151,194],"n":[66,78,82,122,152,195,205,237],")":[67,123,153,196],"worst-case":[68,154,185,197],"(\u03b1":[71,201,230,258],"\u2308":[72,116,202,231,259],"M":[73,105,117,232,260],"/":[74,118,233,261],"N":[75,96,119,234,262,265],"\u2309":[76,120,235,263],"(":[77,121,204,236,264],"))":[79,206,238],"amortized,":[80],"where":[81],"number":[85,100,109],"set":[90],"returned":[91],"by":[92,161],"operation,":[95],"total":[99,108],"makeset":[102,179],"performed,":[104,113],"\u03b1":[115],"functional":[126],"inverse":[127],"Ackermann\u2019s":[129],"function.":[130],"They":[131],"left":[132],"open":[133,159],"question":[135],"whether":[136],"can":[139],"implemented":[141],"more":[142],"efficiently":[143],"than":[144],"operations,":[146,182],"example,":[148],"o":[150],"time.":[155,208],"We":[156],"resolve":[157],"this":[158],"presenting":[162],"relatively":[164],"simple":[165],"modification":[166],"classical":[169],"that":[173,226],"supports":[174],"delete,":[175],"well":[177],"union":[181],"constant":[184],"time,":[186],"while":[187],"still":[188],"supporting":[189],"time":[198],"M/N\u2309":[203],"amortized":[207,218,239,254],"Our":[209],"analysis":[210,219,270],"supplies,":[211],"particular,":[213],"very":[215],"concise":[216],"potential-based":[217,249],"standard":[222],"yields":[227],"bound":[240,255],"on":[241],"operations.":[246],"All":[247],"previous":[248],"analyses":[250],"yielded":[251],"weaker":[253],")).":[266],"Furthermore,":[267],"our":[268],"tighter":[269],"extends":[271],"to":[272],"one-path":[273],"variants":[274],"path":[277,282],"compression":[278],"technique":[279],"such":[280],"splitting":[283],".":[284]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}