An Equivariance Theorem with Applications to Renaming
In the renaming problem, each process in a distributed system is issued a unique name from a large namespace, and the processes must coordinate with one another to choose unique names from a much smaller name space.
renaming distributed computing lower bound algebraic topology