Round compression for parallel matching algorithms
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 10591
- Type
- D - Journal article
- DOI
-
10.1137/18M1197655
- Title of journal
- SIAM Journal of Computing
- Article number
- -
- First page
- STOC18
- Volume
- 49
- Issue
- 5
- ISSN
- 0097-5397
- Open access status
- Compliant
- Month of publication
- February
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
5
- Research group(s)
-
T - Theory and Foundations
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work first appeared at STOC'18, one of the two strongest conferences in theoretical computer science, and was invited to the corresponding special issue of SICOMP. Considered a breakthrough (cf. FOCS'19, SODA'19) in the Massive Parallel Computation (MPC) model, a nowadays-standard model of parallel computing underlying the industry standard MapReduce-like systems. The new approach developed showed that some graph optimisation problems can be solved in the MPC model faster than expected, leading to a stream of follow-up papers (Google, ETHZ, Columbia, MIT, UMaryland) extending this approach to other optimisation problems. This research was presented in the prestigious TCS+ seminar series.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -