{"id":"https://openalex.org/W1966074520","doi":"https://doi.org/10.1145/1993806.1993850","title":"Optimal-time adaptive strong renaming, with applications to counting","display_name":"Optimal-time adaptive strong renaming, with applications to counting","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W1966074520","doi":"https://doi.org/10.1145/1993806.1993850","mag":"1966074520"},"language":"en","primary_location":{"id":"doi:10.1145/1993806.1993850","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993806.1993850","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/164269","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/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":true,"raw_author_name":"Dan Alistarh","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"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 University, New Haven, CT, USA"],"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT, USA","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/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keren Censor-Hillel","raw_affiliation_strings":["MIT, Boston, MA, USA","MIT, Boston, MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Boston, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Boston, MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"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, Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024817143","display_name":"Morteza Zadimoghaddam","orcid":"https://orcid.org/0000-0003-0717-1120"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Morteza Zadimoghaddam","raw_affiliation_strings":["MIT, Boston, CT, USA","MIT, Boston, CT, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Boston, CT, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Boston, CT, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5083822059"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":5.2511,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.95553743,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"239","last_page":"248"},"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.9998000264167786,"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.9998000264167786,"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.9588000178337097,"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.9496999979019165,"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/computer-science","display_name":"Computer science","score":0.7596257925033569},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.691003143787384},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6601520776748657},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6317773461341858},{"id":"https://openalex.org/keywords/sorting-network","display_name":"Sorting network","score":0.6034634113311768},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.58614581823349},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5308699607849121},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5012314319610596},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48502272367477417},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4417962431907654},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4184919595718384},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4141181707382202},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3702660799026489},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3517721891403198},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.26371681690216064},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.234829843044281},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19332727789878845},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10897943377494812}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7596257925033569},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.691003143787384},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6601520776748657},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6317773461341858},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.6034634113311768},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.58614581823349},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5308699607849121},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5012314319610596},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48502272367477417},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4417962431907654},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4184919595718384},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4141181707382202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3702660799026489},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3517721891403198},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26371681690216064},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.234829843044281},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19332727789878845},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10897943377494812},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1993806.1993850","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993806.1993850","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/40517","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/40517","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":[],"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":"Conference Paper"},{"id":"pmh:oai:infoscience.tind.io:164269","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/164269","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.tind.io:164269","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/164269","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W1525123207","https://openalex.org/W1551716502","https://openalex.org/W1583994376","https://openalex.org/W1595409123","https://openalex.org/W1600795850","https://openalex.org/W1651545195","https://openalex.org/W1672483193","https://openalex.org/W1795399553","https://openalex.org/W1992427547","https://openalex.org/W1997124359","https://openalex.org/W1998458999","https://openalex.org/W2005147105","https://openalex.org/W2005399983","https://openalex.org/W2008370075","https://openalex.org/W2019354300","https://openalex.org/W2021785007","https://openalex.org/W2023866984","https://openalex.org/W2031502627","https://openalex.org/W2034229945","https://openalex.org/W2039966494","https://openalex.org/W2044657757","https://openalex.org/W2052556176","https://openalex.org/W2054439685","https://openalex.org/W2076458424","https://openalex.org/W2149907923","https://openalex.org/W2224374624","https://openalex.org/W2295944892","https://openalex.org/W2899702797","https://openalex.org/W6635597274","https://openalex.org/W6636070404","https://openalex.org/W6638244015"],"related_works":["https://openalex.org/W2055932080","https://openalex.org/W2293893573","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W1968512104","https://openalex.org/W1862126075","https://openalex.org/W78560857","https://openalex.org/W2648574256"],"abstract_inverted_index":{"We":[0,98,112],"give":[1],"two":[2],"new":[3],"randomized":[4],"algorithms":[5],"for":[6],"strong":[7,56,80,118],"renaming,":[8],"both":[9],"of":[10,29,31,40,68,110,136,149],"which":[11],"work":[12],"against":[13],"an":[14,61,73],"adaptive":[15,57,81],"adversary":[16],"in":[17,94],"asynchronous":[18],"shared":[19],"memory.":[20],"The":[21,48],"first":[22],"uses":[23],"repeated":[24],"sampling":[25],"over":[26],"a":[27,55,79,106,126,138,142,155],"sequence":[28],"arrays":[30],"decreasing":[32],"size":[33],"to":[34,38,65,101,124],"assign":[35],"unique":[36],"names":[37],"each":[39],"n":[41],"processes":[42],"with":[43,60,84,129],"step":[44,85,131,152],"complexity":[45,86,132,153],"O(log3":[46],"n).":[47],"second":[49],"transforms":[50],"any":[51,116],"sorting":[52,70,75],"network":[53],"into":[54],"renaming":[58,82,119],"protocol,":[59],"expected":[62],"cost":[63,135,148],"equal":[64],"the":[66,69,92,95,134,147,151],"depth":[67],"network.":[71],"Using":[72],"AKS":[74],"network,":[76],"this":[77,100],"gives":[78],"algorithm":[83],"O(log":[87],"k),":[88],"where":[89],"k":[90],"is":[91],"contention":[93],"current":[96],"execution.":[97],"show":[99,114],"be":[102,122],"optimal":[103],"based":[104],"on":[105],"classic":[107],"lower":[108],"bound":[109],"Jayanti.":[111],"also":[113],"that":[115],"such":[117],"protocol":[120],"can":[121],"used":[123],"build":[125],"monotone-consistent":[127],"counter":[128],"logarithmic":[130,156],"(at":[133,146],"adding":[137],"max":[139],"register)":[140],"or":[141],"linearizable":[143],"fetch-and-increment":[144],"register":[145],"increasing":[150],"by":[154],"factor).":[157]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}