research
∙
11/09/2022
Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time
The problem of finding the degeneracy of a graph is a subproblem of the ...
share
research
∙
05/17/2022
Bankrupting DoS Attackers Despite Uncertainty
On-demand provisioning in the cloud allows for services to remain availa...
research
∙
04/27/2021
Communication Costs in a Geometric Communication Network
A communication network is a graph in which each node has only local inf...
research
∙
09/24/2019
Random k-out subgraph leaves only O(n/k) inter-component edges
Each vertex of an arbitrary simple graph on n vertices chooses k random ...
research
∙
07/28/2019
Faster asynchronous MST and low diameter tree construction with sublinear communication
Building a spanning tree, minimum spanning tree (MST), and BFS tree in a...
research
∙
07/24/2019
Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols
Motivated, in part, by the rise of permissionless systems such as Bitcoi...
research
∙
12/25/2018
Correction to Byzantine Agreement in Expected Polynomial Time, JACM 2016
This is a brief correction by the authors to "Byzantine Agreement in Exp...
research
∙
06/12/2018
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
We provide the first asynchronous distributed algorithms to compute broa...
research
∙
04/15/2018