ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1802.08237
  4. Cited By
Improved Massively Parallel Computation Algorithms for MIS, Matching,
  and Vertex Cover
v1v2v3v4 (latest)

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

22 February 2018
M. Ghaffari
Themis Gouleakis
Christian Konrad
Slobodan Mitrovic
R. Rubinfeld
ArXiv (abs)PDFHTML

Papers citing "Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover"

33 / 33 papers shown
Title
Average Awake Complexity of MIS and Matching
Average Awake Complexity of MIS and Matching
M. Ghaffari
Julian Portmann
38
13
0
10 May 2023
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Yi-Jun Chang
Danling Zheng
75
1
0
15 Apr 2023
Streaming Kernel PCA Algorithm With Small Space
Streaming Kernel PCA Algorithm With Small Space
Yichuan Deng
Zhao Song
Zifan Wang
Hangke Zhang
113
4
0
08 Mar 2023
Distributed Symmetry Breaking on Power Graphs via Sparsification
Distributed Symmetry Breaking on Power Graphs via Sparsification
Yannic Maus
Saku Peltonen
Jara Uitto
55
11
0
14 Feb 2023
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs
Manuela Fischer
Jeff Giliberti
Christoph Grunau
58
5
0
26 Jan 2023
Massively Parallel Algorithms for $b$-Matching
Massively Parallel Algorithms for bbb-Matching
M. Ghaffari
Christoph Grunau
Slobodan Mitrovic
FedML
34
7
0
14 Nov 2022
A New Model for Massively Parallel Computation Considering both
  Communication and IO Cost
A New Model for Massively Parallel Computation Considering both Communication and IO Cost
Hengzhao Ma
Xiangyu Gao
Jianzhong Li
Tian-Hui Gao
23
0
0
24 Mar 2022
Improved Deterministic $(Δ+1)$-Coloring in Low-Space MPC
Improved Deterministic (Δ+1)(Δ+1)(Δ+1)-Coloring in Low-Space MPC
A. Czumaj
Peter Davies
M. Parter
45
21
0
10 Dec 2021
Deterministic Massively Parallel Connectivity
Deterministic Massively Parallel Connectivity
Samantha R. Coy
A. Czumaj
73
18
0
09 Aug 2021
Component Stability in Low-Space Massively Parallel Computation
Component Stability in Low-Space Massively Parallel Computation
A. Czumaj
Peter Davies
M. Parter
48
24
0
03 Jun 2021
Robust Lower Bounds for Graph Problems in the Blackboard Model of
  Communication
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication
C. Konrad
Peter Robinson
Viktor Zamaraev
48
2
0
12 Mar 2021
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs
Mélanie Cambus
Davin Choo
Havu Miikonen
Jara Uitto
41
15
0
23 Feb 2021
Time-Optimal Construction of Overlay Networks
Time-Optimal Construction of Overlay Networks
Thorsten Götte
Kristian Hinnenthal
Christian Scheideler
Julian Werthmann
43
21
0
08 Sep 2020
Massively Parallel Algorithms for Distance Approximation and Spanners
Massively Parallel Algorithms for Distance Approximation and Spanners
Amartya Shankha Biswas
Michal Dory
M. Ghaffari
Slobodan Mitrović
Yasamin Nazari
46
20
0
02 Mar 2020
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and
  Beyond
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond
M. Ghaffari
Christoph Grunau
Ce Jin
47
30
0
22 Feb 2020
Equivalence Classes and Conditional Hardness in Massively Parallel
  Computations
Equivalence Classes and Conditional Hardness in Massively Parallel Computations
Danupon Nanongkai
Michele Scquizzato
61
18
0
07 Jan 2020
New lower bounds for Massively Parallel Computation from query
  complexity
New lower bounds for Massively Parallel Computation from query complexity
Moses Charikar
Weiyun Ma
Li-Yang Tan
39
1
0
05 Jan 2020
Graph Sparsification for Derandomizing Massively Parallel Computation
  with Low Space
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
A. Czumaj
Peter Davies
M. Parter
67
29
0
11 Dec 2019
Near-Optimal Massively Parallel Graph Connectivity
Near-Optimal Massively Parallel Graph Connectivity
Soheil Behnezhad
Laxman Dhulipala
Hossein Esfandiari
Jakub Lacki
Vahab Mirrokni
65
52
0
11 Oct 2019
Faster Algorithms for Edge Connectivity via Random $2$-Out Contractions
Faster Algorithms for Edge Connectivity via Random 222-Out Contractions
M. Ghaffari
Krzysztof Nowicki
M. Thorup
157
50
0
02 Sep 2019
Distributed Weighted Matching via Randomized Composable Coresets
Distributed Weighted Matching via Randomized Composable Coresets
Sepehr Assadi
M. Bateni
Vahab Mirrokni
37
8
0
05 Jun 2019
Dynamic Algorithms for the Massively Parallel Computation Model
Dynamic Algorithms for the Massively Parallel Computation Model
G. Italiano
Silvio Lattanzi
Vahab S. Mirrokni
Nikos Parotsidis
31
26
0
22 May 2019
Fast Approximate Shortest Paths in the Congested Clique
Fast Approximate Shortest Paths in the Congested Clique
K. Censor-Hillel
Michal Dory
Janne H. Korhonen
Dean Leitersdorf
56
54
0
14 Mar 2019
Exponentially Faster Massively Parallel Maximal Matching
Exponentially Faster Massively Parallel Maximal Matching
Soheil Behnezhad
Mohammadtaghi Hajiaghayi
David G. Harris
81
62
0
11 Jan 2019
Large-Scale Distributed Algorithms for Facility Location with Outliers
Large-Scale Distributed Algorithms for Facility Location with Outliers
Tanmay Inamdar
Shreyas Pai
Sriram V. Pemmaraju
19
7
0
15 Nov 2018
Weighted Matchings via Unweighted Augmentations
Weighted Matchings via Unweighted Augmentations
Buddhima Gamlath
S. Kale
Slobodan Mitrovic
William Yang Wang
59
66
0
07 Nov 2018
Connected Components at Scale via Local Contractions
Connected Components at Scale via Local Contractions
Jakub Lacki
Vahab Mirrokni
Michał Włodarczyk
63
18
0
27 Jul 2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear
  Space
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
Krzysztof Onak
60
30
0
23 Jul 2018
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal
  Matching
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching
Soheil Behnezhad
Mahsa Derakhshan
Mohammadtaghi Hajiaghayi
R. Karp
40
18
0
17 Jul 2018
Sparsifying Distributed Algorithms with Ramifications in Massively
  Parallel Computation and Centralized Local Computation
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
M. Ghaffari
Jara Uitto
56
103
0
17 Jul 2018
Massively Parallel Algorithms for Finding Well-Connected Components in
  Sparse Graphs
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
Sepehr Assadi
Xiaorui Sun
Omri Weinstein
52
58
0
08 May 2018
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive
  Graphs
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
Sepehr Assadi
M. Bateni
A. Bernstein
Vahab Mirrokni
Cliff Stein
54
124
0
08 Nov 2017
Round Compression for Parallel Matching Algorithms
Round Compression for Parallel Matching Algorithms
A. Czumaj
Jakub Lacki
Aleksander Madry
Slobodan Mitrovic
Krzysztof Onak
Piotr Sankowski
75
101
0
11 Jul 2017
1