Tight bounds for synchronous communication of information using bits and silence

DOI10.1016/S0166-218X(02)00240-8zbMath1029.90017OpenAlexW2089762633MaRDI QIDQ1399118

Una-May O'Reilly, Nicola Santoro

Publication date: 30 July 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00240-8

zbMATH Keywords

time complexitybit complexitysynchronous networkstwo-party communication

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12) Communication theory (94A05)

Related Items (1)

On the Microscopic View of Time and Messages

Cites Work

• Unnamed Item
• Bit-optimal election in synchronous rings
• Improved bounds for electing a leader in a synchronous ring
• Finding the extrema of a distributed multiset
• Computing on an anonymous ring

This page was built for publication: Tight bounds for synchronous communication of information using bits and silence