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. 1902.06803
  4. Cited By
How much does randomness help with locally checkable problems?

How much does randomness help with locally checkable problems?

18 February 2019
Alkida Balliu
S. Brandt
Dennis Olivetti
Jukka Suomela
ArXivPDFHTML

Papers citing "How much does randomness help with locally checkable problems?"

3 / 3 papers shown
Title
The Distributed Complexity of Locally Checkable Labeling Problems Beyond
  Paths and Trees
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees
Yi-Jun Chang
59
1
0
12 Nov 2023
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based
  Full-Information Models
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models
P. Bastide
Pierre Fraigniaud
LRM
21
1
0
04 Aug 2021
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
1