default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhangsong Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j3]Zhangsong Li
:
A Computational Transition for Detecting Multivariate Shuffled Linear Regression by Low-Degree Polynomials. IEEE Trans. Inf. Theory 72(4): 2444-2456 (2026)- [j2]Zhangsong Li:
Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm. IEEE Trans. Inf. Theory 72(8): 6093-6111 (2026) - [c3]Guanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li:
Detecting Correlation Efficiently in Very Supercritical Stochastic Block Models: Breaking the Otter's Threshold Barrier. SODA 2026: 2743-2759 - [i15]Zhangsong Li:
Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization. CoRR abs/2601.20522 (2026) - [i14]Shuyang Gong, Dong Huang, Zhangsong Li:
Fundamental Limits of Community Detection in Contextual Multi-Layer Stochastic Block Models. CoRR abs/2602.08173 (2026) - [i13]Zhangsong Li:
Algorithmic Contiguity from Low-Degree Heuristic II: Predicting Detection-Recovery Gaps. CoRR abs/2604.17410 (2026) - [i12]Zhangsong Li:
On Injectivity of Phase Retrieval. CoRR abs/2606.17922 (2026) - 2025
- [j1]Jian Ding, Zhangsong Li:
A Polynomial Time Iterative Algorithm for Matching Gaussian Matrices with Non-vanishing Correlation. Found. Comput. Math. 25(4): 1287-1344 (2025) - [c2]Zhangsong Li:
Algorithmic Contiguity from Low-Degree Conjecture and Applications in Correlated Random Graphs. APPROX/RANDOM 2025: 30:1-30:18 - [c1]Zhangsong Li:
Robust random graph matching in Gaussian models via vector approximate message passing. COLT 2025: 3580-3581 - [i11]Zhangsong Li:
Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs. CoRR abs/2502.09832 (2025) - [i10]Guanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li:
Detecting correlation efficiently in stochastic block models: breaking Otter's threshold by counting decorated trees. CoRR abs/2503.06464 (2025) - [i9]Zhangsong Li:
A computational transition for detecting multivariate shuffled linear regression by low-degree polynomials. CoRR abs/2504.03097 (2025) - [i8]Zhangsong Li:
A Smooth Computational Transition in Tensor PCA. CoRR abs/2509.09904 (2025) - [i7]Zhangsong Li:
The Algorithmic Phase Transition in Symmetric Correlated Spiked Wigner Model. CoRR abs/2511.06040 (2025) - 2024
- [i6]Shuyang Gong, Zhangsong Li:
The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime. CoRR abs/2402.15095 (2024) - [i5]Guanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li:
A computational transition for detecting correlated stochastic block models by low-degree polynomials. CoRR abs/2409.00966 (2024) - [i4]Zhangsong Li:
Robust random graph matching in dense graphs via vector approximate message passing. CoRR abs/2412.16457 (2024) - 2023
- [i3]Jian Ding, Zhangsong Li:
A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation. CoRR abs/2306.00266 (2023) - [i2]Jian Ding, Hang Du, Zhangsong Li:
Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs. CoRR abs/2311.15931 (2023) - 2022
- [i1]Jian Ding, Zhangsong Li:
A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation. CoRR abs/2212.13677 (2022)
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 2026-07-23 22:55 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
