2000 character limit reached
Slightly smaller splitter networks
Published 14 Nov 2010 in cs.DC | (1011.3170v1)
Abstract: The classic renaming protocol of Moir and Anderson (1995) uses a network of Theta(n2) splitters to assign unique names to n processes with unbounded initial names. We show how to reduce this bound to Theta(n{3/2}) splitters.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.