Tselil Schramm
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
- [c11]Pravesh K. Kothari, Ryan O'Donnell, Tselil Schramm:
SOS Lower Bounds with Hard Constraints: Think Global, Act Local. ITCS 2019: 49:1-49:21 - [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 - 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]
- 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. Information 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
last updated on 2019-01-10 22:18 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint