A 3-Query Non-Adaptive PCP with Perfect Completeness. - Subhash Khot; Rishi Saket (CCC, 2006)

Integrality gaps for sparsest cut and minimum linear arrangement problems. - Nikhil R. Devanur; Subhash Khot; Rishi Saket; Nisheeth K. Vishnoi (STOC, 2006)

Frame packing algorithms for automotive applications. - Rishi Saket; Nicolas Navet (J. Embed. Comput., 2006)

Hardness of Embedding Metric Spaces of Equal Size. - Subhash Khot; Rishi Saket (APPROX-RANDOM, 2007)

Hardness of Minimizing and Learning DNF Expressions. - Subhash Khot; Rishi Saket (FOCS, 2008)

On hardness of learning intersection of two halfspaces. - Subhash Khot; Rishi Saket (STOC, 2008)

SDP Integrality Gaps with Local ell_1-Embeddability. - Subhash Khot; Rishi Saket (FOCS, 2009)

Intractability results for problems in computational learning and approximation. - Rishi Saket (2009)

Approximate Lasserre Integrality Gap for Unique Games. - Subhash Khot; Preyas Popat; Rishi Saket (APPROX-RANDOM, 2010)

Quasi-Random PCP and Hardness of 2-Catalog Segmentation. - Rishi Saket (FSTTCS, 2010)

On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs. - Venkatesan Guruswami; Rishi Saket (ICALP (1), 2010)

Bypassing UGC from some optimal geometric inapproximability results. - Venkatesan Guruswami; Prasad Raghavendra; Rishi Saket; Yi Wu 002 (Electron. Colloquium Comput. Complex., 2010)

Hardness of Reconstructing Multivariate Polynomials over Finite Fields. - Parikshit Gopalan; Subhash Khot; Rishi Saket (SIAM J. Comput., 2010)

Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs. - Sushant Sachdeva; Rishi Saket (APPROX-RANDOM, 2011)

On the hardness of learning intersections of two halfspaces. - Subhash Khot; Rishi Saket (J. Comput. Syst. Sci., 2011)

New and Improved Bounds for the Minimum Set Cover Problem. - Rishi Saket; Maxim Sviridenko (APPROX-RANDOM, 2012)

Hardness of Finding Independent Sets in Almost q-Colorable Graphs. - Subhash Khot; Rishi Saket (FOCS, 2012)

Stochastic Vehicle Routing with Recourse. - Inge Li Gørtz; Viswanath Nagarajan; Rishi Saket (ICALP (1), 2012)

The Approximability of the Binary Paintshop Problem. - Anupam Gupta 001; Satyen Kale; Viswanath Nagarajan; Rishi Saket; Baruch Schieber (APPROX-RANDOM, 2013)

Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover. - Sushant Sachdeva; Rishi Saket (CCC, 2013)

A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure. - Rishi Saket (CoRR, 2013)

Inapproximability of Minimum Vertex Cover on k-uniform k-partite Hypergraphs. - Venkatesan Guruswami; Sushant Sachdeva; Rishi Saket (Electron. Colloquium Comput. Complex., 2013)

Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. - Rishi Saket (CCC, 2014)

Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors. - Subhash Khot; Rishi Saket (FOCS, 2014)

Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs. - Subhash Khot; Rishi Saket (SODA, 2014)

Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2log nΩ(1) Colors. - Subhash Khot; Rishi Saket (Electron. Colloquium Comput. Complex., 2014)

On the hardness of learning sparse parities. - Arnab Bhattacharyya 001; Ameet Gadekar; Suprovat Ghoshal; Rishi Saket (Electron. Colloquium Comput. Complex., 2015)

Hardness of Bipartite Expansion. - Subhash Khot; Rishi Saket (ESA, 2016)

Approximating CSPs using LP Relaxation. - Subhash Khot; Rishi Saket (Electron. Colloquium Comput. Complex., 2016)

Approximation Algorithms for Stochastic k-TSP. - Alina Ene; Viswanath Nagarajan; Rishi Saket (FSTTCS, 2017)

On the Approximability of Digraph Ordering. - Sreyash Kenkre; Vinayaka Pandit; Manish Purohit; Rishi Saket (Algorithmica, 2017)

