{"id":"https://openalex.org/W3173336480","doi":"https://doi.org/10.1145/3409964.3461810","title":"A Scalable Concurrent Algorithm for Dynamic Connectivity","display_name":"A Scalable Concurrent Algorithm for Dynamic Connectivity","publication_year":2021,"publication_date":"2021-06-30","ids":{"openalex":"https://openalex.org/W3173336480","doi":"https://doi.org/10.1145/3409964.3461810","mag":"3173336480"},"language":"en","primary_location":{"id":"doi:10.1145/3409964.3461810","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3409964.3461810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","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/A5101962939","display_name":"Alexander Fedorov","orcid":"https://orcid.org/0000-0002-5109-9595"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander Fedorov","raw_affiliation_strings":["JetBrains Research & Higher School of Economics, St. Petersburg, Russian Fed"],"affiliations":[{"raw_affiliation_string":"JetBrains Research & Higher School of Economics, St. Petersburg, Russian Fed","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047006729","display_name":"Nikita Koval","orcid":"https://orcid.org/0000-0002-1260-4616"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikita Koval","raw_affiliation_strings":["JetBrains Research, St. Petersburg, Russian Fed"],"affiliations":[{"raw_affiliation_string":"JetBrains Research, St. Petersburg, Russian Fed","institution_ids":[]}]},{"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":["IST Austria, Klosterneuburg, Austria"],"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101962939"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1528,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.48764842,"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":"208","last_page":"220"},"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.9995999932289124,"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.9995999932289124,"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/T11478","display_name":"Caching and Content Delivery","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.9968000054359436,"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.846049427986145},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7115528583526611},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5904079675674438},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.5281087160110474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5194544196128845},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4483833312988281},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.442781925201416},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41098183393478394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4088084101676941},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09673193097114563},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08752059936523438},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08556658029556274}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.846049427986145},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7115528583526611},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5904079675674438},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.5281087160110474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5194544196128845},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4483833312988281},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.442781925201416},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41098183393478394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4088084101676941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09673193097114563},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08752059936523438},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08556658029556274},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3409964.3461810","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3409964.3461810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1886894033","https://openalex.org/W1963524245","https://openalex.org/W1986022261","https://openalex.org/W1986261983","https://openalex.org/W2010151376","https://openalex.org/W2036896087","https://openalex.org/W2045430818","https://openalex.org/W2063319420","https://openalex.org/W2085849292","https://openalex.org/W2101939036","https://openalex.org/W2103913570","https://openalex.org/W2132220514","https://openalex.org/W2165829871","https://openalex.org/W2898536681","https://openalex.org/W2910567467","https://openalex.org/W2916456461","https://openalex.org/W2923254968","https://openalex.org/W2963212338","https://openalex.org/W2964260809","https://openalex.org/W2964265366","https://openalex.org/W3098691752","https://openalex.org/W4244083566","https://openalex.org/W4255353403"],"related_works":["https://openalex.org/W2392835431","https://openalex.org/W1965371215","https://openalex.org/W2126932387","https://openalex.org/W2353762239","https://openalex.org/W2484966135","https://openalex.org/W2015050211","https://openalex.org/W2108990487","https://openalex.org/W3162204513","https://openalex.org/W2126435977","https://openalex.org/W2017131087"],"abstract_inverted_index":{"Dynamic":[0],"Connectivity":[1],"is":[2,77,87,116,148,164,200],"a":[3,10,23,117,253],"fundamental":[4],"algorithmic":[5],"graph":[6,52],"problem,":[7,108],"motivated":[8],"by":[9,185],"wide":[11],"range":[12],"of":[13,50,99,121,135,143,239,241,252],"applications":[14],"to":[15,45,83,105,128,165,215,261,267],"social":[16],"and":[17,20,34,57,71,231,265],"communication":[18],"networks":[19],"used":[21,104],"as":[22,31],"building":[24],"block":[25],"in":[26,92,151,217],"various":[27,225],"other":[28],"algorithms,":[29],"such":[30],"the":[32,35,47,51,60,63,88,100,109,130,140,182,193,206,221,237,242,245,250],"bi-connectivity":[33],"dynamic":[36,54,136],"minimal":[37],"spanning":[38],"tree":[39],"problems.":[40],"In":[41,59],"brief,":[42],"we":[43,90,156],"wish":[44],"maintain":[46],"connected":[48,207],"components":[49,214],"under":[53],"edge":[55],"insertions":[56],"deletions.":[58],"sequential":[61,145],"case,":[62],"problem":[64],"has":[65],"been":[66],"well-studied":[67],"from":[68,97],"both":[69,229],"theoretical":[70],"practical":[72],"perspectives.":[73],"However,":[74],"much":[75],"less":[76],"known":[78],"about":[79],"efficient":[80,247],"concurrent":[81,133],"solutions":[82],"this":[84,93,107,125],"problem.":[85],"This":[86],"gap":[89],"address":[91],"paper.":[94],"We":[95,123,219],"start":[96],"one":[98],"classic":[101],"data":[102,126],"structures":[103],"solve":[106],"Euler":[110],"Tour":[111],"Tree.":[112],"Our":[113],"first":[114,131,163],"contribution":[115],"non-blocking":[118],"single-writer":[119],"implementation":[120,256],"it.":[122],"leverage":[124],"structure":[127,195],"obtain":[129],"truly":[132],"generalization":[134],"connectivity,":[137],"which":[138,170,209],"preserves":[139],"time":[141],"complexity":[142],"its":[144],"counterpart,":[146],"but":[147],"also":[149],"scalable":[150],"practice.":[152],"To":[153],"achieve":[154],"this,":[155],"rely":[157],"on":[158,212,224,228,257,263],"three":[159],"main":[160],"techniques.":[161],"The":[162,177,197,234],"ensure":[166],"that":[167,189],"connectivity":[168,194,270],"queries,":[169],"usually":[171],"dominate":[172],"real-world":[173],"workloads,":[174,226],"are":[175],"non-blocking.":[176,196],"second":[178],"non-trivial":[179],"technique":[180],"expands":[181],"above":[183],"idea":[184],"making":[186],"all":[187],"queries":[188,271],"do":[190],"not":[191],"change":[192],"third":[198],"ingredient":[199],"applying":[201],"fine-grained":[202],"locking":[203],"for":[204],"updating":[205],"components,":[208],"allows":[210],"operations":[211],"disjoint":[213],"occur":[216],"parallel.":[218],"evaluate":[220],"resulting":[222],"algorithm":[223],"executing":[227],"real":[230],"synthetic":[232],"graphs.":[233],"results":[235],"show":[236],"efficiency":[238],"each":[240],"proposed":[243],"optimizations;":[244],"most":[246],"variant":[248],"improves":[249],"performance":[251],"coarse-grained":[254],"based":[255],"realistic":[258],"scenarios":[259],"up":[260,266],"6x":[262],"average":[264],"30x":[268],"when":[269],"dominate.":[272]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}