Siavosh Benabbas

13 papers A* 2B 2Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2016 J jnl
Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection.
ACM Trans. Algorithms
Per Austrin, Siavosh Benabbas, Konstantinos Georgiou
2013 A* conf
Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection.
SODA
Per Austrin, Siavosh Benabbas, Konstantinos Georgiou
2012 J jnl
Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
CoRR
Per Austrin, Siavosh Benabbas, Konstantinos Georgiou
2012 — —
On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems.
Siavosh Benabbas
2012 J jnl
On Quadratic Threshold CSPs.
Discret. Math. Theor. Comput. Sci.
Per Austrin, Siavosh Benabbas, Avner Magen
2012 J jnl
SDP Gaps from Pairwise Independence.
Theory Comput.
Siavosh Benabbas, Konstantinos Georgiou, Avner Magen, Madhur Tulsiani
2011 J jnl
Efficient Sum-Based Hierarchical Smoothing Under \ell_1-Norm
CoRR
Siavosh Benabbas, Hyun Chul Lee, Joel Oren, Yuli Ye
2011 — conf
Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy.
FSTTCS
Siavosh Benabbas, Siu On Chan, Konstantinos Georgiou, Avner Magen
2011 A* conf
Verifiable Delegation of Computation over Large Datasets.
CRYPTO
Siavosh Benabbas, Rosario Gennaro, Yevgeniy Vahlis
2011 J jnl
Verifiable Delegation of Computation over Large Datasets.
IACR Cryptol. ePrint Arch.
Siavosh Benabbas, Rosario Gennaro, Yevgeniy Vahlis
2010 B conf
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain.
IPCO
Siavosh Benabbas, Avner Magen
2010 B conf
On Quadratic Threshold CSPs.
LATIN
Per Austrin, Siavosh Benabbas, Avner Magen
2010 J jnl
The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs.
Electron. Colloquium Comput. Complex.
Siavosh Benabbas, Konstantinos Georgiou, Avner Magen