default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYinzhan Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu:
Simpler and Higher Lower Bounds for Shortcut Sets. SODA 2024: 2643-2656- [c25]Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou
:
New Bounds for Matrix Multiplication: from Alpha to Omega. SODA 2024: 3792-3835 - [c24]Timothy M. Chan, Yinzhan Xu:
Simpler Reductions from Exact Triangle. SOSA 2024: 28-38 - [c23]Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. STOC 2024: 923-934 - [c22]Ce Jin, Yinzhan Xu:
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. STOC 2024: 1573-1584 - [i31]Ce Jin, Yinzhan Xu:
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. CoRR abs/2403.20326 (2024) - [i30]Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
More Asymmetry Yields Faster Matrix Multiplication. CoRR abs/2404.16349 (2024) - [i29]Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye:
Fine-Grained Optimality of Partially Dynamic Shortest Paths and More. CoRR abs/2407.09651 (2024) - [i28]Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu:
Differentially Private Gomory-Hu Trees. CoRR abs/2408.01798 (2024) - [i27]Nick Fischer, Ce Jin, Yinzhan Xu:
New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. CoRR abs/2410.20764 (2024) - [i26]Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick:
All-Hops Shortest Paths. CoRR abs/2410.23617 (2024) - [i25]Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye:
Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence. CoRR abs/2411.06502 (2024) - [i24]Gary Hoppenworth, Yinzhan Xu, Zixuan Xu:
New Separations and Reductions for Directed Preservers and Hopsets. CoRR abs/2411.08151 (2024) - 2023
- [c21]Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Algorithms for Text-to-Pattern Hamming Distances. FOCS 2023: 2188-2203 - [c20]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: 5040-5067 - [c19]Ce Jin, Yinzhan Xu:
Removing Additive Structure in 3SUM-Based Reductions. STOC 2023: 405-418 - [c18]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: 419-432 - [c17]Yuzhou Gu, Yinzhan Xu:
Optimal Bounds for Noisy Sorting. STOC 2023: 1502-1515 - [i23]Yuzhou Gu, Yinzhan Xu:
Optimal Bounds for Noisy Sorting. CoRR abs/2302.12440 (2023) - [i22]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 abs/2303.14572 (2023) - [i21]Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
New Bounds for Matrix Multiplication: from Alpha to Omega. CoRR abs/2307.07970 (2023) - [i20]Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing Cliques from Smaller Cliques. CoRR abs/2307.15871 (2023) - [i19]Timothy M. Chan, Yinzhan Xu:
Simpler Reductions from Exact Triangle. CoRR abs/2310.11575 (2023) - [i18]Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu:
Simpler and Higher Lower Bounds for Shortcut Sets. CoRR abs/2310.12051 (2023) - [i17]Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Algorithms for Text-to-Pattern Hamming Distances. CoRR abs/2310.13174 (2023) - 2022
- [c16]Virginia Vassilevska Williams, Eyob Woldeghebriel, Yinzhan Xu:
Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure. FOCS 2022: 907-918 - [c15]Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. ICALP 2022: 94:1-94:20 - [c14]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules. IJCAI 2022: 482-488 - [c13]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: 1501-1514 - [c12]Ce Jin, Yinzhan Xu:
Tight dynamic problem lower bounds from generalized BMM and OMv. STOC 2022: 1515-1528 - [i16]Ce Jin, Yinzhan Xu:
Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv. CoRR abs/2202.11250 (2022) - [i15]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 abs/2203.08356 (2022) - [i14]Justin Y. Chen, Shyam Narayanan, Yinzhan Xu:
All-Pairs Shortest Path Distances with Differential Privacy: Improved Algorithms for Bounded and Unbounded Weights. CoRR abs/2204.02335 (2022) - [i13]Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. CoRR abs/2204.10932 (2022) - [i12]Virginia Vassilevska Williams, Eyob Woldeghebriel, Yinzhan Xu:
Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failures. CoRR abs/2209.07016 (2022) - [i11]Ce Jin, Yinzhan Xu:
Removing Additive Structure in 3SUM-Based Reductions. CoRR abs/2211.07048 (2022) - [i10]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules. CoRR abs/2212.14173 (2022) - 2021
- [c11]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. ICALP 2021: 47:1-47:21 - [c10]Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. ICALP 2021: 75:1-75:20 - [c9]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Fine-Grained Complexity and Algorithms for the Schulze Voting Method. EC 2021: 841-859 - [i9]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. CoRR abs/2102.06181 (2021) - [i8]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Fine-Grained Complexity and Algorithms for the Schulze Voting Method. CoRR abs/2103.03959 (2021) - [i7]Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. CoRR abs/2105.02806 (2021) - 2020
- [c8]Virginia Vassilevska Williams, Yinzhan Xu:
Monochromatic Triangles, Triangle Listing and APSP. FOCS 2020: 786-797 - [c7]Bryce Sandlund, Yinzhan Xu:
Faster Dynamic Range Mode. ICALP 2020: 94:1-94:14 - [c6]Virginia Vassilevska Williams, Yinzhan Xu:
Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications. SODA 2020: 12-29 - [i6]Bryce Sandlund, Yinzhan Xu:
Faster Dynamic Range Mode. CoRR abs/2004.08777 (2020) - [i5]Virginia Vassilevska Williams, Yinzhan Xu:
Monochromatic Triangles, Triangle Listing and APSP. CoRR abs/2007.09318 (2020)
2010 – 2019
- 2019
- [c5]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu:
Approximation Algorithms for Min-Distance Problems. ICALP 2019: 46:1-46:14 - [i4]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu:
Approximation Algorithms for Min-Distance Problems. CoRR abs/1904.11606 (2019) - [i3]Virginia Vassilevska Williams, Yinzhan Xu:
Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications. CoRR abs/1910.04911 (2019) - 2018
- [c4]Meng He, Richard Peng, Yinzhan Xu:
Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. ANALCO 2018: 32-39 - [c3]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 - [c2]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: 33:1-33:12 - [i2]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 abs/1801.07746 (2018) - [i1]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 abs/1804.06932 (2018) - 2017
- [c1]Yoshihiko Suhara, Yinzhan Xu, Alex 'Sandy' Pentland:
DeepMood: Forecasting Depressed Mood Based on Self-Reported Histories via Recurrent Neural Networks. WWW 2017: 715-724
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-04 03:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
