DeepMood: Forecasting Depressed Mood Based on Self-Reported Histories via Recurrent Neural Networks. - Yoshihiko Suhara; Yinzhan Xu; Alex 'Sandy' Pentland (WWW, 2017)

Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. - Meng He 001; Richard Peng; Yinzhan Xu (ANALCO, 2018)

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 (LREC, 2018)

Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures. - Lijie Chen 001; Erik D. Demaine; Yuzhou Gu; Virginia Vassilevska Williams; Yinzhan Xu; Yuancheng Yu (SWAT, 2018)

Approximation Algorithms for Min-Distance Problems. - Mina Dalirrooyfard; Virginia Vassilevska Williams; Nikhil Vyas 001; Nicole Wein; Yinzhan Xu; Yuancheng Yu (ICALP, 2019)

Monochromatic Triangles, Triangle Listing and APSP. - Virginia Vassilevska Williams; Yinzhan Xu (FOCS, 2020)

Faster Dynamic Range Mode. - Bryce Sandlund; Yinzhan Xu (ICALP, 2020)

Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications. - Virginia Vassilevska Williams; Yinzhan Xu (SODA, 2020)

Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. - Timothy M. Chan; Virginia Vassilevska Williams; Yinzhan Xu (ICALP, 2021)

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. - Yuzhou Gu; Adam Polak 001; Virginia Vassilevska Williams; Yinzhan Xu (ICALP, 2021)

Fine-Grained Complexity and Algorithms for the Schulze Voting Method. - Krzysztof Sornat; Virginia Vassilevska Williams; Yinzhan Xu (EC, 2021)

Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure. - Virginia Vassilevska Williams; Eyob Woldeghebriel; Yinzhan Xu (FOCS, 2022)

Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. - Surya Mathialagan; Virginia Vassilevska Williams; Yinzhan Xu (ICALP, 2022)

Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules. - Krzysztof Sornat; Virginia Vassilevska Williams; Yinzhan Xu (IJCAI, 2022)

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 (STOC, 2022)

Tight dynamic problem lower bounds from generalized BMM and OMv. - Ce Jin 001; Yinzhan Xu (STOC, 2022)

All-Pairs Shortest Path Distances with Differential Privacy: Improved Algorithms for Bounded and Unbounded Weights. - Justin Y. Chen; Shyam Narayanan; Yinzhan Xu (CoRR, 2022)

Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failures. - Virginia Vassilevska Williams; Eyob Woldeghebriel; Yinzhan Xu (CoRR, 2022)

Faster Algorithms for Text-to-Pattern Hamming Distances. - Timothy M. Chan; Ce Jin 001; Virginia Vassilevska Williams; Yinzhan Xu (FOCS, 2023)

Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds. - Justin Y. Chen; Badih Ghazi; Ravi Kumar 001; Pasin Manurangsi; Shyam Narayanan; Jelani Nelson; Yinzhan Xu (SODA, 2023)

Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. - Timothy M. Chan; Virginia Vassilevska Williams; Yinzhan Xu (STOC, 2023)

Optimal Bounds for Noisy Sorting. - Yuzhou Gu; Yinzhan Xu (STOC, 2023)

Removing Additive Structure in 3SUM-Based Reductions. - Ce Jin 001; Yinzhan Xu (STOC, 2023)

Listing Cliques from Smaller Cliques. - Mina Dalirrooyfard; Surya Mathialagan; Virginia Vassilevska Williams; Yinzhan Xu (CoRR, 2023)

Simpler and Higher Lower Bounds for Shortcut Sets. - Virginia Vassilevska Williams; Yinzhan Xu; Zixuan Xu (SODA, 2024)

New Bounds for Matrix Multiplication: from Alpha to Omega. - Virginia Vassilevska Williams; Yinzhan Xu; Zixuan Xu; Renfei Zhou (SODA, 2024)

Simpler Reductions from Exact Triangle. - Timothy M. Chan; Yinzhan Xu (SOSA, 2024)

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. - Ce Jin 001; Yinzhan Xu (STOC, 2024)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. - Mina Dalirrooyfard; Surya Mathialagan; Virginia Vassilevska Williams; Yinzhan Xu (STOC, 2024)

Differentially Private Gomory-Hu Trees. - Anders Aamand; Justin Y. Chen; Mina Dalirrooyfard; Slobodan Mitrovic; Yuriy Nevmyvaka; Sandeep Silwal; Yinzhan Xu (CoRR, 2024)

New Separations and Reductions for Directed Preservers and Hopsets. - Gary Hoppenworth; Yinzhan Xu; Zixuan Xu (CoRR, 2024)

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs. - Hadley Black; Arya Mazumdar; Barna Saha; Yinzhan Xu (COLT, 2025)

Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold. - Yuzhou Gu; Xin Li; Yinzhan Xu (COLT, 2025)

More Asymmetry Yields Faster Matrix Multiplication. - Josh Alman; Ran Duan; Virginia Vassilevska Williams; Yinzhan Xu; Zixuan Xu; Renfei Zhou (SODA, 2025)

New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. - Nick Fischer; Ce Jin 001; Yinzhan Xu (SODA, 2025)

New Separations and Reductions for Directed Hopsets and Preservers. - Gary Hoppenworth; Yinzhan Xu; Zixuan Xu (SODA, 2025)

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More. - Barna Saha; Virginia Vassilevska Williams; Yinzhan Xu; Christopher Ye 001 (SODA, 2025)

All-Hops Shortest Paths. - Virginia Vassilevska Williams; Zoe Xi; Yinzhan Xu; Uri Zwick (SODA, 2025)

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence. - Jakob Nogler; Adam Polak 001; Barna Saha; Virginia Vassilevska Williams; Yinzhan Xu; Christopher Ye 001 (STOC, 2025)

Subquadratic Algorithms and Hardness for Attention with Any Temperature. - Shreya Gupta; Boyang Huang; Barna Saha; Yinzhan Xu; Christopher Ye 001 (CoRR, 2025)

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 (CoRR, 2025)