A note on the token distribution problem

DOI10.1016/0020-0190(91)90090-5MaRDI QIDQ1178250zbMATH OpenOpenAlexFDO

Authors Kieran T. Herley

Publication date 26 June 1992

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

expander graphicsrouting algorithms

Mathematics Subject Classification ID

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

Recommendations

• The Token Distribution Problem
• Structural Information and Communication Complexity
• scientific article; zbMATH DE number 1267563
• Strongly adaptive token distribution
• Constant-space self-stabilizing token distribution in trees

Cites work

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

Cited in

(11)

• Constant-space self-stabilizing token distribution in trees
• Strongly adaptive token distribution
• The Token Distribution Problem
• scientific article; zbMATH DE number 1267563 (Why is no real title available?)
• scientific article; zbMATH DE number 1507041 (Why is no real title available?)
• Strongly adaptive token distribution
• Representing shared data on distributed-memory parallel computers
• scientific article; zbMATH DE number 7561459 (Why is no real title available?)
• Structural Information and Communication Complexity
• Collaborative dispersion by silent robots
• Brief announcement: Efficient load-balancing through distributed token dropping

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178250)