Almost global problems in the LOCAL model
Work
Year: 2020
Type: article
Abstract: The landscape of the distributed time complexity is nowadays well-understood for subpolynomial complexities. When we look at deterministic algorithms in the $$\mathsf {LOCAL}$$ <mml:math xmlns:mml="h... more
Source: Distributed Computing
Institutions Aalto University, ETH Zurich
Cites: 29
Cited by: 7
Related to: 10
FWCI: 0.455
Citation percentile (by year/subfield): 74.66
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $3,090
Funder Academy of Finland
Grant ID 285721