☰

Ragesh Jaiswal, Ph.D. - Publications

Affiliations: 
2008 Computer Science and Engineering University of California, San Diego, La Jolla, CA 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

16 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Jaiswal R. A note on the relation between XOR and Selective XOR Lemmas Information Processing Letters. 163: 106011. DOI: 10.1016/J.Ipl.2020.106011  0.372
2018 Bhattacharya A, Issac D, Jaiswal R, Kumar A. Sampling in Space Restricted Settings Algorithmica. 80: 1439-1458. DOI: 10.1007/S00453-017-0335-Z  0.309
2016 Bhattacharya A, Jaiswal R, Kumar A. Faster algorithms for the constrained k-means problem Leibniz International Proceedings in Informatics, Lipics. 47. DOI: 10.1007/S00224-017-9820-7  0.447
2015 Bhattacharya A, Jaiswal R, Ailon N. Tight lower bound instances for k-means++ in two dimensions Theoretical Computer Science. DOI: 10.1016/J.Tcs.2016.04.012  0.465
2015 Agarwal M, Jaiswal R, Pal A. K-Means++ under approximation stability Theoretical Computer Science. 588: 37-51. DOI: 10.1016/J.Tcs.2015.04.030  0.421
2015 Jaiswal R, Kumar M, Yadav P. Improved analysis of D2-sampling based PTAS for k-means and other clustering problems Information Processing Letters. 115: 100-103. DOI: 10.1016/J.Ipl.2014.07.009  0.334
2014 Jaiswal R, Kumar A, Sen S. A simple D 2-sampling based PTAS for k-means and other clustering problems Algorithmica. 70: 22-46. DOI: 10.1007/S00453-013-9833-9  0.408
2014 Bhattacharya A, Jaiswal R, Ailon N. A tight lower bound instance for k-means++ in constant dimension Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8402: 7-22. DOI: 10.1007/978-3-319-06089-7_2  0.377
2013 Agarwal M, Jaiswal R, Pal A. K-means++ under approximation stability Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7876: 84-95. DOI: 10.1007/978-3-642-38236-9_9  0.321
2012 Jaiswal R, Garg N. Analysis of k-means++ for separable data Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7408: 591-602. DOI: 10.1007/978-3-642-32512-0_50  0.375
2010 Diakonikolas I, Gopalan P, Jaiswal R, Servedio RA, Viola E. Bounded independence fools halfspaces Siam Journal On Computing. 39: 3441-3462. DOI: 10.1137/100783030  0.414
2009 Impagliazzo R, Jaiswal R, Kabanets V. Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification Siam Journal On Computing. 39: 564-605. DOI: 10.1137/070683994  0.617
2009 Impagliazzo R, Jaiswal R, Kabanets V. Chernoff-type direct product theorems Journal of Cryptology. 22: 75-92. DOI: 10.1007/S00145-008-9029-7  0.518
2009 Ailon N, Jaiswal R, Monteleoni C. Streaming k-means approximation Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference. 10-18.  0.323
2008 Impagliazzo R, Jaiswal R, Kabanets V, Wigderson A. Uniform direct product theorems: Simplified, optimized, and derandomized Proceedings of the Annual Acm Symposium On Theory of Computing. 579-588. DOI: 10.1137/080734030  0.616
2006 Impagliazzo R, Jaiswal R, Kabanets V. Approximately list-decoding direct product codes and uniform hardness amplification Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 187-196. DOI: 10.1109/FOCS.2006.13  0.621
Show low-probability matches.