Arnab Bhattacharyya

651 total citations
34 papers, 220 citations indexed

About

Arnab Bhattacharyya is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Arnab Bhattacharyya has authored 34 papers receiving a total of 220 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Artificial Intelligence, 23 papers in Computational Theory and Mathematics and 6 papers in Computer Networks and Communications. Recurrent topics in Arnab Bhattacharyya's work include Complexity and Algorithms in Graphs (20 papers), Advanced Graph Theory Research (9 papers) and Machine Learning and Algorithms (7 papers). Arnab Bhattacharyya is often cited by papers focused on Complexity and Algorithms in Graphs (20 papers), Advanced Graph Theory Research (9 papers) and Machine Learning and Algorithms (7 papers). Arnab Bhattacharyya collaborates with scholars based in United States, Singapore and India. Arnab Bhattacharyya's co-authors include Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Kyomin Jung, Madhu Sudan, A. Shapira, Swastik Kopparty, Grant Schoenebeck, David Zuckerman and Eldar Fischer and has published in prestigious journals such as Communications of the ACM, Artificial Intelligence and SIAM Journal on Computing.

In The Last Decade

Arnab Bhattacharyya

32 papers receiving 203 citations

Peers

Arnab Bhattacharyya

CTM

CNC

DMC

CGCD

Kevin Matulef United States

Madhur Tulsiani United States

Satyanarayana V. Lokam United States

Thomas Dueholm Hansen Denmark

Jakub Onufry Wojtaszczyk Poland

Holger Dell Germany

Jesper Nederlof Netherlands

Ramprasad Saptharishi India

Louay Bazzi Lebanon

Thatchaphol Saranurak United States

Kevin Matulef United States

Arnab Bhattacharyya

146 ×0.9

CTM

122 ×0.9

48 ×0.9

CNC

13 ×0.5

DMC

9 ×0.6

CGCD

Citations per year, relative to Arnab Bhattacharyya Arnab Bhattacharyya (= 1×) peers Kevin Matulef

Countries citing papers authored by Arnab Bhattacharyya

Since Specialization

Citations

This map shows the geographic impact of Arnab Bhattacharyya's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Arnab Bhattacharyya with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arnab Bhattacharyya more than expected).

Fields of papers citing papers by Arnab Bhattacharyya

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Arnab Bhattacharyya. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Arnab Bhattacharyya. The network helps show where Arnab Bhattacharyya may publish in the future.

Co-authorship network of co-authors of Arnab Bhattacharyya

This figure shows the co-authorship network connecting the top 25 collaborators of Arnab Bhattacharyya. A scholar is included among the top collaborators of Arnab Bhattacharyya based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Arnab Bhattacharyya. Arnab Bhattacharyya is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Bhattacharyya, Arnab, et al.. (2023). On Approximating Total Variation Distance. 3479–3487. 3 indexed citations

Pavan, A., Kuldeep S. Meel, N. V. Vinodchandran, & Arnab Bhattacharyya. (2023). Constraint Optimization over Semirings. Proceedings of the AAAI Conference on Artificial Intelligence. 37(4). 4070–4077. 1 indexed citations

Bhattacharyya, Arnab, et al.. (2023). Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu. SIAM Journal on Computing. 52(3). 761–793. 2 indexed citations

Bhattacharyya, Arnab, et al.. (2022). Identifiability of Linear AMP Chain Graph Models. Proceedings of the AAAI Conference on Artificial Intelligence. 36(9). 10080–10089. 3 indexed citations

Bhattacharyya, Arnab & Palash Dey. (2021). Predicting winner and estimating margin of victory in elections using sampling. Artificial Intelligence. 296. 103476–103476. 2 indexed citations

Bhattacharyya, Arnab, et al.. (2020). Learning and Sampling of Atomic Interventions from Observations. arXiv (Cornell University). 1. 842–853.

Bhattacharyya, Arnab, Palash Dey, & David P. Woodruff. (2018). An Optimal Algorithm for ℓ ₁ -Heavy Hitters in Insertion Streams and Related Problems. ACM Transactions on Algorithms. 15(1). 1–27. 2 indexed citations

Bhattacharyya, Arnab, Zeev Dvir, Shubhangi Saraf, & Amir Shpilka. (2015). Tight lower bounds for linear 2-query LCCs over finite fields. COMBINATORICA. 36(1). 1–36. 4 indexed citations

Berman, Piotr, Arnab Bhattacharyya, Elena Grigorescu, et al.. (2014). Steiner transitive-closure spanners of low-dimensional posets. COMBINATORICA. 34(3). 255–277. 2 indexed citations

10.

Berman, Piotr, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, & Grigory Yaroslavtsev. (2012). Approximation algorithms for spanner problems and Directed Steiner Forest. Information and Computation. 222. 93–107. 12 indexed citations

11.

Bhattacharyya, Arnab, et al.. (2012). Every locally characterized affine-invariant property is testable. arXiv (Cornell University). 1 indexed citations

12.

Bhattacharyya, Arnab, et al.. (2011). The Complexity of Linear Dependence Problems in Vector Spaces.. 496–508. 4 indexed citations

13.

Bhattacharyya, Arnab, et al.. (2010). Separations of Matroid Freeness Properties. Electronic colloquium on computational complexity. 17. 136. 1 indexed citations

14.

Bhattacharyya, Arnab, Eldar Fischer, Ronitt Rubinfeld, & Paul Valiant. (2010). Testing monotonicity of distributions over general partial orders.. Electronic colloquium on computational complexity. 17. 239–252. 3 indexed citations

15.

Bhattacharyya, Arnab & Ning Xie. (2010). Lower Bounds for Testing Triangle-freeness in Boolean Functions. 87–98. 5 indexed citations

16.

Bhattacharyya, Arnab, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, & David P. Woodruff. (2009). Transitive-Closure Spanners of the Hypercube and the Hypergrid.. Electronic colloquium on computational complexity. 16. 46. 4 indexed citations

17.

Bhattacharyya, Arnab, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, & David P. Woodruff. (2009). Transitive-closure spanners. arXiv (Cornell University). 932–941. 21 indexed citations

18.

Bhattacharyya, Arnab, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, & David P. Woodruff. (2009). Transitive-Closure Spanners. 932–941. 9 indexed citations

19.

Bhattacharyya, Arnab. (2008). A Note on the Distance to Monotonicity of Boolean Functions.. Electronic colloquium on computational complexity. 15. 1 indexed citations

20.

Bhattacharyya, Arnab, et al.. (2008). Testing Linear-Invariant Non-Linear Properties.. INRIA a CCSD electronic archive server. 15. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact