1. [4] Brandt, S. , Chang, Y.-J. , Grebík, J. , Grunau, C. , Rozhoň, V. , and Vidnyánszky, Z. , Local problems on trees from the perspectives of distributed algorithms, finitary factors, and descriptive combinatorics, 13th Innovation in Theoretical Computer Science Conference (ITCSC), vol. 215 (M. Braverman, editor), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI), Germany, 2022, pp. 29:1–29:26.
2. An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
3. Locality in Distributed Graph Algorithms
4. [2] Bernshteyn, A. , Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms. Advances in Mathematics, vol. 415 (2023), Article no. 108895.
5. The Effective Version of Brooks' Theorem