| 2026 | COLT | A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions. | Yuzhou Gu, Xin Li, Yinzhan Xu |
| 2026 | ICALP | Deterministic Monotone Min-Plus Product and Convolution. | Ce Jin, Jaewoo Park, Barna Saha, Yinzhan Xu |
| 2026 | STOC | On the Computational Hardness of Transformers. | Barna Saha, Yinzhan Xu, Christopher Ye, Hantao Yu |
| 2025 | COLT | Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs. | Hadley Black, Arya Mazumdar, Barna Saha, Yinzhan Xu |
| 2025 | COLT | Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold. | Yuzhou Gu, Xin Li, Yinzhan Xu |
| 2025 | ICML | Breaking the n1.5 Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition. | Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu |
| 2025 | SODA | More Asymmetry Yields Faster Matrix Multiplication. | Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou |
| 2025 | SODA | New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. | Nick Fischer, Ce Jin, Yinzhan Xu |
| 2025 | SODA | New Separations and Reductions for Directed Hopsets and Preservers. | Gary Hoppenworth, Yinzhan Xu, Zixuan Xu |
| 2025 | SODA | Fine-Grained Optimality of Partially Dynamic Shortest Paths and More. | Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye |
| 2025 | SODA | All-Hops Shortest Paths. | Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick |
| 2025 | STOC | Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence. | Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye |
| 2024 | SODA | Simpler and Higher Lower Bounds for Shortcut Sets. | Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu |
| 2024 | SODA | New Bounds for Matrix Multiplication: from Alpha to Omega. | Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou |
| 2024 | STOC | Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. | Ce Jin, Yinzhan Xu |
| 2024 | STOC | Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. | Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2023 | FOCS | Faster Algorithms for Text-to-Pattern Hamming Distances. | Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu |
| 2023 | SODA | Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds. | Justin Y. Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Shyam Narayanan, Jelani Nelson, Yinzhan Xu |
| 2023 | STOC | Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. | Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2023 | STOC | Optimal Bounds for Noisy Sorting. | Yuzhou Gu, Yinzhan Xu |
| 2023 | STOC | Removing Additive Structure in 3SUM-Based Reductions. | Ce Jin, Yinzhan Xu |
| 2022 | FOCS | Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure. | Virginia Vassilevska Williams, Eyob Woldeghebriel, Yinzhan Xu |
| 2022 | ICALP | Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. | Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2022 | IJCAI | Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules. | Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu |
| 2022 | STOC | Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV. | Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2022 | STOC | Tight dynamic problem lower bounds from generalized BMM and OMv. | Ce Jin, Yinzhan Xu |
| 2021 | ICALP | Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. | Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2021 | ICALP | Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. | Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu |
| 2020 | FOCS | Monochromatic Triangles, Triangle Listing and APSP. | Virginia Vassilevska Williams, Yinzhan Xu |
| 2020 | ICALP | Faster Dynamic Range Mode. | Bryce Sandlund, Yinzhan Xu |
| 2020 | SODA | Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications. | Virginia Vassilevska Williams, Yinzhan Xu |
| 2019 | ICALP | Approximation Algorithms for Min-Distance Problems. | Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu |
| 2018 | LREC | HappyDB: A Corpus of 100, 000 Crowdsourced Happy Moments. | Akari Asai, Sara Evensen, Behzad Golshan, Alon Y. Halevy, Vivian Li, Andrei Lopatenko, Daniela Stepanov, Yoshihiko Suhara, Wang-Chiew Tan, Yinzhan Xu |
| 2017 | WWW | DeepMood: Forecasting Depressed Mood Based on Self-Reported Histories via Recurrent Neural Networks. | Yoshihiko Suhara, Yinzhan Xu, Alex 'Sandy' Pentland |