Locality in online, dynamic, sequential, and distributed graph algorithms

DOI10.4230/LIPICS.ICALP.2023.10MaRDI QIDQ6638001zbMATH OpenFDO

Authors Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi, Jukka Suomela

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.10

zbMATH Keywords

computational complexitydistributed algorithmsonline computationspatial advice

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(3)

• The distributed complexity of locally checkable labeling problems beyond paths and trees
• A tight lower bound for 3-coloring grids in the online-LOCAL model
• Shared randomness helps with local distributed problems

This page was built for publication: Locality in online, dynamic, sequential, and distributed graph algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638001)