default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuprovat Ghoshal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee
, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang:
A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. SODA 2024: 935-961- [c16]Suprovat Ghoshal, Anand Louis:
New Approximation Bounds for Small-Set Vertex Expansion. SODA 2024: 2363-2375 - [i23]Suprovat Ghoshal, Konstantin Makarychev, Yury Makarychev:
Constraint Satisfaction Problems with Advice. CoRR abs/2403.02212 (2024) - 2023
- [c15]Suprovat Ghoshal, Euiwoong Lee:
On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. FOCS 2023: 26-36 - [i22]Suprovat Ghoshal, Euiwoong Lee:
On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. CoRR abs/2308.09667 (2023) - [i21]Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang:
A PTAS for 𝓁0-Low Rank Approximation: Solving Dense CSPs over Reals. CoRR abs/2311.00892 (2023) - [i20]Suprovat Ghoshal, Anand Louis:
New Approximation Bounds for Small-Set Vertex Expansion. CoRR abs/2311.17001 (2023) - 2022
- [j2]Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight approximation bounds for maximum multi-coverage. Math. Program. 192(1): 443-476 (2022) - [c14]Aadirupa Saha, Suprovat Ghoshal:
Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits. AISTATS 2022: 456-482 - [c13]Suprovat Ghoshal, Anand Louis:
Approximating CSPs with Outliers. APPROX/RANDOM 2022: 43:1-43:16 - [c12]Suprovat Ghoshal:
The Biased Homogeneous r-Lin Problem. APPROX/RANDOM 2022: 47:1-47:14 - [c11]Euiwoong Lee, Suprovat Ghoshal:
A characterization of approximability for biased CSPs. STOC 2022: 989-997 - [i19]Suprovat Ghoshal, Euiwoong Lee:
A Characterization of Approximability for Biased CSPs. CoRR abs/2201.04617 (2022) - [i18]Suprovat Ghoshal, Aadirupa Saha:
Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits. CoRR abs/2202.11795 (2022) - [i17]Suprovat Ghoshal, Anand Louis:
Approximating CSPs with Outliers. CoRR abs/2205.11328 (2022) - 2021
- [j1]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. J. ACM 68(3): 16:1-16:40 (2021) - [c10]Suprovat Ghoshal, Anand Louis:
Approximation Algorithms and Hardness for Strong Unique Games. SODA 2021: 414-433 - [c9]Suprovat Ghoshal, Rishi Saket:
Hardness of learning DNFs using halfspaces. STOC 2021: 467-480 - 2020
- [c8]Arnab Bhattacharyya, L. Sunil Chandran, Suprovat Ghoshal:
Combinatorial Lower Bounds for 3-Query LDCs. ITCS 2020: 85:1-85:8 - [c7]Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight Approximation Bounds for Maximum Multi-coverage. IPCO 2020: 66-77 - [i16]Suprovat Ghoshal, Anand Louis:
Approximation Algorithms and Hardness for Strong Unique Games. CoRR abs/2005.08918 (2020)
2010 – 2019
- 2019
- [c6]Suprovat Ghoshal, Anand Louis, Rahul Raychaudhury:
Approximation Algorithms for Partially Colorable Graphs. APPROX-RANDOM 2019: 28:1-28:20 - [i15]Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight Approximation Bounds for Maximum Multi-Coverage. CoRR abs/1905.00640 (2019) - [i14]Suprovat Ghoshal, Anand Louis, Rahul Raychaudhury:
Approximation Algorithms for Partially Colorable Graphs. CoRR abs/1908.11631 (2019) - [i13]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. CoRR abs/1909.01986 (2019) - [i12]Suprovat Ghoshal, Rishi Saket:
Hardness of Learning DNFs using Halfspaces. CoRR abs/1911.06358 (2019) - [i11]Arnab Bhattacharyya, L. Sunil Chandran, Suprovat Ghoshal:
Combinatorial lower bounds for 3-query LDCs. CoRR abs/1911.10698 (2019) - [i10]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. Electron. Colloquium Comput. Complex. TR19 (2019) - [i9]Arnab Bhattacharyya, Philips George John, Suprovat Ghoshal, Raghu Meka:
Average Bias and Polynomial Sources. Electron. Colloquium Comput. Complex. TR19 (2019) - [i8]Suprovat Ghoshal, Rishi Saket:
Hardness of Learning DNFs using Halfspaces. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c5]Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket:
Hardness of Learning Noisy Halfspaces using Polynomial Thresholds. COLT 2018: 876-917 - [c4]Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., Pasin Manurangsi:
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. ICALP 2018: 17:1-17:15 - [c3]Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal:
Testing Sparsity over Known and Unknown Bases. ICML 2018: 500-509 - [i7]Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., Pasin Manurangsi:
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. CoRR abs/1803.09717 (2018) - [i6]Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., Pasin Manurangsi:
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i5]Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket:
Hardness of learning noisy halfspaces using polynomial thresholds. CoRR abs/1707.01795 (2017) - [i4]Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket:
Hardness of learning noisy halfspaces using polynomial thresholds. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c2]Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket:
On the Hardness of Learning Sparse Parities. ESA 2016: 11:1-11:17 - [i3]Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal:
The Dictionary Testing Problem. CoRR abs/1608.01275 (2016) - 2015
- [c1]Arun Rajkumar, Suprovat Ghoshal, Lek-Heng Lim, Shivani Agarwal:
Ranking from Stochastic Pairwise Preferences: Recovering Condorcet Winners and Tournament Solution Sets at the Top. ICML 2015: 665-673 - [i2]Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket:
On the hardness of learning sparse parities. CoRR abs/1511.08270 (2015) - [i1]Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket:
On the hardness of learning sparse parities. Electron. Colloquium Comput. Complex. TR15 (2015)
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-10-28 20:08 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:
