Yinzhan Xu

Orcid: 0009-0002-6809-2514

According to our database1, Yinzhan Xu authored at least 32 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Differentially Private Gomory-Hu Trees.
CoRR, 2024

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More.
CoRR, 2024

More Asymmetry Yields Faster Matrix Multiplication.
CoRR, 2024

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Simpler Reductions from Exact Triangle.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

New Bounds for Matrix Multiplication: from Alpha to Omega.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Simpler and Higher Lower Bounds for Shortcut Sets.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Listing Cliques from Smaller Cliques.
CoRR, 2023

Removing Additive Structure in 3SUM-Based Reductions.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Optimal Bounds for Noisy Sorting.
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.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Faster Algorithms for Text-to-Pattern Hamming Distances.
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.
CoRR, 2022

All-Pairs Shortest Path Distances with Differential Privacy: Improved Algorithms for Bounded and Unbounded Weights.
CoRR, 2022

Tight dynamic problem lower bounds from generalized BMM and OMv.
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.
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.
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.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Fine-Grained Complexity and Algorithms for the Schulze Voting Method.
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.
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.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Faster Dynamic Range Mode.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Monochromatic Triangles, Triangle Listing and APSP.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Approximation Algorithms for Min-Distance Problems.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

HappyDB: A Corpus of 100, 000 Crowdsourced Happy Moments.
Proceedings of the Eleventh International Conference on Language Resources and Evaluation, 2018

Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts.
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.
Proceedings of the 26th International Conference on World Wide Web, 2017


  Loading...