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. 2308.04251
  4. Cited By
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
v1v2 (latest)

On the Node-Averaged Complexity of Locally Checkable Problems on Trees

8 August 2023
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
Gustav Schmid
ArXiv (abs)PDFHTML

Papers citing "On the Node-Averaged Complexity of Locally Checkable Problems on Trees"

2 / 2 papers shown
Title
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic
  Energy Cost
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
Alkida Balliu
Pierre Fraigniaud
Dennis Olivetti
Mikael Rabie
63
0
0
27 Oct 2024
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
76
2
0
12 Nov 2023
1