Pages that link to "Item:Q3104632"
From MaRDI portal
The following pages link to Sorting, Searching, and Simulation in the MapReduce Framework (Q3104632):
Displaying 19 items.
- The role of concurrency in an evolutionary view of programming abstractions (Q890610) (← links)
- When distributed computation is communication expensive (Q1689746) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Calculi for symmetric queries (Q2316929) (← links)
- Clique counting in MapReduce: algorithms and experiments (Q2828209) (← links)
- Brief Announcement: MapReduce Algorithms for Massive Trees (Q5002852) (← links)
- (Q5075750) (← links)
- Graph Connectivity in Log Steps Using Label Propagation (Q5087066) (← links)
- (Q5091075) (← links)
- (Q5091162) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (Q5860478) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- Improved MPC algorithms for MIS, matching, and coloring on trees and beyond (Q6535033) (← links)
- Density-based clustering in MapReduce with guarantees on parallel time, space, and solution quality (Q6670755) (← links)