On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary
DOI10.1145/1400751.1400768zbMATH Open1301.94105OpenAlexW1980206771MaRDI QIDQ2934339FDOQ2934339
Authors: Ashwinkumar Badanidiyuru Varadaraja, Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan 
Publication date: 12 December 2014
Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1400751.1400768
Recommendations
- On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
- Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
- On the communication complexity of reliable and secure message transmission in asynchronous networks
- On exponential lower bound for protocols for reliable communication in networks
- Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network
- Possibility and complexity of probabilistic reliable communication in directed networks
- On communication over Gaussian sensor networks with adversaries: further results
- Reliable broadcasts and communication models: tradeoffs and lower bounds
- scientific article; zbMATH DE number 3881867
- The adversarial noise threshold for distributed protocols
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Network protocols (68M12)
Cited In (3)
This page was built for publication: On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934339)
