Some lower bounds in dynamic networks with oblivious adversaries
From MaRDI portal
Publication:2174250
DOI10.1007/s00446-019-00360-4zbMath1433.68057OpenAlexW3082745838MaRDI QIDQ2174250
Yuda Zhao, Haifeng Yu, Irvan Jahja
Publication date: 21 April 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-019-00360-4
Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Communication complexity, information complexity (68Q11)
Cites Work
- Unnamed Item
- An information statistics approach to data stream and communication complexity
- Information spreading in dynamic networks under oblivious adversaries
- Fast Byzantine leader election in dynamic networks
- A characterization of oblivious message adversaries for which consensus is solvable
- Distributed computation in dynamic networks
- Aggregation in dynamic networks
- Coordinated consensus in dynamic networks
- The Complexity of Data Aggregation in Directed Networks
- The Cost of Fault Tolerance in Multi-Party Communication Complexity
- Interactive Information Complexity
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- SHARP INEQUALITIES FOR FACTORIAL n
- The Cost of Unknown Diameter in Dynamic Networks
- Fast byzantine agreement in dynamic networks
- The cost of radio network broadcast for different models of unreliable links
- Broadcasting in unreliable radio networks
- Probability Inequalities for Sums of Bounded Random Variables
- Optimal Dynamic Distributed MIS
- Distributed verification and hardness of distributed approximation
- On the Complexity of Information Spreading in Dynamic Networks
- Introduction to nonparametric estimation
This page was built for publication: Some lower bounds in dynamic networks with oblivious adversaries
