On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission

DOI10.1145/2371656.2371657zbMath1281.68048OpenAlexW2014559953MaRDI QIDQ5395691

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, Ashwinkumar Badanidiyuru, Kannan Srinathan

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2371656.2371657

zbMATH Keywords

distributed computingmessage transmissioncomputationally unbounded

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Related Items (1)

Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity

This page was built for publication: On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission