Arnab Bhattacharyya
Arnab Bhattacharyya
Verified email at - Homepage
Cited by
Cited by
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
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
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
Approximation algorithms for spanner problems and directed steiner forest
P Berman, A Bhattacharyya, K Makarychev, S Raskhodnikova, ...
Information and Computation 222, 93-107, 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
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
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
Testing linear-invariant non-linear properties
A Bhattacharyya, V Chen, M Sudan, N Xie
arXiv preprint arXiv:0809.2378, 2008
Testing monotonicity of distributions over general partial orders
A Bhattacharyya, E Fischer, R Rubinfeld, P Valiant
Innovations in Computer Science (ICS), 2011
Testing Low Complexity Affine-Invariant Properties
A Bhattacharyya, E Fischer, S Lovett
24th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1337-1355, 2013
Lower bounds for testing triangle-freeness in boolean functions
A Bhattacharyya, N Xie
computational complexity 24 (1), 65-101, 2015
Sample complexity for winner prediction in elections
P Dey, A Bhattacharyya
Proceedings of the 2015 International Conference on Autonomous Agents and …, 2015
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), 1-27, 2018
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH
A Bhattacharyya, S Ghoshal, P Manurangsi
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
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
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
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
Learning and testing causal models with interventions
J Acharya, A Bhattacharyya, C Daskalakis, S Kandasamy
Advances in Neural Information Processing Systems, 9447-9460, 2018
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
Algorithmic regularity for polynomials and applications
A Bhattacharyya, P Hatami, M Tulsiani
Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2015 …, 2015
The system can't perform the operation now. Try again later.
Articles 1–20