Siavosh Benabbas

The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs

Konstantinos Georgiou, Avner Magen, Siavosh Benabbas, 2010, Electron. Colloquium Comput. Complex..

Better Balance by Being Biased

Konstantinos Georgiou, Siavosh Benabbas, Per Austrin, 2016, ACM Trans. Algorithms.

On Quadratic Threshold CSPs

Avner Magen, Siavosh Benabbas, Per Austrin, 2012, Discret. Math. Theor. Comput. Sci..

SDP Gaps from Pairwise Independence

Madhur Tulsiani, Konstantinos Georgiou, Avner Magen, 2012, Theory Comput..

Efficient Sum-Based Hierarchical Smoothing Under \ell_1-Norm pdf

Yuli Ye, Joel Oren, Hyun Chul Lee, 2011, ArXiv.

Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy

Konstantinos Georgiou, Avner Magen, Siu On Chan, 2011, FSTTCS.

Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain

Avner Magen, Siavosh Benabbas, A. Magen, 2010, IPCO.

Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection

Konstantinos Georgiou, Siavosh Benabbas, Per Austrin, 2012, SODA.

Verifiable Delegation of Computation over Large Datasets

Yevgeniy Vahlis, Rosario Gennaro, Siavosh Benabbas, 2011, IACR Cryptol. ePrint Arch..