Follow
Rishi Saket
Title
Cited by
Cited by
Year
Integrality gaps for sparsest cut and minimum linear arrangement problems
NR Devanur, SA Khot, R Saket, NK Vishnoi
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing†…, 2006
1062006
Frame packing algorithms for automotive applications
R Saket, N Navet
Journal of Embedded Computing 2 (1), 93-102, 2006
1022006
SDP Integrality Gaps with Local ell_1-Embeddability
S Khot, R Saket
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 565-574, 2009
702009
On the hardness of learning intersections of two halfspaces
S Khot, R Saket
Journal of Computer and System Sciences 77 (1), 129-141, 2011
472011
Hardness of minimizing and learning DNF expressions
S Khot, R Saket
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 231-240, 2008
372008
Bypassing UGC from some optimal geometric inapproximability results
V Guruswami, P Raghavendra, R Saket, Y Wu
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete†…, 2012
362012
Optimal inapproximability for scheduling problems via structural hardness for hypergraph vertex cover
S Sachdeva, R Saket
2013 IEEE Conference on Computational Complexity, 219-229, 2013
352013
A 3-query non-adaptive PCP with perfect completeness
S Khot, R Saket
21st Annual IEEE Conference on Computational Complexity (CCC'06), 11 pp.-169, 2006
332006
Hardness of reconstructing multivariate polynomials over finite fields
P Gopalan, S Khot, R Saket
SIAM Journal on Computing 39 (6), 2598-2621, 2010
312010
Tight hardness of the non-commutative Grothendieck problem
J BriŽt, O Regev, R Saket
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1108-1122, 2015
272015
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with Colors
S Khot, R Saket
SIAM Journal on Computing 46 (1), 235-271, 2017
242017
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with Colors
S Khot, R Saket
SIAM Journal on Computing 46 (1), 235-271, 2017
242017
Hardness of finding independent sets in 2-colorable and almost 2-colorable hypergraphs
S Khot, R Saket
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete†…, 2014
232014
Hardness of finding independent sets in almost q-colorable graphs
S Khot, R Saket
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 380-389, 2012
222012
Approximate Lasserre integrality gap for unique games
S Khot, P Popat, R Saket
Approximation, Randomization, and Combinatorial Optimization. Algorithms and†…, 2010
222010
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
V Guruswami, R Saket
Automata, Languages and Programming: 37th International Colloquium, ICALP†…, 2010
192010
Bypassing UGC from some optimal geometric inapproximability results
V Guruswami, P Raghavendra, R Saket, Y Wu
ACM Transactions on Algorithms (TALG) 12 (1), 6:1-6:25, 2016
172016
Hardness of finding independent sets in 2-colorable hypergraphs and of satisfiable CSPs
R Saket
2014 IEEE 29th Conference on Computational Complexity (CCC), 78-89, 2014
162014
New and improved bounds for the minimum set cover problem
R Saket, M Sviridenko
Approximation, Randomization, and Combinatorial Optimization. Algorithms and†…, 2012
162012
Inapproximability of Minimum Vertex Cover on -Uniform -Partite Hypergraphs
V Guruswami, S Sachdeva, R Saket
SIAM Journal on Discrete Mathematics 29 (1), 36-58, 2015
122015
The system can't perform the operation now. Try again later.
Articles 1–20