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
ArXivPDFHTML

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

21 / 21 papers shown
Title
Conditionally Optimal Parallel Coloring of Forests
Conditionally Optimal Parallel Coloring of Forests
Christoph Grunau
R. Latypov
Yannic Maus
Shreyas Pai
Jara Uitto
28
1
0
01 Aug 2023
Agnostic proper learning of monotone functions: beyond the black-box
  correction barrier
Agnostic proper learning of monotone functions: beyond the black-box correction barrier
Jane Lange
Arsen Vasilyan
32
5
0
05 Apr 2023
Massively Parallel Computation in a Heterogeneous Regime
Massively Parallel Computation in a Heterogeneous Regime
Orr Fischer
A. Horowitz
R. Oshman
36
2
0
28 Feb 2023
Adaptive Massively Parallel Connectivity in Optimal Space
Adaptive Massively Parallel Connectivity in Optimal Space
R. Latypov
J. Łącki
Yannic Maus
Jara Uitto
25
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
21
4
0
26 Jan 2023
Optimal Deterministic Massively Parallel Connectivity on Forests
Optimal Deterministic Massively Parallel Connectivity on Forests
Alkida Balliu
R. Latypov
Yannic Maus
Dennis Olivetti
Jara Uitto
30
5
0
07 Nov 2022
Improved Deterministic Connectivity in Massively Parallel Computation
Improved Deterministic Connectivity in Massively Parallel Computation
Manuela Fischer
Jeff Giliberti
Christoph Grunau
25
4
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
19
20
0
10 Dec 2021
Deterministic Massively Parallel Connectivity
Deterministic Massively Parallel Connectivity
Samantha R. Coy
A. Czumaj
29
17
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
19
22
0
03 Jun 2021
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC
  Model
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model
Kishore Kothapalli
Shreyas Pai
Sriram V. Pemmaraju
39
8
0
26 Sep 2020
Black-box Methods for Restoring Monotonicity
Black-box Methods for Restoring Monotonicity
Evangelia Gergatsouli
Brendan Lucier
Christos Tzamos
16
3
0
21 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
19
28
0
22 Feb 2020
Distributed Maximum Matching Verification in CONGEST
Distributed Maximum Matching Verification in CONGEST
Mohamad Ahmadi
Fabian Kuhn
29
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
21
18
0
07 Jan 2020
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
11
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
24
52
0
11 Oct 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
21
28
0
18 May 2019
Weighted Matchings via Unweighted Augmentations
Weighted Matchings via Unweighted Augmentations
Buddhima Gamlath
S. Kale
Slobodan Mitrovic
William Yang Wang
24
66
0
07 Nov 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
18
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
22
58
0
08 May 2018
1