Yinzhan Xu - RankMe

71 papers A* 31B 1Journal 36Unranked 3

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