I agree that this site is using cookies. You can find further informations here.
X
Schramm, Tselil
82  results:
Search for persons X
?
1

Semidefinite Programs Simulate Approximate Message Passing ..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Ivkov, Misha ; Schramm, Tselil - p. 348-357 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Testing Thresholds for High-Dimensional Sparse Random Geome..:

Liu, Siqi ; Mohanty, Sidhanth ; Schramm, Tselil.
SIAM Journal on Computing.  , 2024
Link: https://doi.org/10.1137/..
 
?
3

Local and Global Expansion in Random Geometric Graphs:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Liu, Siqi ; Mohanty, Sidhanth ; Schramm, Tselil. - p. 817-825 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

Testing thresholds for high-dimensional sparse random geome..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Liu, Siqi ; Mohanty, Sidhanth ; Schramm, Tselil. - p. 672-677 , 2022
Link: https://dl.acm.org/doi/1..
 
?
5

Playing unique games on certified small-set expanders:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Bafna, Mitali ; Barak, Boaz ; Kothari, Pravesh K... - p. 1629-1642 , 2021
Link: https://dl.acm.org/doi/1..
 
?
6

Subexponential LPs Approximate Max-Cut:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Hopkins, Samuel B. ; Schramm, Tselil ; Trevisan, Luca - p. 943-953 , 2020
Link: https://doi.org/10.1109/..
 
?
7

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

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Deshpande, Yash ; Montanari, Andrea ; O'Donnell, Ryan.. - p. 2305-2321 , 2019
Link: https://dl.acm.org/doi/1..
 
?
8

Sherali-adams strikes back:

, In: Proceedings of the 34th Computational Complexity Conference,
O'Donnell, Ryan ; Schramm, Tselil - p. 1-30 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

On the Integrality Gap of Degree-4 Sum of Squares for Plant..:

Hopkins, Samuel B. ; Kothari, Pravesh ; Potechin, Aaron Henry..
ACM Transactions on Algorithms.  14 (2018)  3 - p. 1-31 , 2018
Link: https://doi.org/10.1145/..
 
?
10

On the Integrality Gap of Degree-4 Sum of Squares for Plant..:

Hopkins, Samuel B. ; Kothari, Pravesh ; Potechin, Aaron Henry..
ACM Transactions on Algorithms (TALG).  14 (2018)  3 - p. 1-31 , 2018
Link: https://dl.acm.org/doi/1..
 
?
11

Strongly refuting random CSPs below the spectral threshold:

, In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing,
Raghavendra, Prasad ; Rao, Satish ; Schramm, Tselil - p. 121-131 , 2017
Link: https://dl.acm.org/doi/1..
 
?
12

On the integrality gap of degree-4 sum of squares for plant..:

, In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms,
Hopkins, Samuel B. ; Kothari, Pravesh ; Potechin, Aaron Henry.. - p. 1079-1095 , 2016
Link: https://dl.acm.org/doi/1..
 
?
13

Braess's paradox for the spectral gap in random graphs and ..:

Eldan, Ronen ; Rácz, Miklós Z. ; Schramm, Tselil
Random Structures & Algorithms.  50 (2016)  4 - p. 584-611 , 2016
Link: https://doi.org/10.1002/..
 
?
14

Fast spectral algorithms from sum-of-squares proofs: tensor..:

, In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing,
Hopkins, Samuel B. ; Schramm, Tselil ; Shi, Jonathan. - p. 178-191 , 2016
Link: https://dl.acm.org/doi/1..
 
?
15

Near Optimal LP Rounding Algorithm for CorrelationClusterin..:

, In: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing,
Chawla, Shuchi ; Makarychev, Konstantin ; Schramm, Tselil. - p. 219-228 , 2015
Link: https://dl.acm.org/doi/1..
 
1-15