Type: Preprint
Publication Date: 2024-06-27
Citations: 0
DOI: https://doi.org/10.48550/arxiv.2406.19430
This text provides an introduction to the field of distributed local algorithms -- an area at the intersection of theoretical computer science and discrete mathematics. We collect many recent results in the area and demonstrate how they lead to a clean theory. We also discuss many connections of local algorithms to areas such as parallel, distributed, and sublinear algorithms, or descriptive combinatorics.
Action | Title | Year | Authors |
---|
Action | Title | Year | Authors |
---|