scientific article; zbMATH DE number 7561507
From MaRDI portal
Publication:5091162
DOI10.4230/LIPIcs.ICALP.2019.14MaRDI QIDQ5091162
Alexandr Andoni, Peilin Zhong, Clifford Stein
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1905.00850
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Equivalence classes and conditional hardness in massively parallel computations ⋮ Maliciously secure massively parallel computation for all-but-one corruptions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal EREW PRAM algorithm for minimum spanning tree verification
- Constructing a perfect matching is in random NC
- Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
- Sorting, Searching, and Simulation in the MapReduce Framework
- An Efficient Parallel Biconnectivity Algorithm
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- An O(logn) parallel connectivity algorithm
- Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
- Communication Steps for Parallel Query Processing
- Optimal bounds for decision problems on the CRCW PRAM
- Efficient massively parallel methods for dynamic programming
- Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
- Massively Parallel Computation of Matching and MIS in Sparse Graphs
- Round compression for parallel matching algorithms
- Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
- Parallel algorithms for geometric graph problems
- Multiplying matrices faster than coppersmith-winograd
This page was built for publication:
