Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction
Peter Robinson, Ming Ming Tan
We present the first polynomial lower bounds for several fundamental problems in the distributed graph sketching model in the tiny-error regime, which includes deterministic algori…
quant-ph2026
The Quantum Message Complexity of Distributed Wake-Up with Advice
Peter Robinson, Ming Ming Tan
We consider the distributed wake-up problem with advice, where nodes are equipped with initial knowledge about the network at large. After the adversary awakens a subset of nodes,…