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
v1v2v3v4v5v6 (latest)

Exponentially Faster Massively Parallel Maximal Matching

11 January 2019
Soheil Behnezhad
Mohammadtaghi Hajiaghayi
David G. Harris
ArXiv (abs)PDFHTML

Papers citing "Exponentially Faster Massively Parallel Maximal Matching"

14 / 14 papers shown
Title
Massively Parallel Algorithms for $b$-Matching
Massively Parallel Algorithms for bbb-Matching
M. Ghaffari
Christoph Grunau
Slobodan Mitrovic
FedML
41
7
0
14 Nov 2022
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
57
28
0
07 May 2022
A Push-Relabel Based Additive Approximation for Optimal Transport
A Push-Relabel Based Additive Approximation for Optimal Transport
Nathaniel Lahn
S. Raghvendra
Kaiyi Zhang
OT
19
1
0
07 Mar 2022
Deterministic Massively Parallel Connectivity
Deterministic Massively Parallel Connectivity
Samantha R. Coy
A. Czumaj
81
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
55
24
0
03 Jun 2021
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
58
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
52
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
82
29
0
11 Dec 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
Weighted Matchings via Unweighted Augmentations
Weighted Matchings via Unweighted Augmentations
Buddhima Gamlath
S. Kale
Slobodan Mitrovic
William Yang Wang
61
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
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
77
101
0
11 Jul 2017
1