Hao Wu

activity

20232025

most citedAn Improved Composition Theorem of a Universal Relation and Most Functions via Effective Restriction

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

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.CR2024★ 1 cited

Faster Differentially Private Top- $k$ Selection: A Joint Exponential Mechanism with Pruning

Hao WU, Hanwen Zhang

We study the differentially private top- $k$ selection problem, aiming to identify a sequence of $k$ items with approximately the highest scores from $d$ items. Recent work by Gille…

cs.CC2024

A nearly- $4 lo g n$ depth lower bound for formulas with restriction on top

Hao Wu

One of the major open problems in complexity theory is to demonstrate an explicit function which requires super logarithmic depth, a.k.a, the $P$ versus $N C^{1}$ pr…

Faster Differentially Private Top-k Selection: A Joint Exponential Mechanism with Pruning

A nearly-4logn depth lower bound for formulas with restriction on top

Faster Differentially Private Top- $k$ Selection: A Joint Exponential Mechanism with Pruning

A nearly- $4 lo g n$ depth lower bound for formulas with restriction on top