This text provides an introduction to distributed local algorithms -- an area at the intersection of theoretical computer science and discrete mathematics. We collect recent results in the area and demonstrate how they lead to a clean theory. We also discuss many connections of local algorithms to fields such as parallel, distributed, and sublinear algorithms, or descriptive combinatorics.
@article{arxiv.2406.19430,
title = {Invitation to Local Algorithms},
author = {Václav Rozhoň},
journal= {arXiv preprint arXiv:2406.19430},
year = {2024}
}