Tselil Schramm

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers26 papers

Sort

By YearBy Citation

Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent

Matthew Brennan,Guy Bresler,Samuel B. Hopkins,Jerry Li,Tselil Schramm

Bibtex

Playing Unique Games on Certified Small-Set Expanders

Mitali Bafna,Boaz Barak,Pravesh Kothari,Tselil Schramm,David Steurer

Cited by1Bibtex

The threshold for SDP-refutation of random regular NAE-3SAT

Yash Deshpande,Andrea Montanari,Ryan O'Donnell,Tselil Schramm,Subhabrata Sen

SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, (2019): 2305-2321

Cited by7EIBibtex

HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS

Prasad Raghavendra,Tselil Schramm,David Steurer

Proceedings of the International Congress of Mathematicians (ICM 2018), (2019)

Cited by24Bibtex

Subexponential LPs Approximate Max-Cut

Hopkins Samuel B.,Schramm Tselil,Trevisan Luca

FOCS, pp.943-953, (2019)

Cited by2EIBibtex

Sherali - Adams Strikes Back

Ryan O'Donnell,Tselil Schramm

Leibniz International Proceedings in Informatics, (2019)

EIBibtex

A Robust Spectral Algorithm for Overcomplete Tensor Decomposition

Samuel B. Hopkins,Tselil Schramm,Jonathan Shi

COLT, pp.1683-1722, (2019)

Cited by1EIBibtex

SOS lower bounds with hard constraints: think global, act local

Pravesh Kothari,Ryan O'Donnell,Tselil Schramm

ITCS, (2019)

EIBibtex

(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs

Boaz Barak,Chi-Ning Chou, Zhixian Lei,Tselil Schramm, Yueqi Sheng

ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), (2019)

Cited by1Bibtex

On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique

Samuel B. Hopkins,Pravesh Kothari,Aaron Henry Potechin,Prasad Raghavendra,Tselil Schramm

ACM Trans. Algorithms, no. 3 (2018): 28:1-28:31

Cited by31EIBibtex

Sherali-Adams Strikes Back

Ryan O'Donnell,Tselil Schramm

CoRR, (2018)

Cited by2EIBibtex

Computing exact minimum cuts without knowing the graph

Aviad Rubinstein,Tselil Schramm,S. Matthew Weinberg

conference on innovations in theoretical computer science, (2018)

Cited by22EIBibtex

High-dimensional estimation via sum-of-squares proofs

Prasad Raghavendra,Tselil Schramm,David Steurer

arXiv: Data Structures and Algorithms, (2018)

Cited by24EIBibtex

The Power of Sum-of-Squares for Detecting Hidden Structures

Samuel B. Hopkins,Pravesh K. Kothari,Aaron Potechin,Prasad Raghavendra,Tselil Schramm,David Steurer

2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), (2017): 720-731

Cited by56EIBibtex

Strongly Refuting Random CSPs Below the Spectral Threshold

Prasad Raghavendra,Satish Rao,Tselil Schramm

STOC, (2017): 121-131

Cited by45EIBibtex

Fast and robust tensor decomposition with applications to dictionary learning

Tselil Schramm,David Steurer

COLT, (2017): 1760-1793

Cited by25EIBibtex

Global and Local Information in Clustering Labeled Block Models

Varun Kanade,Elchanan Mossel,Tselil Schramm

IEEE Transactions Information Theory, no. 99 (2016): 1

Cited by31EIWOSBibtex

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors

Samuel B. Hopkins,Tselil Schramm,Jonathan Shi,David Steurer

STOC '16: Symposium on Theory of Computing Cambridge MA USA June, 2016, pp.178-191, (2016)

Cited by91EIBibtex

Symmetric Tensor Completion from Multilinear Entries and Learning Product Mixtures over the Hypercube

Tselil Schramm, Benjamin Weitz

arXiv: Data Structures and Algorithms, (2015)

Bibtex

Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs

Shuchi Chawla,Konstantin Makarychev,Tselil Schramm,Grigory Yaroslavtsev

ACM Symposium on Theory of Computing, pp.219-228, (2015)

Cited by60EIBibtex

View All

Base Info Papers Patents Projects

Tselil SchrammBinding

Papers26 papers

Tselil Schramm