Concepedia

Tselil Schramm

TS

21

Publications

595

Citations

15

H-Index

2014

Active since

Affiliations

University of California, Berkeley(Current)

Cornell University

Stanford University

Berkeley College

Harvard University Press

Tselil Schramm is an author at University of California, Berkeley specializing in engineering, computer science, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityGraph TheoryCombinatorial OptimizationData ScienceSpectral TheoryDiscrete MathematicsMathematical ProgrammingApproximation Theory

Publications per year

2014–2022

21

Publications

21

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

Samuel B. Hopkins, Tselil Schramm, Jonathan Shi et al. · 2016 · 107 citations

Mathematical Programming, Spectral Theory, Graph Sparsity +19

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

Shuchi Chawla, Konstantin Makarychev, Tselil Schramm et al. · 2015 · 73 citations

Mathematical Programming, Engineering, Computational Complexity +17

Strongly refuting random CSPs below the spectral threshold

Prasad Raghavendra, Satish Rao, Tselil Schramm · 2017 · 49 citations

Spectral Theory, Mathematical Programming, Engineering +20

Computational barriers to estimation from low-degree polynomials

Tselil Schramm, Alexander S. Wein · The Annals of Statistics · 2022 · 42 citations · Full text

Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors

Ronen Eldan, Miklós Z. Rácz, Tselil Schramm · Random Structures and Algorithms · 2016 · 41 citations

Spectral Theory, Graph Sparsity, Engineering +17

Rows per page

1–5 of 21