{"id":"https://openalex.org/W2057041531","doi":"https://doi.org/10.1145/2597630","title":"Tight Bounds for Asynchronous Renaming","display_name":"Tight Bounds for Asynchronous Renaming","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2057041531","doi":"https://doi.org/10.1145/2597630","mag":"2057041531"},"language":"en","primary_location":{"id":"doi:10.1145/2597630","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2597630","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/201457","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083822059","display_name":"Dan Alistarh","orcid":"https://orcid.org/0000-0003-3650-940X"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Dan Alistarh","raw_affiliation_strings":["Microsoft Research Cambridge, Cambridge, UK","Microsoft Research Cambridge Cambridge, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research Cambridge Cambridge, UK#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036421091","display_name":"James Aspnes","orcid":"https://orcid.org/0000-0001-6188-1663"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James Aspnes","raw_affiliation_strings":["Yale, New Haven, CT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061279024","display_name":"Keren Censor-Hillel","orcid":"https://orcid.org/0000-0003-4395-5205"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Keren Censor-Hillel","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042520814","display_name":"Seth Gilbert","orcid":"https://orcid.org/0000-0003-3298-7412"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Seth Gilbert","raw_affiliation_strings":["National University of Singapore, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049321288","display_name":"Rachid Guerraoui","orcid":"https://orcid.org/0000-0002-4794-8902"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rachid Guerraoui","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.5273,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.95009945,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"61","issue":"3","first_page":"1","last_page":"51"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9864000082015991,"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/T12288","display_name":"Optimization and Search Problems","score":0.9782999753952026,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.668502688407898},{"id":"https://openalex.org/keywords/namespace","display_name":"Namespace","score":0.6579785346984863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5615557432174683},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5540835857391357},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.49208468198776245},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4744982421398163},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4609006643295288},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4217779040336609},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4127386510372162},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.41179054975509644},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3471691608428955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34044215083122253},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3306035101413727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3150290846824646},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.22164028882980347}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.668502688407898},{"id":"https://openalex.org/C2778383056","wikidata":"https://www.wikidata.org/wiki/Q873636","display_name":"Namespace","level":2,"score":0.6579785346984863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5615557432174683},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5540835857391357},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.49208468198776245},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4744982421398163},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4609006643295288},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4217779040336609},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4127386510372162},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.41179054975509644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3471691608428955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34044215083122253},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3306035101413727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3150290846824646},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.22164028882980347},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/2597630","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2597630","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/128452","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/128452","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.298.3431","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.3431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/homes/aspnes/papers/asynchronous-renaming.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.431.2007","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.431.2007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/homes/aspnes/papers/asynchronous-renaming.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.139","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://groups.csail.mit.edu/tds/papers/Censor-Hillel/AlistarhACGG-jour14.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.698.5071","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.5071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/201457/files/tight_bounds_a18-alistarh.pdf","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:201457","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/201457","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:201457","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/201457","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G3483167599","display_name":null,"funder_award_id":"CCF-0916389","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320320751","display_name":"Ministry of Education - Singapore","ror":"https://ror.org/01kcva023"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":68,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W1507039213","https://openalex.org/W1525123207","https://openalex.org/W1526359699","https://openalex.org/W1551716502","https://openalex.org/W1651545195","https://openalex.org/W1672483193","https://openalex.org/W1795399553","https://openalex.org/W1818190495","https://openalex.org/W1885809555","https://openalex.org/W1896834640","https://openalex.org/W1964746194","https://openalex.org/W1966074520","https://openalex.org/W1977697792","https://openalex.org/W1982100000","https://openalex.org/W1983572666","https://openalex.org/W1987782288","https://openalex.org/W1992427547","https://openalex.org/W1993805917","https://openalex.org/W1997124359","https://openalex.org/W1998458999","https://openalex.org/W1999197902","https://openalex.org/W2005147105","https://openalex.org/W2006656863","https://openalex.org/W2021785007","https://openalex.org/W2023866984","https://openalex.org/W2024581561","https://openalex.org/W2030003887","https://openalex.org/W2030205622","https://openalex.org/W2030785908","https://openalex.org/W2031502627","https://openalex.org/W2034325394","https://openalex.org/W2039113664","https://openalex.org/W2039966494","https://openalex.org/W2041549661","https://openalex.org/W2044657757","https://openalex.org/W2047846644","https://openalex.org/W2052556176","https://openalex.org/W2054439685","https://openalex.org/W2054987727","https://openalex.org/W2070570981","https://openalex.org/W2070595838","https://openalex.org/W2070832726","https://openalex.org/W2070993796","https://openalex.org/W2076458424","https://openalex.org/W2076575129","https://openalex.org/W2077437089","https://openalex.org/W2079376185","https://openalex.org/W2085407655","https://openalex.org/W2095126777","https://openalex.org/W2101939036","https://openalex.org/W2107149336","https://openalex.org/W2112383564","https://openalex.org/W2126924915","https://openalex.org/W2147270269","https://openalex.org/W2149907923","https://openalex.org/W2151672566","https://openalex.org/W2166071597","https://openalex.org/W2170523074","https://openalex.org/W2170544967","https://openalex.org/W2172260702","https://openalex.org/W2295944892","https://openalex.org/W2326587081","https://openalex.org/W2611515161","https://openalex.org/W3145128584","https://openalex.org/W3183881215","https://openalex.org/W3198160809","https://openalex.org/W4294549613"],"related_works":["https://openalex.org/W2279830512","https://openalex.org/W3046990805","https://openalex.org/W3097369619","https://openalex.org/W2007715402","https://openalex.org/W4287691960","https://openalex.org/W2963181990","https://openalex.org/W2913663107","https://openalex.org/W2899261484","https://openalex.org/W2137594557","https://openalex.org/W2902010279"],"abstract_inverted_index":{"This":[0,151,210,234],"article":[1],"presents":[2],"the":[3,8,63,133,180,204,207,228,231,237],"first":[4,36,238],"tight":[5,84,175,213],"bounds":[6,85,167],"on":[7,98,132],"time":[9],"complexity":[10,136,220,266],"of":[11,24,42,54,65,123,137,142,206],"shared-memory":[12],"renaming,":[13],"a":[14,22,32,99,119,140,158,185,193,212],"fundamental":[15,106],"problem":[16,107],"in":[17,20,57,108,230],"distributed":[18,109],"computing":[19],"which":[21],"set":[23],"processes":[25],"need":[26],"to":[27,104,154,203,239,259],"pick":[28],"distinct":[29],"identifiers":[30],"from":[31,102],"small":[33],"namespace.":[34],"We":[35,113],"prove":[37],"an":[38,73],"individual":[39,116],"lower":[40,121,166,251],"bound":[41,68,117,122],"\u03a9(":[43,124],"k":[44,58,61,125,128,223,226],")":[45],"process":[46],"steps":[47],"for":[48,86,146,168],"deterministic":[49,77,87],"renaming":[50,103,138,197,215,257],"into":[51,139,192],"any":[52,147,189],"namespace":[53,141],"size":[55,143],"subexponential":[56],",":[59,145],"where":[60,225],"is":[62,69,96,227,236,245],"number":[64],"participants.":[66],"The":[67,94],"tight:":[70],"it":[71,244],"draws":[72],"exponential":[74],"separation":[75],"between":[76],"and":[78,81,92,161,243,267],"randomized":[79,155,169,194,250],"solutions,":[80],"implies":[82],"new":[83,100,164],"concurrent":[88],"fetch-and-increment":[89,269],"counters,":[90],"queues,":[91],"stacks.":[93],"proof":[95],"based":[97],"reduction":[101],"another":[105],"computing:":[110],"mutual":[111],"exclusion.":[112],"complement":[114],"this":[115,256],"with":[118,199,217,263,271],"global":[120,165],"log":[126],"(":[127],"/":[129],"c":[130,148],"))":[131],"total":[134],"step":[135,219,265],"ck":[144],"\u2265":[149],"1.":[150],"result":[152],"applies":[153],"algorithms":[156],"against":[157],"strong":[159,195],"adversary,":[160],"helps":[162],"derive":[163],"approximate":[170],"counter":[171],"implementations,":[172],"that":[173,187],"are":[174],"within":[176],"logarithmic":[177,264],"factors.":[178],"On":[179],"algorithmic":[181],"side,":[182],"we":[183,254],"give":[184],"protocol":[186,258],"transforms":[188],"sorting":[190,208],"network":[191],"adaptive":[196,214],"algorithm,":[198],"expected":[200,218],"cost":[201],"equal":[202],"depth":[205],"network.":[209],"gives":[211],"algorithm":[216,235],"O":[221],"(log":[222],"),":[224],"contention":[229],"current":[232],"execution.":[233],"achieve":[240],"sublinear":[241],"time,":[242],"time-optimal":[246],"as":[247],"per":[248],"our":[249],"bound.":[252],"Finally,":[253],"use":[255],"build":[260],"monotone-consistent":[261],"counters":[262],"linearizable":[268],"registers":[270],"polylogarithmic":[272],"cost.":[273]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}