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. 2002.08216
  4. Cited By
Truly Tight-in-$Δ$ Bounds for Bipartite Maximal Matching and
  Variants

Truly Tight-in-ΔΔΔ Bounds for Bipartite Maximal Matching and Variants

19 February 2020
S. Brandt
Dennis Olivetti
ArXiv (abs)PDFHTML

Papers citing "Truly Tight-in-$Δ$ Bounds for Bipartite Maximal Matching and Variants"

16 / 16 papers shown
Title
Distributed Quantum Advantage for Local Problems
Distributed Quantum Advantage for Local Problems
Alkida Balliu
S. Brandt
Xavier Coiteux-Roy
Francesco d’Amore
Massimo Equi
...
Dennis Olivetti
M. Renou
Jukka Suomela
Lucas Tendick
Isadora Veeren
36
5
0
05 Nov 2024
Tight Lower Bounds in the Supported LOCAL Model
Tight Lower Bounds in the Supported LOCAL Model
Alkida Balliu
Thomas Boudier
Sebastian Brandt
Dennis Olivetti
57
1
0
01 May 2024
Local certification of local properties: tight bounds, trade-offs and
  new parameters
Local certification of local properties: tight bounds, trade-offs and new parameters
Nicolas Bousquet
Laurent Feuilloley
Sébastien Zeitoun
49
7
0
21 Dec 2023
Fast Distributed Brooks' Theorem
Fast Distributed Brooks' Theorem
Manuela Fischer
Yannic Maus
Magnús M. Halldórsson
OOD
51
17
0
14 Nov 2022
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
62
8
0
03 Nov 2022
Distributed Edge Coloring in Time Polylogarithmic in $Δ$
Distributed Edge Coloring in Time Polylogarithmic in ΔΔΔ
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
49
18
0
02 Jun 2022
Deterministic Distributed algorithms and Descriptive Combinatorics on
  Δ-regular trees
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees
S. Brandt
Yi-Jun Chang
Jan Grebík
Christoph Grunau
Václav Rozhon
Zoltán Vidnyánszky
42
1
0
20 Apr 2022
Efficient Classification of Locally Checkable Problems in Regular Trees
Efficient Classification of Locally Checkable Problems in Regular Trees
Alkida Balliu
S. Brandt
Yi-Jun Chang
Dennis Olivetti
Jan Studený
Jukka Suomela
47
8
0
17 Feb 2022
Distributed $Δ$-Coloring Plays Hide-and-Seek
Distributed ΔΔΔ-Coloring Plays Hide-and-Seek
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
65
29
0
01 Oct 2021
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree
  Dominating Sets in Trees
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
42
18
0
04 Jun 2021
Local Problems on Trees from the Perspectives of Distributed Algorithms,
  Finitary Factors, and Descriptive Combinatorics
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
Sebastian Brandt
Yi-Jun Chang
Jan Grebík
Christoph Grunau
Václav Rozhon
Zoltán Vidnyánszky
35
28
0
03 Jun 2021
Distributed Graph Coloring Made Easy
Distributed Graph Coloring Made Easy
Yannic Maus
56
25
0
12 May 2021
Local Conflict Coloring Revisited: Linial for Lists
Local Conflict Coloring Revisited: Linial for Lists
Yannic Maus
Tigran Tonoyan
43
41
0
30 Jul 2020
Distributed Lower Bounds for Ruling Sets
Distributed Lower Bounds for Ruling Sets
Alkida Balliu
S. Brandt
Dennis Olivetti
49
41
0
17 Apr 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
53
44
0
29 Nov 2019
Lower bounds for maximal matchings and maximal independent sets
Lower bounds for maximal matchings and maximal independent sets
Alkida Balliu
S. Brandt
J. Hirvonen
Dennis Olivetti
Mikael Rabie
Jukka Suomela
FedML
55
98
0
08 Jan 2019
1