default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTselil Schramm
Person information
- affiliation: Stanford University, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Misha Ivkov
, Tselil Schramm:
Semidefinite Programs Simulate Approximate Message Passing Robustly. STOC 2024: 348-357- [i30]Shuangping Li, Tselil Schramm, Kangjie Zhou:
Discrepancy Algorithms for the Binary Perceptron. CoRR abs/2408.00796 (2024) - 2023
- [c24]Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang:
Local and Global Expansion in Random Geometric Graphs. STOC 2023: 817-825 - [i29]Shuangping Li, Tselil Schramm:
Spectral clustering in the Gaussian mixture block model. CoRR abs/2305.00979 (2023) - [i28]Misha Ivkov, Tselil Schramm:
Semidefinite programs simulate approximate message passing robustly. CoRR abs/2311.09017 (2023) - 2022
- [c23]Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, Xinyu Wu:
The SDP Value of Random 2CSPs. ICALP 2022: 97:1-97:19 - [c22]Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik:
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. NeurIPS 2022 - [c21]Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang:
Testing thresholds for high-dimensional sparse random geometric graphs. STOC 2022: 672-677 - [i27]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi:
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. CoRR abs/2203.02790 (2022) - [i26]Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik:
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. CoRR abs/2205.09727 (2022) - [i25]Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang:
Local and global expansion in random geometric graphs. CoRR abs/2210.00158 (2022) - 2021
- [j4]Ryan O'Donnell, Tselil Schramm:
Sherali-Adams Strikes Back. Theory Comput. 17: 1-30 (2021) - [c20]Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm:
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. COLT 2021: 774 - [c19]Ronen Eldan, Dan Mikulincer, Tselil Schramm:
Non-asymptotic approximations of neural networks by Gaussian processes. COLT 2021: 1754-1775 - [c18]Pasin Manurangsi, Aviad Rubinstein, Tselil Schramm:
The Strongish Planted Clique Hypothesis and Its Consequences. ITCS 2021: 10:1-10:21 - [c17]Arun Jambulapati, Jerry Li, Tselil Schramm, Kevin Tian:
Robust Regression Revisited: Acceleration and Improved Estimation Rates. NeurIPS 2021: 4475-4488 - [c16]Mitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm, David Steurer:
Playing unique games on certified small-set expanders. STOC 2021: 1629-1642 - [i24]Ronen Eldan, Dan Mikulincer, Tselil Schramm:
Non-asymptotic approximations of neural networks by Gaussian processes. CoRR abs/2102.08668 (2021) - [i23]Arun Jambulapati, Jerry Li, Tselil Schramm, Kevin Tian:
Robust Regression Revisited: Acceleration and Improved Estimation Rates. CoRR abs/2106.11938 (2021) - [i22]Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, Xinyu Wu:
The SDP value of random 2CSPs. CoRR abs/2108.01038 (2021) - [i21]Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang:
Testing thresholds for high-dimensional sparse random geometric graphs. CoRR abs/2111.11316 (2021) - 2020
- [c15]Samuel B. Hopkins, Tselil Schramm, Luca Trevisan:
Subexponential LPs Approximate Max-Cut. FOCS 2020: 943-953 - [i20]Mitali Bafna, Boaz Barak, Pravesh Kothari, Tselil Schramm, David Steurer:
Playing Unique Games on Certified Small-Set Expanders. CoRR abs/2006.09969 (2020) - [i19]Tselil Schramm, Alexander S. Wein:
Computational Barriers to Estimation from Low-Degree Polynomials. CoRR abs/2008.02269 (2020) - [i18]Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm:
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent. CoRR abs/2009.06107 (2020) - [i17]Pasin Manurangsi, Aviad Rubinstein, Tselil Schramm:
The Strongish Planted Clique Hypothesis and Its Consequences. CoRR abs/2011.05555 (2020)
2010 – 2019
- 2019
- [c14]Ryan O'Donnell, Tselil Schramm:
Sherali - Adams Strikes Back. CCC 2019: 8:1-8:30 - [c13]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi:
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. COLT 2019: 1683-1722 - [c12]Pravesh K. Kothari, Ryan O'Donnell, Tselil Schramm:
SOS Lower Bounds with Hard Constraints: Think Global, Act Local. ITCS 2019: 49:1-49:21 - [c11]Boaz Barak, Chi-Ning Chou, Zhixian Lei, Tselil Schramm, Yueqi Sheng:
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs. NeurIPS 2019: 9186-9194 - [c10]Yash Deshpande, Andrea Montanari, Ryan O'Donnell, Tselil Schramm, Subhabrata Sen:
The threshold for SDP-refutation of random regular NAE-3SAT. SODA 2019: 2305-2321 - [i16]Samuel B. Hopkins, Tselil Schramm, Luca Trevisan:
Subexponential LPs Approximate Max-Cut. CoRR abs/1911.10304 (2019) - 2018
- [j3]Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm:
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. ACM Trans. Algorithms 14(3): 28:1-28:31 (2018) - [c9]Aviad Rubinstein, Tselil Schramm, S. Matthew Weinberg:
Computing Exact Minimum Cuts Without Knowing the Graph. ITCS 2018: 39:1-39:16 - [i15]Yash Deshpande, Andrea Montanari, Ryan O'Donnell, Tselil Schramm, Subhabrata Sen:
The threshold for SDP-refutation of random regular NAE-3SAT. CoRR abs/1804.05230 (2018) - [i14]Boaz Barak, Chi-Ning Chou, Zhixian Lei, Tselil Schramm, Yueqi Sheng:
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs. CoRR abs/1805.02349 (2018) - [i13]Prasad Raghavendra, Tselil Schramm, David Steurer:
High-dimensional estimation via sum-of-squares proofs. CoRR abs/1807.11419 (2018) - [i12]Pravesh Kothari, Ryan O'Donnell, Tselil Schramm:
SOS lower bounds with hard constraints: think global, act local. CoRR abs/1809.01207 (2018) - [i11]Ryan O'Donnell, Tselil Schramm:
Sherali-Adams Strikes Back. CoRR abs/1812.09967 (2018) - 2017
- [b1]Tselil Schramm:
Random Matrices and the Sum-of-Squares Hierarchy. University of California, Berkeley, USA, 2017 - [j2]Ronen Eldan, Miklós Z. Rácz, Tselil Schramm:
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors. Random Struct. Algorithms 50(4): 584-611 (2017) - [c8]Tselil Schramm, David Steurer:
Fast and robust tensor decomposition with applications to dictionary learning. COLT 2017: 1760-1793 - [c7]Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer:
The Power of Sum-of-Squares for Detecting Hidden Structures. FOCS 2017: 720-731 - [c6]Prasad Raghavendra, Satish Rao, Tselil Schramm:
Strongly refuting random CSPs below the spectral threshold. STOC 2017: 121-131 - [i10]Tselil Schramm, David Steurer:
Fast and robust tensor decomposition with applications to dictionary learning. CoRR abs/1706.08672 (2017) - [i9]Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer:
The power of sum-of-squares for detecting hidden structures. CoRR abs/1710.05017 (2017) - [i8]Aviad Rubinstein, Tselil Schramm, S. Matthew Weinberg:
Computing exact minimum cuts without knowing the graph. CoRR abs/1711.03165 (2017) - 2016
- [j1]Varun Kanade, Elchanan Mossel, Tselil Schramm:
Global and Local Information in Clustering Labeled Block Models. IEEE Trans. Inf. Theory 62(10): 5906-5917 (2016) - [c5]Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm:
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. SODA 2016: 1079-1095 - [c4]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer:
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors. STOC 2016: 178-191 - [i7]Prasad Raghavendra, Satish Rao, Tselil Schramm:
Strongly Refuting Random CSPs Below the Spectral Threshold. CoRR abs/1605.00058 (2016) - 2015
- [c3]Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev:
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs. STOC 2015: 219-228 - [i6]Tselil Schramm, Benjamin Weitz:
Low-Rank Matrix Completion with Adversarial Missing Entries. CoRR abs/1506.03137 (2015) - [i5]Prasad Raghavendra, Tselil Schramm:
Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program. CoRR abs/1507.05136 (2015) - [i4]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer:
Speeding up sum-of-squares for tensor decomposition and planted sparse vectors. CoRR abs/1512.02337 (2015) - 2014
- [c2]Prasad Raghavendra, Tselil Schramm:
Gap Amplification for Small-Set Expansion via Random Walks. APPROX-RANDOM 2014: 381-391 - [c1]Varun Kanade, Elchanan Mossel, Tselil Schramm:
Global and Local Information in Clustering Labeled Block Models. APPROX-RANDOM 2014: 779-792 - [i3]Varun Kanade, Elchanan Mossel, Tselil Schramm:
Global and Local Information in Clustering Labeled Block Models. CoRR abs/1404.6325 (2014) - [i2]Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev:
Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs. CoRR abs/1412.0681 (2014) - 2013
- [i1]Prasad Raghavendra, Tselil Schramm:
Gap Amplification for Small-Set Expansion via Random Walks. CoRR abs/1310.1493 (2013)
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-09-11 00:35 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:
