The Role of Randomness in Local Distributed Graph Problems
Yannic Maus explores the fundamental implications of randomness in local distributed graph problems, analyzing its role in algorithm design and complexity bounds.
Theory & AlgosAlgorithms & Data StructuresComputational Complexitydistributed algorithmsgraph theory
Theory-Fest 2019-2020: Fine-Grained Complexity
Comments
Add a comment...Sign in