{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:59:16Z","timestamp":1759939156400,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993806.1993850","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"239-248","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Optimal-time adaptive strong renaming, with applications to counting"],"prefix":"10.1145","author":[{"given":"Dan","family":"Alistarh","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"given":"James","family":"Aspnes","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Keren","family":"Censor-Hillel","sequence":"additional","affiliation":[{"name":"MIT, Boston, MA, USA"}]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Morteza","family":"Zadimoghaddam","sequence":"additional","affiliation":[{"name":"MIT, Boston, CT, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79158"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331529"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400791"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050039"},{"key":"e_1_3_2_1_5_1","first-page":"141","volume-title":"UK)","author":"Moir M.","year":"1994","unstructured":"M. Moir and J. H. Anderson , \" Fast, long-lived renaming (extended abstract),\" in WDAG '94: Proceedings of the 8th International Workshop on Distributed Algorithms, (London , UK) , pp. 141 -- 155 , Springer-Verlag , 1994 . M. Moir and J. H. Anderson, \"Fast, long-lived renaming (extended abstract),\" in WDAG '94: Proceedings of the 8th International Workshop on Distributed Algorithms, (London, UK), pp. 141--155, Springer-Verlag, 1994."},{"key":"e_1_3_2_1_6_1","first-page":"287","volume-title":"UK)","author":"Moir M.","year":"1996","unstructured":"M. Moir and J. A. Garay , \" Fast, long-lived renaming improved and simplified,\" in WDAG '96: Proceedings of the 10th International Workshop on Distributed Algorithms, (London , UK) , pp. 287 -- 303 , Springer-Verlag , 1996 . M. Moir and J. A. Garay, \"Fast, long-lived renaming improved and simplified,\" in WDAG '96: Proceedings of the 10th International Workshop on Distributed Algorithms, (London, UK), pp. 287--303, Springer-Verlag, 1996."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248078"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400801"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700366000"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050045"},{"key":"e_1_3_2_1_11_1","first-page":"149","article-title":"Long-lived, fast, waitfree renaming with optimal name space and high throughput","author":"Eberly W.","year":"1998","unstructured":"W. Eberly , L. Higham , and J. Warpechowska-Gruca , \" Long-lived, fast, waitfree renaming with optimal name space and high throughput ,\" in DISC , pp. 149 -- 160 , 1998 . W. Eberly, L. Higham, and J. Warpechowska-Gruca, \"Long-lived, fast, waitfree renaming with optimal name space and high throughput,\" in DISC, pp. 149--160, 1998.","journal-title":"DISC"},{"key":"e_1_3_2_1_12_1","first-page":"94","article-title":"Fast randomized test-and-set and renaming","author":"Alistarh D.","year":"2010","unstructured":"D. Alistarh , H. Attiya , S. Gilbert , A. Giurgiu , and R. Guerraoui , \" Fast randomized test-and-set and renaming ,\" in DISC , pp. 94 -- 108 , 2010 . D. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, \"Fast randomized test-and-set and renaming,\" in DISC, pp. 94--108, 2010.","journal-title":"DISC"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645949.675306"},{"key":"e_1_3_2_1_14_1","volume-title":"Inc.","author":"Knuth D. E.","year":"1998","unstructured":"D. E. Knuth , The art of computer programming, volume 3: (2nd ed.) sorting and searching. Redwood City, CA, USA: Addison Wesley Longman Publishing Co ., Inc. , 1998 . D. E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching. Redwood City, CA, USA: Addison Wesley Longman Publishing Co., Inc., 1998."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277735"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582728"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411510"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460200071"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.016"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/72981.72991"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164056"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_29"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0143-6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/185675.185815"},{"key":"e_1_3_2_1_27_1","first-page":"35","volume-title":"WDAG '92","author":"Attiya H.","year":"1992","unstructured":"H. Attiya , M. Herlihy , and O. Rachman , \" Efficient atomic snapshots using lattice agreement (extended abstract),\" in Proceedings of the 6th International Workshop on Distributed Algorithms , WDAG '92 , (London, UK), pp. 35 -- 53 , Springer-Verlag , 1992 . H. Attiya, M. Herlihy, and O. Rachman, \"Efficient atomic snapshots using lattice agreement (extended abstract),\" in Proceedings of the 6th International Workshop on Distributed Algorithms, WDAG '92, (London, UK), pp. 35--53, Springer-Verlag, 1992."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher M.","year":"2005","unstructured":"M. Mitzenmacher and E. Upfal , Probability and Computing: Randomized Algorithms and Probabilistic Analysis . New York, NY, USA : Cambridge University Press , 2005 . M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. New York, NY, USA: Cambridge University Press, 2005."}],"event":{"name":"PODC '11: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Jose California USA","acronym":"PODC '11"},"container-title":["Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993850","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993806.1993850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:52Z","timestamp":1750244752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":27,"alternative-id":["10.1145\/1993806.1993850","10.1145\/1993806"],"URL":"https:\/\/doi.org\/10.1145\/1993806.1993850","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}