The Range of Topological Effects on Communication
From MaRDI portal
Publication:3449503
DOI10.1007/978-3-662-47666-6_43zbMath1440.68011arXiv1504.06602OpenAlexW2131378629MaRDI QIDQ3449503
Arkadev Chattopadhyay, Atri Rudra
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06602
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)
Related Items (3)
The Range of Topological Effects on Communication ⋮ Unnamed Item ⋮ Testing equality under the local broadcast model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Lipschitz embedding of finite metric spaces in Hilbert space
- Lower bounds on the multiparty communication complexity
- When distributed computation is communication expensive
- The geometry of graphs and some of its algorithmic applications
- Super-logarithmic depth lower bounds via the direct sum in communication complexity
- Separation of the monotone NC hierarchy
- How to Compress Interactive Communication
- On the power of the congested clique model
- Communication complexity of approximate matching in distributed graphs
- Three XOR-Lemmas — An Exposition
- On Yao’s XOR-Lemma
- The Range of Topological Effects on Communication
- Separating ${AC}^0$ from Depth-2 Majority Circuits
- Lower bounds on communication complexity in distributed computer networks
- Communication Steps for Parallel Query Processing
- Optimal Function Computation in Directed and Undirected Graphs
- An Optimal Lower Bound for Distinct Elements in the Message Passing Model
- Tight bounds for distributed functional monitoring
- Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
This page was built for publication: The Range of Topological Effects on Communication
