William T. Tutte Postdoctoral Fellow
Cheriton School of Computer Science
University of Waterloo
Email: wuhao.wu.jiang [@] gmail.com

Biography
I am a William T. Tutte Postdoctoral Fellow at the University of Waterloo, hosted by Florian Kerschbaum. Prior to this, I was a Postdoctoral Fellow at the University of Copenhagen, supported by the Providentia project and affiliated with Basic Algorithms Research Copenhagen (BARC), hosted by Rasmus Pagh. I completed my PhD at the University of Melbourne, advised by Anthony Wirth and Olga Ohrimenko.
Upcoming: In Spring 2027, I will begin a new position as an Assistant Professor in the School of Data Science at The Chinese University of Hong Kong, Shenzhen.
Prospective Students / RAs / Interns
I am happy to hear from motivated and curious students interested in my research. Students with strong mathematical maturity and/or programming skills are especially welcome. Feel free to reach out by email if you are interested in working with me.
Making Privacy Scale
I design privacy-preserving algorithms for large-scale data analysis, aiming for strong utility guarantees while keeping them fast, implementable, and amenable to secure and distributed computation.
Beyond privacy, I have broad interests in algorithm design, particularly sketching algorithms, graph algorithms, and learning-augmented algorithms.
Publications
Grouped by research direction. Also on Google Scholar and DBLP.
Privacy-Preserving Language Pattern Mining
- ICDTFast and Optimal Differentially Private Frequent-Substring Mining
ICDTIn International Conference on Database Theory, 2027
Private Frequency Estimation
- PODSOptimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time
PODSIn ACM Symposium on Principles of Database Systems, 2026
- ICMLProfile Reconstruction from Private Sketches
ICMLIn International Conference on Machine Learning, 2024
- PODSRandomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data
PODSIn ACM Symposium on Principles of Database Systems, 2022
- AISTATSAsymptotically Optimal Locally Private Heavy Hitters via Parameterized Sketches
AISTATSIn International Conference on Artificial Intelligence and Statistics, 2022
Private Selection
- PODSOptimal Bounds for Private Minimum Spanning Trees via Input Perturbation
PODSIn ACM Symposium on Principles of Database Systems, 2025
- NeurIPSFaster Differentially Private Top-k Selection: A Joint Exponential Mechanism with Pruning
NeurIPSIn Conference on Neural Information Processing Systems, 2024
- ICMLOralTight Data Access Bounds for Private Top-k Selection
ICML · OralIn International Conference on Machine Learning, 2023
Learning-Augmented Algorithms
- ICLRSpotlightLearning-Augmented Frequent Directions
ICLR · SpotlightIn International Conference on Learning Representations, 2025
- ICMLImproved Approximations for Hard Graph Problems using Predictions
ICMLIn International Conference on Machine Learning, 2025
Graph Algorithms
- SIGMODUnifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push
SIGMODIn International Conference on Management of Data, 2021