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.02441
  4. Cited By
Lower bounds for maximal matchings and maximal independent sets
v1v2v3 (latest)

Lower bounds for maximal matchings and maximal independent sets

8 January 2019
Alkida Balliu
S. Brandt
J. Hirvonen
Dennis Olivetti
Mikael Rabie
Jukka Suomela
    FedML
ArXiv (abs)PDFHTML

Papers citing "Lower bounds for maximal matchings and maximal independent sets"

16 / 16 papers shown
Title
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
50
34
0
12 Jun 2020
Distributed Lower Bounds for Ruling Sets
Distributed Lower Bounds for Ruling Sets
Alkida Balliu
S. Brandt
Dennis Olivetti
26
38
0
17 Apr 2020
Truly Tight-in-$Δ$ Bounds for Bipartite Maximal Matching and
  Variants
Truly Tight-in-ΔΔΔ Bounds for Bipartite Maximal Matching and Variants
S. Brandt
Dennis Olivetti
37
26
0
19 Feb 2020
A Breezing Proof of the KMW Bound
A Breezing Proof of the KMW Bound
Corinna Coupette
Christoph Lenzen
49
4
0
14 Feb 2020
Classification of distributed binary labeling problems
Classification of distributed binary labeling problems
Alkida Balliu
S. Brandt
Yuval Efron
J. Hirvonen
Yannic Maus
Dennis Olivetti
Jukka Suomela
39
44
0
29 Nov 2019
Polylogarithmic-Time Deterministic Network Decomposition and Distributed
  Derandomization
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization
Václav Rozhon
M. Ghaffari
OOD
35
196
0
25 Jul 2019
An Automatic Speedup Theorem for Distributed Problems
An Automatic Speedup Theorem for Distributed Problems
S. Brandt
20
56
0
26 Feb 2019
Hardness of minimal symmetry breaking in distributed computing
Hardness of minimal symmetry breaking in distributed computing
Alkida Balliu
J. Hirvonen
Dennis Olivetti
Jukka Suomela
59
32
0
05 Nov 2018
The Complexity of Distributed Edge Coloring with Small Palettes
The Complexity of Distributed Edge Coloring with Small Palettes
Yi-Jun Chang
Qizheng He
Wenzheng Li
Seth Pettie
Jara Uitto
114
50
0
14 Aug 2017
An Exponential Separation Between Randomized and Deterministic
  Complexity in the LOCAL Model
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
Yi-Jun Chang
T. Kopelowitz
Seth Pettie
94
166
0
26 Feb 2016
Local Conflict Coloring
Local Conflict Coloring
Pierre Fraigniaud
Marc Heinrich
A. Kosowski
43
136
0
04 Nov 2015
A Lower Bound for the Distributed Lovász Local Lemma
A Lower Bound for the Distributed Lovász Local Lemma
S. Brandt
Orr Fischer
J. Hirvonen
Barbara Keller
Tuomo Lempiäinen
Joel Rybicki
Jukka Suomela
Jara Uitto
52
133
0
03 Nov 2015
Linear-in-$Δ$ Lower Bounds in the LOCAL Model
Linear-in-ΔΔΔ Lower Bounds in the LOCAL Model
Mika Göös
J. Hirvonen
Jukka Suomela
FedML
109
16
0
03 Apr 2013
The Locality of Distributed Symmetry Breaking
The Locality of Distributed Symmetry Breaking
Leonid Barenboim
Michael Elkin
Seth Pettie
Johannes Schneider
83
298
0
09 Feb 2012
Distributed Maximal Matching: Greedy is Optimal
Distributed Maximal Matching: Greedy is Optimal
J. Hirvonen
Jukka Suomela
72
22
0
03 Oct 2011
Local Computation: Lower and Upper Bounds
Local Computation: Lower and Upper Bounds
Fabian Kuhn
Thomas Moscibroda
Roger Wattenhofer
83
100
0
24 Nov 2010
1