1 citations · 1 across the 6 of their papers we have counts for
6 papers
Tight Data Access Bounds for Private Top- Selection
Hao Wu, Olga Ohrimenko, Anthony Wirth
We study the top- selection problem under the differential privacy model: items are rated according to votes of a set of clients. We consider a setting in which algorithms c…
Direct Sum Theorems From Fortification
Hao Wu
We revisit the direct sum questions in communication complexity which asks whether the resource needed to solve communication problems together is (approximately) the sum of re…
Dynamic Structural Clustering on Graphs
Boyu Ruan, Junhao Gan, Hao Wu +1
Structural Clustering () is one of the most popular graph clustering paradigms. In this paper, we consider under two commonly adapted similarities, namely Jaccard…
Asymptotically Optimal Locally Private Heavy Hitters via Parameterized Sketches
Hao Wu, Anthony Wirth
We present two new local differentially private algorithms for frequency estimation. One solves the fundamental frequency oracle problem; the other solves the well-known heavy hitt…
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push
Hao Wu, Junhao Gan, Zhewei Wei +1
Personalized PageRank (PPR) is a critical measure of the importance of a node t to a source node s in a graph. The Single-Source PPR (SSPPR) query computes the PPR's of all the nod…
Learning Based Distributed Tracking
Hao Wu, Junhao Gan, Rui Zhang
Inspired by the great success of machine learning in the past decade, people have been thinking about the possibility of improving the theoretical results by exploring data distrib…