most citedBalanced Bidirectional Breadth-First Search on Scale-Free Networks

1 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2025

Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations

Bernhard Haeupler, Marc Kaufmann, Raghu Raman Ravi +1

This paper presents gossip algorithms for aggregation tasks that demonstrate both robustness to adversarial corruptions of any order of magnitude and optimality across a substantia…