default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRagesh Jaiswal
2020 – today
- 2025
[i30]Poojan Shah, Shashwat Agrawal, Ragesh Jaiswal:
A New Rejection Sampling Approach to k-means++ With Improved Trade-Offs. CoRR abs/2502.02085 (2025)- [i29]Ragesh Jaiswal, Amit Kumar, Jatin Yadav:
Robust-Sorting and Applications to Ulam-Median. CoRR abs/2502.07653 (2025) - 2024
- [c23]Ragesh Jaiswal, Amit Kumar:
Universal Weak Coreset. AAAI 2024: 12782-12789 - [c22]Ragesh Jaiswal, Amit Kumar, Jatin Yadav
:
FPT Approximation for Capacitated Sum of Radii. ITCS 2024: 65:1-65:21 - [i28]Ragesh Jaiswal, Amit Kumar, Jatin Yadav:
FPT Approximation for Capacitated Sum of Radii. CoRR abs/2401.06714 (2024) - [i27]Ragesh Jaiswal, Poojan Shah:
Quantum (Inspired) D2-sampling with Applications. CoRR abs/2405.13351 (2024) - 2023
- [j15]Dishant Goyal, Ragesh Jaiswal:
Tight FPT Approximation for Socially Fair Clustering. Inf. Process. Lett. 182: 106383 (2023) - [j14]Dishant Goyal, Ragesh Jaiswal:
Tight FPT approximation for constrained k-center and k-supplier. Theor. Comput. Sci. 940(Part): 190-208 (2023) - [c21]Ragesh Jaiswal, Amit Kumar:
Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions. ISAAC 2023: 41:1-41:16 - [i26]Ragesh Jaiswal, Amit Kumar:
Clustering What Matters in Constrained Settings. CoRR abs/2305.00175 (2023) - [i25]Ragesh Jaiswal, Amit Kumar:
Universal Weak Coreset. CoRR abs/2305.16890 (2023) - [i24]Ragesh Jaiswal:
A Quantum Approximation Scheme for k-Means. CoRR abs/2308.08167 (2023) - 2022
- [j13]Anup Bhattacharya, Yoav Freund, Ragesh Jaiswal:
On the k-means/median cost function. Inf. Process. Lett. 177: 106252 (2022) - 2021
- [c20]Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal:
Hardness of Approximation for Euclidean k-Median. APPROX-RANDOM 2021: 4:1-4:23 - [i23]Dishant Goyal, Ragesh Jaiswal:
FPT Approximation for Socially Fair Clustering. CoRR abs/2106.06755 (2021) - [i22]Dishant Goyal, Ragesh Jaiswal:
Tight FPT Approximation for Constrained k-Center and k-Supplier. CoRR abs/2110.14242 (2021) - 2020
- [j12]Ragesh Jaiswal:
A note on the relation between XOR and Selective XOR lemmas. Inf. Process. Lett. 163: 106011 (2020) - [c19]Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar:
On Sampling Based Algorithms for k-Means. FSTTCS 2020: 13:1-13:17 - [c18]Dishant Goyal, Ragesh Jaiswal, Amit Kumar:
FPT Approximation for Constrained Metric k-Median/Means. IPEC 2020: 14:1-14:19 - [c17]Ragesh Jaiswal, Amit Kumar:
Multiplicative Rank-1 Approximation using Length-Squared Sampling. SOSA 2020: 18-23 - [i21]Dishant Goyal, Ragesh Jaiswal, Amit Kumar:
FPT Approximation for Constrained Metric k-Median/Means. CoRR abs/2007.11773 (2020) - [i20]Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal:
Hardness of Approximation of Euclidean k-Median. CoRR abs/2011.04221 (2020)
2010 – 2019
- 2019
- [i19]Dishant Goyal, Ragesh Jaiswal, Amit Kumar:
Streaming PTAS for Constrained k-Means. CoRR abs/1909.07511 (2019) - [i18]Ragesh Jaiswal, Amit Kumar:
Multiplicative Rank-1 Approximation using Length-Squared Sampling. CoRR abs/1909.07515 (2019) - [i17]Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar:
Streaming PTAS for Binary 𝓁0-Low Rank Approximation. CoRR abs/1909.11744 (2019) - [i16]Ragesh Jaiswal:
A note on the relation between XOR and Selective XOR Lemmas. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j11]Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar:
Sampling in Space Restricted Settings. Algorithmica 80(5): 1439-1458 (2018) - [j10]Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Faster Algorithms for the Constrained k-means Problem. Theory Comput. Syst. 62(1): 93-115 (2018) - [c16]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Approximate Clustering with Same-Cluster Queries. ITCS 2018: 40:1-40:21 - [c15]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal:
Approximate Correlation Clustering Using Same-Cluster Queries. LATIN 2018: 14-27 - [p1]Ragesh Jaiswal, Sandeep Sen:
Approximate Clustering. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [i15]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Approximate Clustering with Same-Cluster Queries. CoRR abs/1704.01862 (2017) - [i14]Anup Bhattacharya, Ragesh Jaiswal:
On the k-Means/Median Cost Function. CoRR abs/1704.05232 (2017) - [i13]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal:
Approximate Correlation Clustering Using Same-Cluster Queries. CoRR abs/1712.06865 (2017) - 2016
- [j9]Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
Tight lower bound instances for k-means++ in two dimensions. Theor. Comput. Sci. 634: 55-66 (2016) - [c14]Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Faster Algorithms for the Constrained k-Means Problem. STACS 2016: 16:1-16:13 - [c13]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro:
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. TCC (B1) 2016: 235-261 - [i12]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro:
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. IACR Cryptol. ePrint Arch. 2016: 760 (2016) - 2015
- [j8]Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan:
Noise Stable Halfspaces are Close to Very Small Juntas. Chic. J. Theor. Comput. Sci. 2015 (2015) - [j7]Ragesh Jaiswal, Mehul Kumar, Pulkit Yadav:
Improved analysis of D2-sampling based PTAS for k-means and other clustering problems. Inf. Process. Lett. 115(2): 100-103 (2015) - [j6]Manu Agarwal, Ragesh Jaiswal, Arindam Pal:
k-Means++ under approximation stability. Theor. Comput. Sci. 588: 37-51 (2015) - [c12]Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar:
Sampling in Space Restricted Settings. COCOON 2015: 483-494 - [i11]Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Faster Algorithms for the Constrained k-means Problem. CoRR abs/1504.02564 (2015) - 2014
- [j5]Ragesh Jaiswal, Amit Kumar, Sandeep Sen:
A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. Algorithmica 70(1): 22-46 (2014) - [c11]Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
A Tight Lower Bound Instance for k-means++ in Constant Dimension. TAMC 2014: 7-22 - [i10]Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
A tight lower bound instance for k-means++ in constant dimension. CoRR abs/1401.2912 (2014) - [i9]Ragesh Jaiswal, Mehul Kumar, Pulkit Yadav:
Improved analysis of D2-sampling based PTAS for k-means and other Clustering problems. CoRR abs/1401.3685 (2014) - [i8]Ragesh Jaiswal:
On Uniform Reductions between Direct Product and XOR Lemmas. CoRR abs/1404.5169 (2014) - [i7]Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar:
Sampling in Space Restricted Settings. CoRR abs/1407.1689 (2014) - 2013
- [c10]Manu Agarwal, Ragesh Jaiswal, Arindam Pal:
k-means++ under Approximation Stability. TAMC 2013: 84-95 - [i6]Ragesh Jaiswal, Prachi Jain, Saumya Yadav:
A bad 2-dimensional instance for k-means++. CoRR abs/1306.4207 (2013) - 2012
- [c9]Ragesh Jaiswal, Nitin Garg:
Analysis of k-Means++ for Separable Data. APPROX-RANDOM 2012: 591-602 - [c8]Ragesh Jaiswal, Amit Kumar, Sandeep Sen:
A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems. COCOON 2012: 13-24 - [c7]Raghav Bhaskar, Ragesh Jaiswal, Sidharth Telang:
Congestion lower bounds for secure in-network aggregation. WISEC 2012: 197-204 - [i5]Ragesh Jaiswal, Amit Kumar, Sandeep Sen:
A simple D^2-sampling based PTAS for k-means and other Clustering Problems. CoRR abs/1201.4206 (2012) - [i4]Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan:
On the Distribution of the Fourier Spectrum of Halfspaces. CoRR abs/1202.6680 (2012) - 2010
- [j4]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson:
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. SIAM J. Comput. 39(4): 1637-1665 (2010) - [j3]Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola:
Bounded Independence Fools Halfspaces. SIAM J. Comput. 39(8): 3441-3462 (2010)
2000 – 2009
- 2009
- [j2]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Chernoff-Type Direct Product Theorems. J. Cryptol. 22(1): 75-92 (2009) - [j1]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification. SIAM J. Comput. 39(2): 564-605 (2009) - [c6]Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola:
Bounded Independence Fools Halfspaces. FOCS 2009: 171-180 - [c5]Nir Ailon, Ragesh Jaiswal, Claire Monteleoni:
Streaming k-means approximation. NIPS 2009: 10-18 - [c4]Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Security Amplification for InteractiveCryptographic Primitives. TCC 2009: 128-145 - [i3]Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola:
Bounded Independence Fools Halfspaces. CoRR abs/0902.3757 (2009) - [i2]Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola:
Bounded Independence Fools Halfspaces. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [b1]Ragesh Jaiswal:
New proofs of (new) Direct Product Theorems. University of California, San Diego, USA, 2008 - [c3]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson:
Uniform direct product theorems: simplified, optimized, and derandomized. STOC 2008: 579-588 - [i1]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson:
Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c2]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Chernoff-Type Direct Product Theorems. CRYPTO 2007: 500-516 - 2006
- [c1]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. FOCS 2006: 187-196
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.
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.
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.
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 2025-03-13 20:22 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:
