| Transitive-closure spanners A Bhattacharyya, E Grigorescu, K Jung, S Raskhodnikova, DP Woodruff 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 932-941, 2009 | 94 | 2009 |
| Optimal testing of Reed-Muller codes A Bhattacharyya, S Kopparty, G Schoenebeck, M Sudan, D Zuckerman 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 488-497, 2010 | 71 | 2010 |
| On the convergence of the Hegselmann-Krause system A Bhattacharyya, M Braverman, B Chazelle, HL Nguyen Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013 | 52 | 2013 |
| A unified framework for testing linear-invariant properties A Bhattacharyya, E Grigorescu, A Shapira 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 478-487, 2010 | 48* | 2010 |
| Approximation algorithms for spanner problems and directed steiner forest P Berman, A Bhattacharyya, K Makarychev, S Raskhodnikova, ... Information and Computation 222, 93-107, 2013 | 47* | 2013 |
| Every locally characterized affine-invariant property is testable A Bhattacharyya, E Fischer, H Hatami, P Hatami, S Lovett Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 40 | 2013 |
| Testing linear-invariant non-linear properties A Bhattacharyya, V Chen, M Sudan, N Xie arXiv preprint arXiv:0809.2378, 2008 | 36 | 2008 |
| Lower bounds for testing triangle-freeness in Boolean functions A Bhattacharyya, N Xie computational complexity 24 (1), 65-101, 2015 | 24* | 2015 |
| Testing Low Complexity Affine-Invariant Properties A Bhattacharyya, E Fischer, S Lovett 24th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1337-1355, 2013 | 23 | 2013 |
| Testing monotonicity of distributions over general partial orders A Bhattacharyya, E Fischer, R Rubinfeld, P Valiant Innovations in Computer Science (ICS), 2011 | 23 | 2011 |
| Sample complexity for winner prediction in elections P Dey, A Bhattacharyya Proceedings of the 2015 International Conference on Autonomous Agents and …, 2015 | 17 | 2015 |
| The Complexity of Linear Dependence Problems in Vector Spaces A Bhattacharyya, P Indyk, DP Woodruff, N Xie Innovations in Computer Science-ICS 2011, 496-508, 2011 | 17 | 2011 |
| Lower bounds for local monotonicity reconstruction from transitive-closure spanners A Bhattacharyya, E Grigorescu, M Jha, K Jung, S Raskhodnikova, ... Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 17 | 2010 |
| Tight lower bounds for linear 2-query LCCs over finite fields A Bhattacharyya, Z Dvir, S Saraf, A Shpilka Combinatorica 36 (1), 1-36, 2016 | 16* | 2016 |
| Lower bounds for local monotonicity reconstruction from transitive-closure spanners A Bhattacharyya, E Grigorescu, M Jha, K Jung, S Raskhodnikova, ... 14th International conference on Randomization, and combinatorial …, 2012 | 16 | 2012 |
| An Optimal Algorithm for ℓ 1-Heavy Hitters in Insertion Streams and Related Problems A Bhattacharyya, P Dey, DP Woodruff ACM Transactions on Algorithms (TALG) 15 (1), 2, 2018 | 14 | 2018 |
| Algorithmic regularity for polynomials and applications A Bhattacharyya, P Hatami, M Tulsiani Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2015 …, 2015 | 14 | 2015 |
| Machine learning and statistical analysis for materials science: stability and transferability of fingerprint descriptors and chemical insights P Pankajakshan, S Sanyal, OE de Noord, I Bhattacharya, A Bhattacharyya, ... Chemistry of Materials 29 (10), 4190-4201, 2017 | 13 | 2017 |
| On higher-order fourier analysis over non-prime fields A Bhattacharyya, A Bhowmick, C Gupta Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016 | 11* | 2016 |
| Polynomial decompositions in polynomial time. A Bhattacharyya European Symposium on Algorithms (ESA) 8737, 125-136, 2014 | 11 | 2014 |
Elena GrigorescuPurdue UniversityVerified email at purdue.edu