research
∙
07/13/2023
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds
In this paper, we study parallel algorithms for the correlation clusteri...
share
research
∙
12/29/2022
(1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings
The maximum weighted matching (MWM) problem is one of the most well-stud...
research
∙
07/08/2022
Vertex Sparsifiers for Hyperedge Connectivity
Recently, Chalermsook et al. [SODA'21(arXiv:2007.07862)] introduces a no...
research
∙
06/30/2022
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
Since the mid-1980s it has been known that Byzantine Agreement can be so...
research
∙
02/27/2022
Byzantine Agreement in Polynomial Time with Near-Optimal Resilience
It has been known since the early 1980s that Byzantine Agreement in the ...
research
∙
02/17/2018