Invitation to Local Algorithms
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910706477039616 |
|---|---|
| author | Rozhoň, Václav |
| author_facet | Rozhoň, Václav |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_19430 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Invitation to Local Algorithms Rozhoň, Václav Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Combinatorics 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. |
| title | Invitation to Local Algorithms |
| topic | Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Combinatorics |
| url | https://arxiv.org/abs/2406.19430 |