default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJingqiu Ding
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i10]Jingqiu Ding, Yiding Hua, Lucas Slot, David Steurer:
Low degree conjecture implies sharp computational thresholds in stochastic block model. CoRR abs/2502.15024 (2025)- [i9]Hongjie Chen, Jingqiu Ding, Yiding Hua, Stefan Tiegel:
Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point. CoRR abs/2503.03923 (2025) - 2024
- [c8]Rares-Darius Buhai, Jingqiu Ding, Stefan Tiegel:
Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression. COLT 2024: 752-771 - [c7]Hongjie Chen, Jingqiu Ding, Yiding Hua, David Steurer:
Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust. NeurIPS 2024 - [c6]Hongjie Chen
, Jingqiu Ding, Tommaso d'Orsi, Yiding Hua, Chih-Hung Liu, David Steurer:
Private Graphon Estimation via Sum-of-Squares. STOC 2024: 172-182 - [i8]Rares-Darius Buhai, Jingqiu Ding, Stefan Tiegel:
Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression. CoRR abs/2402.14103 (2024) - [i7]Hongjie Chen, Jingqiu Ding, Tommaso d'Orsi, Yiding Hua, Chih-Hung Liu, David Steurer:
Private graphon estimation via sum-of-squares. CoRR abs/2403.12213 (2024) - [i6]Hongjie Chen, Jingqiu Ding, Yiding Hua, David Steurer:
Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust. CoRR abs/2405.16663 (2024) - 2023
- [c5]Jingqiu Ding, Yiding Hua:
SQ Lower Bounds for Random Sparse Planted Vector Problem. ALT 2023: 558-596 - [c4]Yiding Hua, Jingqiu Ding, Tommaso d'Orsi, David Steurer:
Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions. COLT 2023: 4044-4071 - [i5]Jingqiu Ding, Yiding Hua:
SQ Lower Bounds for Random Sparse Planted Vector Problem. CoRR abs/2301.11124 (2023) - [i4]Jingqiu Ding, Tommaso d'Orsi, Yiding Hua, David Steurer:
Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions. CoRR abs/2305.10227 (2023) - 2022
- [c3]Jingqiu Ding, Tommaso d'Orsi, Chih-Hung Liu, David Steurer, Stefan Tiegel:
Fast algorithm for overcomplete order-3 tensor decomposition. COLT 2022: 3741-3799 - [i3]Jingqiu Ding, Tommaso d'Orsi, Chih-Hung Liu, Stefan Tiegel, David Steurer:
Fast algorithm for overcomplete order-3 tensor decomposition. CoRR abs/2202.06442 (2022) - 2021
- [c2]Jingqiu Ding, Tommaso d'Orsi, Rajai Nasser, David Steurer:
Robust recovery for stochastic block models. FOCS 2021: 387-394 - [i2]Jingqiu Ding, Tommaso d'Orsi, Rajai Nasser, David Steurer:
Robust recovery for stochastic block models. CoRR abs/2111.08568 (2021) - 2020
- [c1]Jingqiu Ding, Samuel B. Hopkins, David Steurer:
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks. NeurIPS 2020 - [i1]Jingqiu Ding, Samuel B. Hopkins, David Steurer:
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks. CoRR abs/2008.13735 (2020)
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-04-14 00:32 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
