Structural Information and Communication Complexity

DOI10.1007/b98251zbMath1085.68507OpenAlexW2499215041MaRDI QIDQ5315242

Mariusz A. Rokicki, Bogdan S. Chlebus

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

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)

Related Items (3)

Activating anonymous ad hoc radio networks ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Time-Efficient Broadcast in Radio Networks

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