Papers
Topics
Authors
Recent
Search
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.

Authors (1)
Citations (7)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up