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. 1807.06251
  4. Cited By
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

17 July 2018
M. Ghaffari
Jara Uitto
ArXiv (abs)PDFHTML

Papers citing "Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation"

31 / 31 papers shown
Title
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Yi-Jun Chang
Danling Zheng
84
1
0
15 Apr 2023
Distributed Symmetry Breaking on Power Graphs via Sparsification
Distributed Symmetry Breaking on Power Graphs via Sparsification
Yannic Maus
Saku Peltonen
Jara Uitto
63
11
0
14 Feb 2023
Adaptive Massively Parallel Connectivity in Optimal Space
Adaptive Massively Parallel Connectivity in Optimal Space
R. Latypov
J. Łącki
Yannic Maus
Jara Uitto
54
0
0
08 Feb 2023
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs
Manuela Fischer
Jeff Giliberti
Christoph Grunau
66
5
0
26 Jan 2023
Massively Parallel Algorithms for $b$-Matching
Massively Parallel Algorithms for bbb-Matching
M. Ghaffari
Christoph Grunau
Slobodan Mitrovic
FedML
44
7
0
14 Nov 2022
Exponential Speedup Over Locality in MPC with Optimal Memory
Exponential Speedup Over Locality in MPC with Optimal Memory
Alkida Balliu
S. Brandt
Manuela Fischer
R. Latypov
Yannic Maus
Dennis Olivetti
Jara Uitto
59
5
0
19 Aug 2022
Improved Deterministic Connectivity in Massively Parallel Computation
Improved Deterministic Connectivity in Massively Parallel Computation
Manuela Fischer
Jeff Giliberti
Christoph Grunau
70
5
0
03 Jun 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
56
21
0
10 Dec 2021
Deterministic Massively Parallel Connectivity
Deterministic Massively Parallel Connectivity
Samantha R. Coy
A. Czumaj
81
18
0
09 Aug 2021
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
Soheil Behnezhad
31
32
0
05 Jun 2021
Component Stability in Low-Space Massively Parallel Computation
Component Stability in Low-Space Massively Parallel Computation
A. Czumaj
Peter Davies
M. Parter
61
24
0
03 Jun 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
50
15
0
23 Feb 2021
Black-box Methods for Restoring Monotonicity
Black-box Methods for Restoring Monotonicity
Evangelia Gergatsouli
Brendan Lucier
Christos Tzamos
39
3
0
21 Mar 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
76
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
62
30
0
22 Feb 2020
Distributed Maximum Matching Verification in CONGEST
Distributed Maximum Matching Verification in CONGEST
Mohamad Ahmadi
Fabian Kuhn
62
7
0
18 Feb 2020
Equivalence Classes and Conditional Hardness in Massively Parallel
  Computations
Equivalence Classes and Conditional Hardness in Massively Parallel Computations
Danupon Nanongkai
Michele Scquizzato
62
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
83
29
0
11 Dec 2019
Improved Local Computation Algorithm for Set Cover via Sparsification
Improved Local Computation Algorithm for Set Cover via Sparsification
Christoph Grunau
Slobodan Mitrovic
R. Rubinfeld
A. Vakilian
LRM
39
9
0
30 Oct 2019
Near-Optimal Massively Parallel Graph Connectivity
Near-Optimal Massively Parallel Graph Connectivity
Soheil Behnezhad
Laxman Dhulipala
Hossein Esfandiari
Jakub Lacki
Vahab Mirrokni
72
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
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Will Rosenbaum
Jukka Suomela
53
15
0
18 Jul 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
41
26
0
22 May 2019
Massively Parallel Computation via Remote Memory Access
Massively Parallel Computation via Remote Memory Access
Soheil Behnezhad
Laxman Dhulipala
Hossein Esfandiari
Jakub Lacki
W. Schudy
Vahab Mirrokni
70
28
0
18 May 2019
Exponentially Faster Massively Parallel Maximal Matching
Exponentially Faster Massively Parallel Maximal Matching
Soheil Behnezhad
Mohammadtaghi Hajiaghayi
David G. Harris
97
62
0
11 Jan 2019
Weighted Matchings via Unweighted Augmentations
Weighted Matchings via Unweighted Augmentations
Buddhima Gamlath
S. Kale
Slobodan Mitrovic
William Yang Wang
64
66
0
07 Nov 2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear
  Space
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
Krzysztof Onak
62
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
49
18
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
54
58
0
08 May 2018
Round Compression for Parallel Matching Algorithms
Round Compression for Parallel Matching Algorithms
A. Czumaj
Jakub Lacki
Aleksander Madry
Slobodan Mitrovic
Krzysztof Onak
Piotr Sankowski
82
101
0
11 Jul 2017
1