Yinzhan Xu

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 52

Top Topics

Matrix Multiplication

Top Venues

Publications

Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou
More Asymmetry Yields Faster Matrix Multiplication. CoRR (2024)
Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou
New Bounds for Matrix Multiplication: from Alpha to Omega. SODA (2024)
Timothy M. Chan, Yinzhan Xu
Simpler Reductions from Exact Triangle. SOSA (2024)
Ce Jin, Yinzhan Xu
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. CoRR (2024)
Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu
Simpler and Higher Lower Bounds for Shortcut Sets. SODA (2024)
Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye
Fine-Grained Optimality of Partially Dynamic Shortest Paths and More. CoRR (2024)
Ce Jin, Yinzhan Xu
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. STOC (2024)
Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. STOC (2024)
Yuzhou Gu, Yinzhan Xu
Optimal Bounds for Noisy Sorting. CoRR (2023)
Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. CoRR (2023)
Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu
Faster Algorithms for Text-to-Pattern Hamming Distances. FOCS (2023)
Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu
Simpler and Higher Lower Bounds for Shortcut Sets. CoRR (2023)
Ce Jin, Yinzhan Xu
Removing Additive Structure in 3SUM-Based Reductions. STOC (2023)
Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu
Listing Cliques from Smaller Cliques. CoRR (2023)
Yuzhou Gu, Yinzhan Xu
Optimal Bounds for Noisy Sorting. STOC (2023)
Timothy M. Chan, Yinzhan Xu
Simpler Reductions from Exact Triangle. CoRR (2023)
Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou
New Bounds for Matrix Multiplication: from Alpha to Omega. CoRR (2023)
Justin Y. Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Shyam Narayanan, Jelani Nelson, Yinzhan Xu
Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds. SODA (2023)
Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu
Faster Algorithms for Text-to-Pattern Hamming Distances. CoRR (2023)
Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. STOC (2023)
Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules. CoRR (2022)
Virginia Vassilevska Williams, Eyob Woldeghebriel, Yinzhan Xu
Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure. FOCS (2022)
Ce Jin, Yinzhan Xu
Removing Additive Structure in 3SUM-Based Reductions. CoRR (2022)
Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV. CoRR (2022)
Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. CoRR (2022)
Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. ICALP (2022)
Virginia Vassilevska Williams, Eyob Woldeghebriel, Yinzhan Xu
Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failures. CoRR (2022)
Justin Y. Chen, Shyam Narayanan, Yinzhan Xu
All-Pairs Shortest Path Distances with Differential Privacy: Improved Algorithms for Bounded and Unbounded Weights. CoRR (2022)
Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV. STOC (2022)
Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules. IJCAI (2022)
Ce Jin, Yinzhan Xu
Tight dynamic problem lower bounds from generalized BMM and OMv. STOC (2022)
Ce Jin, Yinzhan Xu
Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv. CoRR (2022)
Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. CoRR (2021)
Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu
Fine-Grained Complexity and Algorithms for the Schulze Voting Method. EC (2021)
Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu
Fine-Grained Complexity and Algorithms for the Schulze Voting Method. CoRR (2021)
Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. ICALP (2021)
Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. ICALP (2021)
Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. CoRR (2021)
Virginia Vassilevska Williams, Yinzhan Xu
Monochromatic Triangles, Triangle Listing and APSP. FOCS (2020)
Virginia Vassilevska Williams, Yinzhan Xu
Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications. SODA (2020)
Virginia Vassilevska Williams, Yinzhan Xu
Monochromatic Triangles, Triangle Listing and APSP. CoRR (2020)
Bryce Sandlund, Yinzhan Xu
Faster Dynamic Range Mode. ICALP (2020)
Bryce Sandlund, Yinzhan Xu
Faster Dynamic Range Mode. CoRR (2020)
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu
Approximation Algorithms for Min-Distance Problems. ICALP (2019)
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu
Approximation Algorithms for Min-Distance Problems. CoRR (2019)
Virginia Vassilevska Williams, Yinzhan Xu
Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications. CoRR (2019)
Akari Asai, Sara Evensen, Behzad Golshan, Alon Y. Halevy, Vivian Li, Andrei Lopatenko, Daniela Stepanov, Yoshihiko Suhara, Wang-Chiew Tan, Yinzhan Xu
HappyDB: A Corpus of 100, 000 Crowdsourced Happy Moments. CoRR (2018)
Akari Asai, Sara Evensen, Behzad Golshan, Alon Y. Halevy, Vivian Li, Andrei Lopatenko, Daniela Stepanov, Yoshihiko Suhara, Wang-Chiew Tan, Yinzhan Xu
HappyDB: A Corpus of 100, 000 Crowdsourced Happy Moments. LREC (2018)
Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu
Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures. SWAT (2018)
Meng He, Richard Peng, Yinzhan Xu
Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. ANALCO (2018)
Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu
Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures. CoRR (2018)
Yoshihiko Suhara, Yinzhan Xu, Alex 'Sandy' Pentland
DeepMood: Forecasting Depressed Mood Based on Self-Reported Histories via Recurrent Neural Networks. WWW (2017)