Invitation to Local Algorithms
<|reference_start|>Invitation to Local Algorithms: 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.<|reference_end|>
@article{rozhoň2024invitation,
    title={Invitation to Local Algorithms},
    author={V'aclav Rozhov{n}},
    journal={arXiv preprint arXiv:2406.19430},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.19430},
    primaryClass={cs.DC cs.DS math.CO}
}