1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2024★ 1 cited
Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
Monika Henzinger, A. R. Sricharan, Leqi Zhu
Computing the core decomposition of a graph is a fundamental problem that has recently been studied in the differentially private setting, motivated by practical applications in da…
cs.DC2022
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
Shang-En Huang, Seth Pettie, Leqi Zhu
Since the mid-1980s it has been known that Byzantine Agreement can be solved with probability 1 asynchronously, even against an omniscient, computationally unbounded adversary that…