Yinzhan Xu
5 papers · 2022–2026 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
🌍
Conference Polyglot · Bronze
🌉
Interdisciplinary Bridge · Silver
Top co-authors
Research topics
Keywords
noisy query model
(2)
total influence
(2)
query complexity
(2)
graph connectivity
(1)
boolean function
(1)
lower bound
(1)
graph reconstruction
(1)
multiwinner voting
(1)
connected component
(1)
multiplicative error
(1)
additive error
(1)
counting problem
(1)
single-peaked preference
(1)
boolean hypercube
(1)
thiele rule
(1)
differentially private
(1)
adaptive queries
(1)
induced subgraph
(1)
high-influence functions
(1)
k-threshold problem
(1)
Papers
A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions
COLT 2026
Breaking the $n^1.5$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
ICML 2025
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
COLT 2025
Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold
COLT 2025
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules
IJCAI 2022