Brief Announcement: Is a LOCAL Algorithm Computable?
Open Access
- 6 July 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 321-324
Abstract
No abstract availableFunding Information
- Research Council of Finland (359104)
- Research Council of Finland (363558)
This publication has 21 references indexed in Scilit:
- Almost global problems in the LOCAL modelDistributed Computing, 2020
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL ModelSIAM Journal on Computing, 2019
- A Time Hierarchy Theorem for the LOCAL ModelSIAM Journal on Computing, 2019
- On Derandomizing Local Distributed Algorithms2018
- What can be decided locally without identifiers?2013
- What Can Be Observed Locally?2009
- What Can be Computed Locally?SIAM Journal on Computing, 1995
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- A Lower Bound on Probabilistic Algorithms for Distributive Ring ColoringSIAM Journal on Discrete Mathematics, 1991
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986