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. 2112.09479
  4. Cited By
Towards a Complexity Classification of LCL Problems in Massively
  Parallel Computation

Towards a Complexity Classification of LCL Problems in Massively Parallel Computation

17 December 2021
S. Brandt
R. Latypov
Jara Uitto
ArXivPDFHTML

Papers citing "Towards a Complexity Classification of LCL Problems in Massively Parallel Computation"

1 / 1 papers shown
Title
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
35
24
0
18 Feb 2021
1