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. 2312.01384
  4. Cited By
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model

3 December 2023
Yi-Jun Chang
Gopinath Mishra
Hung Thuan Nguyen
Mingyang Yang
Yu-Cheng Yeh
ArXivPDFHTML

Papers citing "A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model"

2 / 2 papers shown
Title
Locality in online, dynamic, sequential, and distributed graph
  algorithms
Locality in online, dynamic, sequential, and distributed graph algorithms
Amir Akbari
N. Eslami
Henrik Lievonen
Darya Melnyk
Joona Särkijärvi
Jukka Suomela
35
7
0
14 Sep 2021
A Time Hierarchy Theorem for the LOCAL Model
A Time Hierarchy Theorem for the LOCAL Model
Yi-Jun Chang
Seth Pettie
40
96
0
20 Apr 2017
1