{"title":"The complexity of renaming","status":"public","acknowledgement":"The authors would like to thank Hagit Attiya and Keren\r\nCensor-Hillel  for  discussions  and  feedback  on  earlier  versions  of  this  paper,  and  the  anonymous  reviewers  for  their\r\nvery useful suggestions.","oa_version":"None","date_created":"2018-12-11T11:48:21Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"6895","year":"2011","publisher":"IEEE","publication_status":"published","date_published":"2011-01-01T00:00:00Z","citation":{"short":"D.-A. Alistarh, J. Aspnes, S. Gilbert, R. Guerraoui, in:, IEEE, 2011, pp. 718–727.","chicago":"Alistarh, Dan-Adrian, James Aspnes, Seth Gilbert, and Rachid Guerraoui. “The Complexity of Renaming,” 718–27. IEEE, 2011. <a href=\"https://doi.org/10.1109/FOCS.2011.66\">https://doi.org/10.1109/FOCS.2011.66</a>.","apa":"Alistarh, D.-A., Aspnes, J., Gilbert, S., &#38; Guerraoui, R. (2011). The complexity of renaming (pp. 718–727). Presented at the FOCS: Foundations of Computer Science, IEEE. <a href=\"https://doi.org/10.1109/FOCS.2011.66\">https://doi.org/10.1109/FOCS.2011.66</a>","ista":"Alistarh D-A, Aspnes J, Gilbert S, Guerraoui R. 2011. The complexity of renaming. FOCS: Foundations of Computer Science, 718–727.","ama":"Alistarh D-A, Aspnes J, Gilbert S, Guerraoui R. The complexity of renaming. In: IEEE; 2011:718-727. doi:<a href=\"https://doi.org/10.1109/FOCS.2011.66\">10.1109/FOCS.2011.66</a>","ieee":"D.-A. Alistarh, J. Aspnes, S. Gilbert, and R. Guerraoui, “The complexity of renaming,” presented at the FOCS: Foundations of Computer Science, 2011, pp. 718–727.","mla":"Alistarh, Dan-Adrian, et al. <i>The Complexity of Renaming</i>. IEEE, 2011, pp. 718–27, doi:<a href=\"https://doi.org/10.1109/FOCS.2011.66\">10.1109/FOCS.2011.66</a>."},"conference":{"name":"FOCS: Foundations of Computer Science"},"extern":"1","_id":"759","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We study the complexity of renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct names from a given namespace. We prove an individual lower bound of Ω(k) process steps for deterministic renaming into any namespace of size sub-exponential in k, where k is the number of participants. This bound is tight: it draws an exponential separation between deterministic and randomized solutions, and implies new tight bounds for deterministic fetch-and-increment registers, queues and stacks. The proof of the bound is interesting in its own right, for it relies on the first reduction from renaming to another fundamental problem in distributed computing: mutual exclusion. We complement our individual bound with a global lower bound of Ω(k log (k/c)) on the total step complexity of renaming into a namespace of size ck, for any c ≥ 1. This applies to randomized algorithms against a strong adversary, and helps derive new global lower bounds for randomized approximate counter and fetch-and-increment implementations, all tight within logarithmic factors."}],"type":"conference","day":"01","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"first_name":"James","last_name":"Aspnes","full_name":"Aspnes, James"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"}],"doi":"10.1109/FOCS.2011.66","page":"718 - 727","month":"01","article_processing_charge":"No","date_updated":"2023-02-23T13:11:40Z"}