The following pages link to (Q5417679):
Displaying 39 items.
- Parallel skyline queries (Q269332) (← links)
- Security and privacy aspects in MapReduce on clouds: a survey (Q739007) (← links)
- Sub-logarithmic distributed algorithms for metric facility location (Q748120) (← links)
- Scheduling MapReduce jobs on identical and unrelated processors (Q778521) (← links)
- Improved upper bounds for online malleable job scheduling (Q892840) (← links)
- Lessons from the congested clique applied to MapReduce (Q896148) (← links)
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files (Q1662611) (← links)
- A distributed framework for trimmed kernel \(k\)-means clustering (Q1669597) (← links)
- When distributed computation is communication expensive (Q1689746) (← links)
- Filter-embedding semiring fusion for programming with MapReduce (Q1941877) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← 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)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- An exact approach to ridge regression for big data (Q2403397) (← links)
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security (Q2690521) (← links)
- The Parallel Complexity of Coloring Games (Q2819445) (← links)
- Clique Counting in MapReduce (Q2828209) (← links)
- Efficient Primal-Dual Graph Algorithms for MapReduce (Q2945274) (← links)
- (Q2958605) (← links)
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation (Q3012949) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes (Q4640336) (← 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)
- Discrete facility location in machine learning (Q5100135) (← 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)
- Distributed computing with the Cloud (Q6126134) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- Massively parallel and streaming algorithms for balanced clustering (Q6144020) (← links)
