Structural Information and Communication Complexity

DOI10.1007/B98251zbMATH Open1085.68537OpenAlexW2499215041MaRDI QIDQ5315230FDOQ5315230

Authors: Luciano Margara, Alessandro Pistocchi, Marco Vassura 

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98251

Recommendations

• Optimal dimension-exchange token distribution on complete binary trees
• Constant-space self-stabilizing token distribution in trees
• Near-perfect token distribution
• Near‐perfect token distribution
• The optimal distribution of a tree in a finite set
• scientific article; zbMATH DE number 7561459
• Token Swapping on Trees
• A note on the token distribution problem
• The Token Distribution Problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (9)

• Dimension-exchange algorithms for token distribution on tree-connected architectures
• Near‐perfect token distribution
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Token Distribution Problem
• Fast discrete consensus based on gossip for makespan minimization in networked systems
• Strongly adaptive token distribution
• Dimension-exchange token distribution on the mesh and the torus
• Near-perfect token distribution

This page was built for publication: Structural Information and Communication Complexity

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