


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 64 matches
- 2025
- Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
More Asymmetry Yields Faster Matrix Multiplication. SODA 2025: 2005-2039 - Nick Fischer, Ce Jin, Yinzhan Xu:
New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. SODA 2025: 4547-4595 - Gary Hoppenworth, Yinzhan Xu, Zixuan Xu:
New Separations and Reductions for Directed Hopsets and Preservers. SODA 2025: 4405-4443 - Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye:
Fine-Grained Optimality of Partially Dynamic Shortest Paths and More. SODA 2025: 5147-5190 - Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick:
All-Hops Shortest Paths. SODA 2025: 5191-5206 - 2024
- Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu:
Simpler and Higher Lower Bounds for Shortcut Sets. SODA 2024: 2643-2656 - Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou
:
New Bounds for Matrix Multiplication: from Alpha to Omega. SODA 2024: 3792-3835 - Timothy M. Chan, Yinzhan Xu:
Simpler Reductions from Exact Triangle. SOSA 2024: 28-38 - Ce Jin
, Yinzhan Xu
:
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. STOC 2024: 1573-1584 - 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 - Ce Jin, Yinzhan Xu:
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. CoRR abs/2403.20326 (2024) - Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
More Asymmetry Yields Faster Matrix Multiplication. CoRR abs/2404.16349 (2024) - Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye:
Fine-Grained Optimality of Partially Dynamic Shortest Paths and More. CoRR abs/2407.09651 (2024) - 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) - Nick Fischer, Ce Jin, Yinzhan Xu:
New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. CoRR abs/2410.20764 (2024) - Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick:
All-Hops Shortest Paths. CoRR abs/2410.23617 (2024) - 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) - Gary Hoppenworth, Yinzhan Xu, Zixuan Xu:
New Separations and Reductions for Directed Preservers and Hopsets. CoRR abs/2411.08151 (2024) - 2023
- Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Algorithms for Text-to-Pattern Hamming Distances. FOCS 2023: 2188-2203 - 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 - 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 - Yuzhou Gu, Yinzhan Xu:
Optimal Bounds for Noisy Sorting. STOC 2023: 1502-1515 - Ce Jin, Yinzhan Xu:
Removing Additive Structure in 3SUM-Based Reductions. STOC 2023: 405-418 - Yuzhou Gu, Yinzhan Xu:
Optimal Bounds for Noisy Sorting. CoRR abs/2302.12440 (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 abs/2303.14572 (2023) - Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
New Bounds for Matrix Multiplication: from Alpha to Omega. CoRR abs/2307.07970 (2023) - Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing Cliques from Smaller Cliques. CoRR abs/2307.15871 (2023) - Timothy M. Chan, Yinzhan Xu:
Simpler Reductions from Exact Triangle. CoRR abs/2310.11575 (2023) - Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu:
Simpler and Higher Lower Bounds for Shortcut Sets. CoRR abs/2310.12051 (2023) - Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Algorithms for Text-to-Pattern Hamming Distances. CoRR abs/2310.13174 (2023)
skipping 34 more matches
loading more results
failed to load more results, please try again later

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.
retrieved on 2025-02-14 10:27 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint