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. 2106.02440
  4. Cited By
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

4 June 2021
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
ArXiv (abs)PDFHTML

Papers citing "Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees"

12 / 12 papers shown
Title
Distributed weak independent sets in hypergraphs: Upper and lower bounds
Distributed weak independent sets in hypergraphs: Upper and lower bounds
Duncan Adamson
Will Rosenbaum
Paul G. Spirakis
189
0
0
20 Nov 2024
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
26
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
47
1
0
01 May 2024
Fast Distributed Brooks' Theorem
Fast Distributed Brooks' Theorem
Manuela Fischer
Yannic Maus
Magnús M. Halldórsson
OOD
41
17
0
14 Nov 2022
Optimal Deterministic Massively Parallel Connectivity on Forests
Optimal Deterministic Massively Parallel Connectivity on Forests
Alkida Balliu
R. Latypov
Yannic Maus
Dennis Olivetti
Jara Uitto
57
5
0
07 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
60
8
0
03 Nov 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
32
1
0
20 Apr 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
47
12
0
18 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
35
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
54
29
0
01 Oct 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
33
28
0
03 Jun 2021
Locally Checkable Labelings with Small Messages
Locally Checkable Labelings with Small Messages
Alkida Balliu
K. Censor-Hillel
Yannic Maus
Dennis Olivetti
Jukka Suomela
30
16
0
12 May 2021
1