Henrik Lievonen

Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms

2021 · arXiv (Cornell University)

In this work, we give a unifying view of locality in four settings: distributed algorithms, sequential greedy algorithms, dynamic algorithms, and online algorithms. We introduce a new model of computing, called the online-LOCAL model: the …

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs

2025 · arXiv (Cornell University)

In this work, we give two results that put new limits on distributed quantum advantage in the context of the LOCAL model of distributed computing: 1) We show that there is no distributed quantum advantage …