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. 1202.3205
  4. Cited By
Greedy Sequential Maximal Independent Set and Matching are Parallel on
  Average

Greedy Sequential Maximal Independent Set and Matching are Parallel on Average

15 February 2012
G. Blelloch
Jeremy T. Fineman
Julian Shun
ArXiv (abs)PDFHTML

Papers citing "Greedy Sequential Maximal Independent Set and Matching are Parallel on Average"

27 / 27 papers shown
Title
Breaking 3-Factor Approximation for Correlation Clustering in
  Polylogarithmic Rounds
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds
Nairen Cao
Shang-En Huang
Hsin-Hao Su
61
8
0
13 Jul 2023
Massively Parallel Algorithms for the Stochastic Block Model
Massively Parallel Algorithms for the Stochastic Block Model
Zelin Li
Pan Peng
Xianbin Zhu
45
1
0
02 Jul 2023
Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!
Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!
Sayak Chakrabarty
K. Makarychev
81
16
0
23 May 2023
Average Awake Complexity of MIS and Matching
Average Awake Complexity of MIS and Matching
M. Ghaffari
Julian Portmann
51
13
0
10 May 2023
Provably-Efficient and Internally-Deterministic Parallel Union-Find
Provably-Efficient and Internally-Deterministic Parallel Union-Find
Alexander Fedorov
Diba Hashemi
Giorgi Nadiradze
Dan Alistarh
FedML
62
2
0
18 Apr 2023
Massively Parallel Computation in a Heterogeneous Regime
Massively Parallel Computation in a Heterogeneous Regime
Orr Fischer
A. Horowitz
R. Oshman
61
2
0
28 Feb 2023
Õptimal Vertex Fault-Tolerant Spanners in Õptimal Time:
  Sequential, Distributed and Parallel
Õptimal Vertex Fault-Tolerant Spanners in Õptimal Time: Sequential, Distributed and Parallel
M. Parter
LRM
62
3
0
07 Sep 2022
Parallel Longest Increasing Subsequence and van Emde Boas Trees
Parallel Longest Increasing Subsequence and van Emde Boas Trees
Yan Gu
Ziyang Men
Zheqi Shen
Yihan Sun
Zijin Wan
66
11
0
21 Aug 2022
Generalizing Downsampling from Regular Data to Graphs
Generalizing Downsampling from Regular Data to Graphs
D. Bacciu
A. Conte
Francesco Landolfi
47
9
0
06 Aug 2022
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly)
  Work-efficient
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
Zheqi Shen
Zijin Wan
Yan Gu
Yihan Sun
62
12
0
25 May 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
Distributed MIS in $O(\log\log{n} )$ Awake Complexity
Distributed MIS in O(log⁡log⁡n)O(\log\log{n} )O(loglogn) Awake Complexity
Fabien Dufoulon
W. Moses
Gopal Pandurangan
68
12
0
18 Apr 2022
Concurrent CPU-GPU Task Programming using Modern C++
Concurrent CPU-GPU Task Programming using Modern C++
Tsung-Wei Huang
Yibo Lin
13
6
0
16 Mar 2022
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
Soheil Behnezhad
50
32
0
05 Jun 2021
Can We Break Symmetry with o(m) Communication?
Can We Break Symmetry with o(m) Communication?
Shreyas Pai
Gopal Pandurangan
Sriram V. Pemmaraju
Peter Robinson
LRM
70
9
0
19 May 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
53
15
0
23 Feb 2021
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets
  Practice
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
Soheil Behnezhad
Laxman Dhulipala
Hossein Esfandiari
Jakub Lacki
Vahab Mirrokni
W. Schudy
64
13
0
24 Sep 2020
Sleeping is Efficient: MIS in $O(1)$-rounds Node-averaged Awake
  Complexity
Sleeping is Efficient: MIS in O(1)O(1)O(1)-rounds Node-averaged Awake Complexity
Soumyottam Chatterjee
R. Gmyr
Gopal Pandurangan
65
34
0
12 Jun 2020
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed
  Schedulers
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers
Dan Alistarh
N. Koval
Giorgi Nadiradze
49
6
0
20 Mar 2020
Relaxed Scheduling for Scalable Belief Propagation
Relaxed Scheduling for Scalable Belief Propagation
Vitaly Aksenov
Dan Alistarh
Janne H. Korhonen
42
5
0
25 Feb 2020
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
73
28
0
18 May 2019
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and
  Scalable
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala
G. Blelloch
Julian Shun
GNN
100
150
0
14 May 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching,
  and Vertex Cover
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
M. Ghaffari
Themis Gouleakis
Christian Konrad
Slobodan Mitrovic
R. Rubinfeld
98
132
0
22 Feb 2018
Parallel Correlation Clustering on Big Graphs
Parallel Correlation Clustering on Big Graphs
Xinghao Pan
Dimitris Papailiopoulos
Samet Oymak
Benjamin Recht
Kannan Ramchandran
Michael I. Jordan
90
85
0
17 Jul 2015
Optimal Dynamic Distributed MIS
Optimal Dynamic Distributed MIS
K. Censor-Hillel
Elad Haramaty
Zohar Karnin
77
54
0
15 Jul 2015
Scalable Facility Location for Massive Graphs on Pregel-like Systems
Scalable Facility Location for Massive Graphs on Pregel-like Systems
Venkata Rama Kiran Garimella
G. D. F. Morales
Aristides Gionis
Mauro Sozio
GNN
41
8
0
12 Mar 2015
Efficient Parallel and External Matching
Efficient Parallel and External Matching
M. Birn
Vitaly Osipov
Peter Sanders
Christian Schulz
Nodari Sitchinava
78
29
0
19 Feb 2013
1