Communication costs in a geometric communication network
From MaRDI portal
Publication:6052702
DOI10.1016/j.tcs.2023.114161arXiv2104.13499OpenAlexW4386376648MaRDI QIDQ6052702
Sima Hajiaghaei Shanjani, Valerie King
Publication date: 17 October 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.13499
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An almost space-optimal streaming algorithm for coresets in fixed dimensions
- Some problems in distributed computational geometry
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- On the distributional complexity of disjointness
- Near-linear lower bounds for distributed distance computations, even in sparse networks
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
- Approximating extent measures of points
- Approximate MST for UDG Locally
- A trade-off between information and communication in broadcast protocols
- The Probabilistic Communication Complexity of Set Intersection
- Distributed Computing: A Locality-Sensitive Approach
- Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels
- Communication Complexity
- Distributed Verification and Hardness of Distributed Approximation
- Circles passing through five or more integer points
- Approximate Convex Hull of Data Streams
- On the complexity of universal leader election
- Distributed verification and hardness of distributed approximation
- On the Complexity of Universal Leader Election
- DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS
- Routing with guaranteed delivery in ad hoc wireless networks
