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. 2206.01568
  4. Cited By
Improved Deterministic Connectivity in Massively Parallel Computation
v1v2 (latest)

Improved Deterministic Connectivity in Massively Parallel Computation

3 June 2022
Manuela Fischer
Jeff Giliberti
Christoph Grunau
ArXiv (abs)PDFHTML

Papers citing "Improved Deterministic Connectivity in Massively Parallel Computation"

16 / 16 papers shown
Title
Deterministic Massively Parallel Connectivity
Deterministic Massively Parallel Connectivity
Samantha R. Coy
A. Czumaj
58
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
23
0
03 Jun 2021
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
A. Czumaj
Peter Davies
M. Parter
131
23
0
13 Sep 2020
Connected Components on a PRAM in Log Diameter Time
Connected Components on a PRAM in Log Diameter Time
S. Liu
R. Tarjan
Peilin Zhong
44
9
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
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
62
29
0
11 Dec 2019
A Deterministic Algorithm for the MST Problem in Constant Rounds of
  Congested Clique
A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique
Krzysztof Nowicki
45
36
0
09 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
Connected Components at Scale via Local Contractions
Connected Components at Scale via Local Contractions
Jakub Lacki
Vahab Mirrokni
Michał Włodarczyk
58
18
0
27 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
54
103
0
17 Jul 2018
Parallel Graph Connectivity in Log Diameter Rounds
Parallel Graph Connectivity in Log Diameter Rounds
Alexandr Andoni
C. Stein
Zhao Song
Zhengyu Wang
Peilin Zhong
53
99
0
08 May 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
47
58
0
08 May 2018
MST in O(1) Rounds of the Congested Clique
MST in O(1) Rounds of the Congested Clique
T. Jurdzinski
Krzysztof Nowicki
LRM
49
92
0
26 Jul 2017
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
K. Censor-Hillel
M. Parter
Gregory Schwartzman
63
75
0
04 Aug 2016
Sorting, Searching, and Simulation in the MapReduce Framework
Sorting, Searching, and Simulation in the MapReduce Framework
M. Goodrich
Nodari Sitchinava
Qin Zhang
88
250
0
10 Jan 2011
1