scientific article; zbMATH DE number 6297759

zbMath1288.68247MaRDI QIDQ5417679

Siddharth Suri, Sergei Vassilvitskii, Howard J. Karloff

Publication date: 22 May 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Distributed systems (68M14)

Related Items

Equivalence classes and conditional hardness in massively parallel computations ⋮ Parallel skyline queries ⋮ The Range of Topological Effects on Communication ⋮ Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files ⋮ An exact approach to ridge regression for big data ⋮ A distributed framework for trimmed kernel \(k\)-means clustering ⋮ Graph Connectivity in Log Steps Using Label Propagation ⋮ Efficient Primal-Dual Graph Algorithms for MapReduce ⋮ Discrete facility location in machine learning ⋮ Graph reconstruction in the congested clique ⋮ Improved upper bounds for online malleable job scheduling ⋮ Deterministic Massively Parallel Connectivity ⋮ When distributed computation is communication expensive ⋮ Lessons from the congested clique applied to MapReduce ⋮ Distributed computing with the Cloud ⋮ Component stability in low-space massively parallel computation ⋮ Massively parallel and streaming algorithms for balanced clustering ⋮ Filter-embedding semiring fusion for programming with MapReduce ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory ⋮ Round Compression for Parallel Matching Algorithms ⋮ Communication complexity of approximate maximum matching in the message-passing model ⋮ Brief Announcement: MapReduce Algorithms for Massive Trees ⋮ On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes ⋮ Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Security and privacy aspects in MapReduce on clouds: a survey ⋮ Sub-logarithmic distributed algorithms for metric facility location ⋮ Malleable scheduling for flows of jobs and applications to MapReduce ⋮ The Parallel Complexity of Coloring Games ⋮ Near-optimal clustering in the \(k\)-machine model ⋮ Clique Counting in MapReduce ⋮ Scheduling MapReduce jobs on identical and unrelated processors ⋮ Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC ⋮ Unnamed Item ⋮ Distributed algorithms for matching in hypergraphs ⋮ Near-optimal scheduling in the congested clique