| New bounds for matrix multiplication: from alpha to omega VV Williams, Y Xu, Z Xu, R Zhou Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 293 | 2024 |
| Deepmood: Forecasting depressed mood based on self-reported histories via recurrent neural networks Y Suhara, Y Xu, AS Pentland Proceedings of the 26th International Conference on World Wide Web, 715-724, 2017 | 227 | 2017 |
| More asymmetry yields faster matrix multiplication J Alman, R Duan, VV Williams, Y Xu, Z Xu, R Zhou Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025 | 113 | 2025 |
| Happydb: A corpus of 100,000 crowdsourced happy moments A Asai, S Evensen, B Golshan, A Halevy, V Li, A Lopatenko, D Stepanov, ... Proceedings of the Eleventh International Conference on Language Resources …, 2018 | 66 | 2018 |
| Monochromatic triangles, triangle listing and APSP VV Williams, Y Xu 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 47 | 2020 |
| Removing additive structure in 3sum-based reductions C Jin, Y Xu Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 405-418, 2023 | 39 | 2023 |
| Truly subcubic min-plus product for less structured matrices, with applications VV Williams, Y Xu Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 39 | 2020 |
| Differentially private all-pairs shortest path distances: Improved algorithms and lower bounds JY Chen, B Ghazi, R Kumar, P Manurangsi, S Narayanan, J Nelson, Y Xu Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 32* | 2023 |
| Optimal bounds for noisy sorting Y Gu, Y Xu Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1502-1515, 2023 | 29 | 2023 |
| Faster monotone min-plus product, range mode, and single source replacement paths Y Gu, A Polak, VV Williams, Y Xu 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 25 | 2021 |
| Tight dynamic problem lower bounds from generalized BMM and OMv C Jin, Y Xu Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 22 | 2022 |
| Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV TM Chan, VV Williams, Y Xu Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 19 | 2022 |
| Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More TM Chan, V Vassilevska Williams, Y Xu Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 419-432, 2023 | 18 | 2023 |
| Simpler and higher lower bounds for shortcut sets VV Williams, Y Xu, Z Xu Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 15 | 2024 |
| Algorithms, reductions and equivalences for small weight variants of all-pairs shortest paths TM Chan, VV Williams, Y Xu 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 15 | 2021 |
| Approximation algorithms for min-distance problems M Dalirrooyfard, VV Williams, N Vyas, N Wein, Y Xu, Y Yu 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 13 | 2019 |
| Shaving logs via large sieve inequality: Faster algorithms for sparse convolution and more C Jin, Y Xu Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1573-1584, 2024 | 12 | 2024 |
| Towards optimal output-sensitive clique listing or: Listing cliques from smaller cliques M Dalirrooyfard, S Mathialagan, VV Williams, Y Xu Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 923-934, 2024 | 12* | 2024 |
| Faster algorithms for text-to-pattern Hamming distances TM Chan, C Jin, VV Williams, Y Xu 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 12 | 2023 |
| Near-tight algorithms for the Chamberlin-Courant and Thiele voting rules K Sornat, VV Williams, Y Xu 31st International Joint Conference on Artificial Intelligence, IJCAI 2022, 2022 | 12 | 2022 |
