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. 1901.03744
  4. Cited By
Exponentially Faster Massively Parallel Maximal Matching

Exponentially Faster Massively Parallel Maximal Matching

11 January 2019
Soheil Behnezhad
Mohammadtaghi Hajiaghayi
David G. Harris
ArXivPDFHTML

Papers citing "Exponentially Faster Massively Parallel Maximal Matching"

9 / 9 papers shown
Title
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
Almost 3-Approximate Correlation Clustering in Constant Rounds
Almost 3-Approximate Correlation Clustering in Constant Rounds
Soheil Behnezhad
Moses Charikar
Weiyun Ma
Li-Yang Tan
40
26
0
07 May 2022
Deterministic Massively Parallel Connectivity
Deterministic Massively Parallel Connectivity
Samantha R. Coy
A. Czumaj
32
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
21
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
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
21
28
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
24
18
0
07 Jan 2020
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 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