Hardness of learning noisy halfspaces using polynomial thresholds. - Arnab Bhattacharyya 001; Suprovat Ghoshal; Rishi Saket (Electron. Colloquium Comput. Complex., 2017)

Hardness of Rainbow Coloring Hypergraphs. - Venkatesan Guruswami; Rishi Saket (Electron. Colloquium Comput. Complex., 2017)

Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2(log n)Ømega(1) Colors. - Subhash Khot; Rishi Saket (SIAM J. Comput., 2017)

Tight Hardness of the Non-Commutative Grothendieck Problem. - Jop Briët; Oded Regev 001; Rishi Saket (Theory Comput., 2017)

Hardness of Learning DNFs using Halfspaces. - Suprovat Ghoshal; Rishi Saket (Electron. Colloquium Comput. Complex., 2019)

Smart Contract Protocol for Authenticity and Compliance with Anonymity on Hyperledger Fabric. - Rishi Saket; Nitin Singh; Pankaj Dayama 001; Vinayaka Pandit (IEEE ICBC, 2020)

Learnability of Linear Thresholds from Label Proportions. - Rishi Saket (NeurIPS, 2021)

On Combining Bags to Better Learn from Label Proportions. - Rishi Saket; Aravindan Raghuveer; Balaraman Ravindran (AISTATS, 2022)

Domain-Agnostic Contrastive Representations for Learning from Label Proportions. - Jay Nandy; Rishi Saket; Prateek Jain; Jatin Chauhan; Balaraman Ravindran; Aravindan Raghuveer (CIKM, 2022)

Multi-Variate Time Series Forecasting on Variable Subsets. - Jatin Chauhan; Aravindan Raghuveer; Rishi Saket; Jay Nandy; Balaraman Ravindran (KDD, 2022)

Algorithms and Hardness for Learning Linear Thresholds from Label Proportions. - Rishi Saket (NeurIPS, 2022)

Non-Uniform Adversarial Perturbations for Discrete Tabular Datasets. - Jay Nandy; Jatin Chauhan; Rishi Saket; Aravindan Raghuveer (CIKM, 2023)

Hardness of Learning Boolean Functions from Label Proportions. - Venkatesan Guruswami; Rishi Saket (FSTTCS, 2023)

PAC Learning Linear Thresholds from Label Proportions. - Anand Brahmbhatt; Rishi Saket; Aravindan Raghuveer (NeurIPS, 2023)

Label Differential Privacy via Aggregation. - Anand Brahmbhatt; Rishi Saket; Shreyas Havaldar; Anshul Nasery; Aravindan Raghuveer (CoRR, 2023)

LLP-Bench: A Large Scale Tabular Benchmark for Learning from Label Proportions. - Anand Brahmbhatt; Mohith Pokala; Rishi Saket; Aravindan Raghuveer (CIKM, 2024)

Generalization and Learnability in Multiple Instance Regression. - Kushal Chauhan; Rishi Saket; Lorne Applebaum; Ashwinkumar Badanidiyuru; Chandan Giri; Aravindan Raghuveer (UAI, 2024)

Aggregating Data for Optimal and Private Learning. - Sushant Agarwal; Yukti Makhija; Rishi Saket; Aravindan Raghuveer (CoRR, 2024)

FRACTAL: Fine-Grained Scoring from Aggregate Text Labels. - Yukti Makhija; Priyanka Agrawal; Rishi Saket; Aravindan Raghuveer (ACL (1), 2025)

Aggregating Data for Optimal Learning. - Sushant Agarwal; Yukti Makhija; Rishi Saket; Aravindan Raghuveer (UAI, 2025)

Learning Algorithms for Multiple Instance Regression. - Aaryan Gupta; Rishi Saket (UAI, 2025)

Weak to Strong Learning from Aggregate Labels. - Yukti Makhija; Rishi Saket (UAI, 2025)

Learning from Label Proportions and Covariate-shifted Instances. - Sagalpreet Singh; Navodita Sharma; Shreyas Havaldar; Rishi Saket; Aravindan Raghuveer (UAI, 2025)