When distributed computation is communication expensive
From MaRDI portal
Publication:1689746
DOI10.1007/s00446-014-0218-3zbMath1423.68078arXiv1304.4636OpenAlexW2570634592MaRDI QIDQ1689746
Publication date: 17 January 2018
Published in: Lecture Notes in Computer Science, Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.4636
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Network protocols (68M12)
Related Items (8)
The Range of Topological Effects on Communication ⋮ Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model ⋮ Communication complexity of approximate maximum matching in the message-passing model ⋮ Unnamed Item ⋮ Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy ⋮ Message lower bounds via efficient network synchronization ⋮ Message Lower Bounds via Efficient Network Synchronization ⋮ Connectivity and connected components in the number-in-hand computation model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic counting algorithms for data base applications
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
- Communication complexity of approximate matching in distributed graphs
- Sorting, Searching, and Simulation in the MapReduce Framework
- Property testing and its connection to learning and approximation
- Efficient Protocols for Distributed Classification and Optimization
- Algorithms for distributed functional monitoring
- Functional Monitoring without Monotonicity
- Communication Steps for Parallel Query Processing
- Communication Complexity
- All-Pairs Almost Shortest Paths
- An Optimal Lower Bound for Distinct Elements in the Message Passing Model
- Tight bounds for distributed functional monitoring
This page was built for publication: When distributed computation is communication expensive
