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. 1811.01643
  4. Cited By
Hardness of minimal symmetry breaking in distributed computing

Hardness of minimal symmetry breaking in distributed computing

5 November 2018
Alkida Balliu
J. Hirvonen
Dennis Olivetti
Jukka Suomela
ArXivPDFHTML

Papers citing "Hardness of minimal symmetry breaking in distributed computing"

5 / 5 papers shown
Title
The Landscape of Distributed Complexities on Trees and Beyond
The Landscape of Distributed Complexities on Trees and Beyond
Christoph Grunau
Václav Rozhon
S. Brandt
30
18
0
09 Feb 2022
Locally Checkable Problems in Rooted Trees
Locally Checkable Problems in Rooted Trees
Alkida Balliu
S. Brandt
Yi-Jun Chang
Dennis Olivetti
Jan Studený
Jukka Suomela
A. Tereshchenko
40
24
0
18 Feb 2021
Truly Tight-in-$Δ$ Bounds for Bipartite Maximal Matching and
  Variants
Truly Tight-in-ΔΔΔ Bounds for Bipartite Maximal Matching and Variants
S. Brandt
Dennis Olivetti
15
24
0
19 Feb 2020
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
20
93
0
08 Jan 2019
Exact bounds for distributed graph colouring
Exact bounds for distributed graph colouring
Joel Rybicki
Jukka Suomela
114
12
0
17 Feb 2015
1