Slightly smaller splitter networks
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(n3/2) splitters.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.