default search action
Rishi Saket
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c39]Anand Brahmbhatt
, Mohith Pokala
LLP-Bench: A Large Scale Tabular Benchmark for Learning from Label Proportions. CIKM 2024: 4374-4381 - [i25]Venkatesan Guruswami, Rishi Saket:
Hardness of Learning Boolean Functions from Label Proportions. CoRR abs/2403.19401 (2024) - [i24]Yukti Makhija, Priyanka Agrawal, Rishi Saket, Aravindan Raghuveer:
FRACTAL: Fine-Grained Scoring from Aggregate Text Labels. CoRR abs/2404.04817 (2024) - 2023
- [c38]Jay Nandy
Non-Uniform Adversarial Perturbations for Discrete Tabular Datasets. CIKM 2023: 1887-1896 - [c37]Venkatesan Guruswami, Rishi Saket:
Hardness of Learning Boolean Functions from Label Proportions. FSTTCS 2023: 37:1-37:15 - [c36]Anand Brahmbhatt, Rishi Saket, Aravindan Raghuveer:
PAC Learning Linear Thresholds from Label Proportions. NeurIPS 2023 - [i23]Anand Brahmbhatt, Rishi Saket, Shreyas Havaldar, Anshul Nasery, Aravindan Raghuveer:
Label Differential Privacy via Aggregation. CoRR abs/2310.10092 (2023) - [i22]Anand Brahmbhatt, Mohith Pokala, Rishi Saket, Aravindan Raghuveer:
LLP-Bench: A Large Scale Tabular Benchmark for Learning from Label Proportions. CoRR abs/2310.10096 (2023) - [i21]Anand Brahmbhatt, Rishi Saket, Aravindan Raghuveer:
PAC Learning Linear Thresholds from Label Proportions. CoRR abs/2310.10098 (2023) - 2022
- [c35]Rishi Saket, Aravindan Raghuveer, Balaraman Ravindran:
On Combining Bags to Better Learn from Label Proportions. AISTATS 2022: 5913-5927 - [c34]Jay Nandy, Rishi Saket, Prateek Jain, Jatin Chauhan, Balaraman Ravindran, Aravindan Raghuveer:
Domain-Agnostic Contrastive Representations for Learning from Label Proportions. CIKM 2022: 1542-1551 - [c33]Jatin Chauhan, Aravindan Raghuveer, Rishi Saket, Jay Nandy, Balaraman Ravindran:
Multi-Variate Time Series Forecasting on Variable Subsets. KDD 2022: 76-86 - [c32]Rishi Saket:
Algorithms and Hardness for Learning Linear Thresholds from Label Proportions. NeurIPS 2022 - [i20]Jatin Chauhan, Aravindan Raghuveer, Rishi Saket, Jay Nandy, Balaraman Ravindran:
Multi-Variate Time Series Forecasting on Variable Subsets. CoRR abs/2206.12626 (2022) - 2021
- [c31]Rishi Saket:
Learnability of Linear Thresholds from Label Proportions. NeurIPS 2021: 6555-6566 - [c30]Suprovat Ghoshal, Rishi Saket:
Hardness of learning DNFs using halfspaces. STOC 2021: 467-480 - 2020
- [c29]Rishi Saket, Nitin Singh, Pankaj Dayama, Vinayaka Pandit:
Smart Contract Protocol for Authenticity and Compliance with Anonymity on Hyperledger Fabric. IEEE ICBC 2020: 1-9
2010 – 2019
- 2019
- [i19]Suprovat Ghoshal, Rishi Saket:
Hardness of Learning DNFs using Halfspaces. CoRR abs/1911.06358 (2019) - [i18]Suprovat Ghoshal, Rishi Saket:
Hardness of Learning DNFs using Halfspaces. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c28]Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket:
Hardness of Learning Noisy Halfspaces using Polynomial Thresholds. COLT 2018: 876-917 - 2017
- [j8]Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket:
On the Approximability of Digraph Ordering. Algorithmica 78(4): 1182-1205 (2017) - [j7]Subhash Khot, Rishi Saket:
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2(log n)Ømega(1) Colors. SIAM J. Comput. 46(1): 235-271 (2017) - [j6]Jop Briët, Oded Regev, Rishi Saket:
Tight Hardness of the Non-Commutative Grothendieck Problem. Theory Comput. 13(1): 1-24 (2017) - [c27]Alina Ene, Viswanath Nagarajan, Rishi Saket:
Approximation Algorithms for Stochastic k-TSP. FSTTCS 2017: 27:27-27:14 - [c26]Venkatesan Guruswami, Rishi Saket:
Hardness of Rainbow Coloring Hypergraphs. FSTTCS 2017: 33:33-33:15 - [i17]Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket:
Hardness of learning noisy halfspaces using polynomial thresholds. CoRR abs/1707.01795 (2017) - [i16]Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket:
Hardness of learning noisy halfspaces using polynomial thresholds. Electron. Colloquium Comput. Complex. TR17 (2017) - [i15]Venkatesan Guruswami, Rishi Saket:
Hardness of Rainbow Coloring Hypergraphs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j5]Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from Some Optimal Geometric Inapproximability Results. ACM Trans. Algorithms 12(1): 6:1-6:25 (2016) - [c25]Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket:
On the Hardness of Learning Sparse Parities. ESA 2016: 11:1-11:17 - [c24]Subhash Khot, Rishi Saket:
Hardness of Bipartite Expansion. ESA 2016: 55:1-55:17 - [i14]Alina Ene, Viswanath Nagarajan, Rishi Saket:
Approximation Algorithms for Stochastic k-TSP. CoRR abs/1610.01058 (2016) - [i13]Subhash Khot, Rishi Saket:
Approximating CSPs using LP Relaxation. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j4]Venkatesan Guruswami, Sushant Sachdeva
Inapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs. SIAM J. Discret. Math. 29(1): 36-58 (2015) - [c23]Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket:
On the Approximability of Digraph Ordering. ESA 2015: 792-803 - [c22]Jop Briët, Oded Regev, Rishi Saket:
Tight Hardness of the Non-commutative Grothendieck Problem. FOCS 2015: 1108-1122 - [c21]Subhash Khot, Rishi Saket:
Approximating CSPs Using LP Relaxation. ICALP (1) 2015: 822-833 - [i12]Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket:
On the Approximability of Digraph Ordering. CoRR abs/1507.00662 (2015) - [i11]Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket:
On the hardness of learning sparse parities. CoRR abs/1511.08270 (2015) - [i10]Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket:
On the hardness of learning sparse parities. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c20]Rishi Saket:
Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. CCC 2014: 78-89 - [c19]Subhash Khot, Rishi Saket:
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors. FOCS 2014: 206-215 - [c18]Subhash Khot, Rishi Saket:
Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs. SODA 2014: 1607-1625 - [i9]Subhash Khot, Rishi Saket:
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2log nΩ(1) Colors. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c17]Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber:
The Approximability of the Binary Paintshop Problem. APPROX-RANDOM 2013: 205-217 - [c16]Sushant Sachdeva
Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover. CCC 2013: 219-229 - [i8]Rishi Saket:
A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure. CoRR abs/1306.6943 (2013) - [i7]Subhash Khot, Rishi Saket:
Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs. CoRR abs/1308.3247 (2013) - [i6]Rishi Saket:
Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. CoRR abs/1312.2915 (2013) - [i5]Venkatesan Guruswami, Sushant Sachdeva, Rishi Saket:
Inapproximability of Minimum Vertex Cover on k-uniform k-partite Hypergraphs. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c15]Rishi Saket, Maxim Sviridenko:
New and Improved Bounds for the Minimum Set Cover Problem. APPROX-RANDOM 2012: 288-300 - [c14]Subhash Khot, Rishi Saket:
Hardness of Finding Independent Sets in Almost q-Colorable Graphs. FOCS 2012: 380-389 - [c13]Inge Li Gørtz
Stochastic Vehicle Routing with Recourse. ICALP (1) 2012: 411-423 - [c12]Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from some optimal geometric inapproximability results. SODA 2012: 699-717 - [i4]Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket:
Stochastic Vehicle Routing with Recourse. CoRR abs/1202.5797 (2012) - 2011
- [j3]Subhash Khot, Rishi Saket:
On the hardness of learning intersections of two halfspaces. J. Comput. Syst. Sci. 77(1): 129-141 (2011) - [c11]Sushant Sachdeva
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs. APPROX-RANDOM 2011: 327-338 - [i3]Sushant Sachdeva, Rishi Saket:
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs. CoRR abs/1105.4175 (2011) - 2010
- [j2]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. SIAM J. Comput. 39(6): 2598-2621 (2010) - [c10]Subhash Khot, Preyas Popat, Rishi Saket:
Approximate Lasserre Integrality Gap for Unique Games. APPROX-RANDOM 2010: 298-311 - [c9]Rishi Saket:
Quasi-Random PCP and Hardness of 2-Catalog Segmentation. FSTTCS 2010: 447-458 - [c8]Venkatesan Guruswami, Rishi Saket:
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs. ICALP (1) 2010: 360-371 - [i2]Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from some optimal geometric inapproximability results. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c7]Subhash Khot, Rishi Saket:
SDP Integrality Gaps with Local ell_1-Embeddability. FOCS 2009: 565-574 - 2008
- [c6]Subhash Khot, Rishi Saket:
Hardness of Minimizing and Learning DNF Expressions. FOCS 2008: 231-240 - [c5]Subhash Khot, Rishi Saket:
On hardness of learning intersection of two halfspaces. STOC 2008: 345-354 - 2007
- [c4]Subhash Khot, Rishi Saket:
Hardness of Embedding Metric Spaces of Equal Size. APPROX-RANDOM 2007: 218-227 - [c3]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. FOCS 2007: 349-359 - [i1]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j1]Rishi Saket, Nicolas Navet:
Frame packing algorithms for automotive applications. J. Embed. Comput. 2(1): 93-102 (2006) - [c2]Subhash Khot, Rishi Saket:
A 3-Query Non-Adaptive PCP with Perfect Completeness. CCC 2006: 159-169 - [c1]Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi:
Integrality gaps for sparsest cut and minimum linear arrangement problems. STOC 2006: 537-546
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: