A note on the token distribution problem

DOI10.1016/0020-0190(91)90090-5zbMath0737.68001OpenAlexW1995152314MaRDI QIDQ1178250

Kieran T. Herley

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90090-5

zbMATH Keywords

routing algorithmsexpander graphics

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (4)

Strongly adaptive token distribution ⋮ Collaborative dispersion by silent robots ⋮ Representing shared data on distributed-memory parallel computers ⋮ Unnamed Item

Cites Work

• The generalized packet routing problem
• Sorting in \(c \log n\) parallel steps
• Ramanujan graphs
• Tight Bounds on the Complexity of Parallel Sorting
• The Token Distribution Problem
• Optimal Sorting Algorithms for Parallel Computers

This page was built for publication: A note on the token distribution problem