Yinzhan Xu

According to our database, Yinzhan Xu authored at least 28 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More.

Ce Jin, Yinzhan Xu

CoRR, 2024

Simpler Reductions from Exact Triangle.

Timothy M. Chan, Yinzhan Xu

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

New Bounds for Matrix Multiplication: from Alpha to Omega.

Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Simpler and Higher Lower Bounds for Shortcut Sets.

Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Listing Cliques from Smaller Cliques.

Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu

CoRR, 2023

Removing Additive Structure in 3SUM-Based Reductions.

Ce Jin, Yinzhan Xu

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Optimal Bounds for Noisy Sorting.

Yuzhou Gu, Yinzhan Xu

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 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

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Faster Algorithms for Text-to-Pattern Hamming Distances.

Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failures.

Virginia Vassilevska Williams, Eyob Woldeghebriel, Yinzhan Xu

CoRR, 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

Tight dynamic problem lower bounds from generalized BMM and OMv.

Ce Jin, Yinzhan Xu

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 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

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules.

Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds.

Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure.

Virginia Vassilevska Williams, Eyob Woldeghebriel, Yinzhan Xu

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Fine-Grained Complexity and Algorithms for the Schulze Voting Method.

Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths.

Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths.

Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications.

Virginia Vassilevska Williams, Yinzhan Xu

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Faster Dynamic Range Mode.

Bryce Sandlund, Yinzhan Xu

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Monochromatic Triangles, Triangle Listing and APSP.

Virginia Vassilevska Williams, Yinzhan Xu

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Approximation Algorithms for Min-Distance Problems.

Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures.

Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 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

Proceedings of the Eleventh International Conference on Language Resources and Evaluation, 2018

Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts.

Meng He, Richard Peng, Yinzhan Xu

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017

DeepMood: Forecasting Depressed Mood Based on Self-Reported Histories via Recurrent Neural Networks.

Yoshihiko Suhara, Yinzhan Xu, Alex 'Sandy' Pentland

Proceedings of the 26th International Conference on World Wide Web, 2017