Brandt Lab

Research focus

ERC Starting Grant · 2024

Optimal Local Algorithms via Topology-Sensitivity

Considering the rapid growth of data sets and network sizes over the past decade, there is little doubt that the future of computation is distributed. One central aspect lying at the heart of distributed algorithms is the question of locality: what can be computed using only local information, and how much information is needed? While answering this question is essential for obtaining highly efficient algorithms for many important distributed problems—such as load balancing in massive networks—, locality is a fundamentally important concept also in many other fields of algorithmics, such as classical sequential algorithms, massively parallel algorithms, dynamic algorithms, sublinear…

From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.