default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTommaso d'Orsi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Vahab Mirrokni, Peilin Zhong:
Perturb-and-Project: Differentially Private Similarities and Marginals. ICML 2024- [c14]Vincent Cohen-Addad, Tommaso d'Orsi, Silvio Lattanzi, Rajai Nasser:
Multi-View Stochastic Block Models. ICML 2024 - [c13]Vincent Cohen-Addad, Tommaso d'Orsi, Aida Mousavifar:
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering. ICML 2024 - [c12]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 - [i16]Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi:
Max-Cut with ε-Accurate Predictions. CoRR abs/2402.18263 (2024) - [i15]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) - [i14]Vincent Cohen-Addad, Tommaso d'Orsi, Aida Mousavifar:
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering. CoRR abs/2406.04857 (2024) - [i13]Vincent Cohen-Addad, Tommaso d'Orsi, Silvio Lattanzi, Rajai Nasser:
Multi-View Stochastic Block Models. CoRR abs/2406.04860 (2024) - [i12]Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Vahab Mirrokni, Peilin Zhong:
Perturb-and-Project: Differentially Private Similarities and Marginals. CoRR abs/2406.04868 (2024) - 2023
- [b1]Tommaso d'Orsi:
Information-computation gaps in robust statistics. ETH Zurich, Zürich, Switzerland, 2023 - [c11]Tommaso d'Orsi, Luca Trevisan:
A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs. CCC 2023: 27:1-27:16 - [c10]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 - [c9]Hongjie Chen, Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Jacob Imola, David Steurer, Stefan Tiegel:
Private estimation algorithms for stochastic block models and mixture models. NeurIPS 2023 - [c8]Tommaso d'Orsi, Rajai Nasser, Gleb Novikov, David Steurer:
Higher degree sum-of-squares relaxations robust against oblivious outliers. SODA 2023: 3513-3550 - [i11]Hongjie Chen, Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Jacob Imola, David Steurer, Stefan Tiegel:
Private estimation algorithms for stochastic block models and mixture models. CoRR abs/2301.04822 (2023) - [i10]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
- [c7]Jingqiu Ding, Tommaso d'Orsi, Chih-Hung Liu, David Steurer, Stefan Tiegel:
Fast algorithm for overcomplete order-3 tensor decomposition. COLT 2022: 3741-3799 - [c6]Hongjie Chen, Tommaso d'Orsi:
On the well-spread property and its relation to linear regression. COLT 2022: 3905-3935 - [i9]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) - [i8]Tommaso d'Orsi, Luca Trevisan:
A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs. CoRR abs/2204.10881 (2022) - [i7]Hongjie Chen, Tommaso d'Orsi:
On the well-spread property and its relation to linear regression. CoRR abs/2206.08092 (2022) - [i6]Tommaso d'Orsi, Rajai Nasser, Gleb Novikov, David Steurer:
Higher degree sum-of-squares relaxations robust against oblivious outliers. CoRR abs/2211.07327 (2022) - 2021
- [c5]Jingqiu Ding, Tommaso d'Orsi, Rajai Nasser, David Steurer:
Robust recovery for stochastic block models. FOCS 2021: 387-394 - [c4]Tommaso d'Orsi, Gleb Novikov, David Steurer:
Consistent regression when oblivious outliers overwhelm. ICML 2021: 2297-2306 - [c3]Davin Choo, Tommaso d'Orsi:
The Complexity of Sparse Tensor PCA. NeurIPS 2021: 7993-8005 - [c2]Tommaso d'Orsi, Chih-Hung Liu, Rajai Nasser, Gleb Novikov, David Steurer, Stefan Tiegel:
Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers. NeurIPS 2021: 25427-25438 - [i5]Davin Choo, Tommaso d'Orsi:
The Complexity of Sparse Tensor PCA. CoRR abs/2106.06308 (2021) - [i4]Tommaso d'Orsi, Chih-Hung Liu, Rajai Nasser, Gleb Novikov, David Steurer, Stefan Tiegel:
Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers. CoRR abs/2111.02966 (2021) - [i3]Jingqiu Ding, Tommaso d'Orsi, Rajai Nasser, David Steurer:
Robust recovery for stochastic block models. CoRR abs/2111.08568 (2021) - 2020
- [c1]Tommaso d'Orsi, Pravesh K. Kothari, Gleb Novikov, David Steurer:
Sparse PCA: Algorithms, Adversarial Perturbations and Certificates. FOCS 2020: 553-564 - [i2]Tommaso d'Orsi, Gleb Novikov, David Steurer:
Regress Consistently when Oblivious Outliers Overwhelm. CoRR abs/2009.14774 (2020) - [i1]Tommaso d'Orsi, Pravesh K. Kothari, Gleb Novikov, David Steurer:
Sparse PCA: Algorithms, Adversarial Perturbations and Certificates. CoRR abs/2011.06585 (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 2024-10-07 21:12 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:
