 
Summary: The Complexity of Renaming
Dan Alistarh
EPFL
James Aspnes
Yale
Seth Gilbert
NUS
Rachid Guerraoui
EPFL
Abstract We study the complexity of renaming, a fundamen
tal 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 subexponential 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 fetchand
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:
