Smell detection for eclipse. - Arnab Bhattacharyya 001; Robert M. Fuhrer (OOPSLA Companion, 2004)

Morphogenesis as an amorphous computation. - Arnab Bhattacharyya 001 (Conf. Computing Frontiers, 2006)

A Note on the Distance to Monotonicity of Boolean Functions. - Arnab Bhattacharyya 001 (Electron. Colloquium Comput. Complex., 2008)

Testing Linear-Invariant Non-Linear Properties. - Arnab Bhattacharyya 001; Victor Chen; Madhu Sudan 001; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2008)

Robust Regulatory Networks - Arnab Bhattacharyya 001; Bernhard Haeupler (CoRR, 2009)

Transitive-Closure Spanners of the Hypercube and the Hypergrid. - Arnab Bhattacharyya 001; Elena Grigorescu; Kyomin Jung; Sofya Raskhodnikova; David P. Woodruff (Electron. Colloquium Comput. Complex., 2009)

Optimal testing of Reed-Muller codes. - Arnab Bhattacharyya 001; Swastik Kopparty; Grant Schoenebeck; Madhu Sudan 001; David Zuckerman (Electron. Colloquium Comput. Complex., 2009)

Testing Linear-Invariant Non-linear Properties: A Short Report. - Arnab Bhattacharyya 001; Victor Chen; Madhu Sudan 001; Ning Xie 002 (Property Testing, 2010)

Optimal Testing of Reed-Muller Codes. - Arnab Bhattacharyya 001; Swastik Kopparty; Grant Schoenebeck; Madhu Sudan 001; David Zuckerman (Property Testing, 2010)

Steiner Transitive-Closure Spanners of d-Dimensional Posets - Piotr Berman; Arnab Bhattacharyya 001; Elena Grigorescu; Sofya Raskhodnikova; David P. Woodruff; Grigory Yaroslavtsev (CoRR, 2010)

Improved Approximation for the Directed Spanner Problem - Arnab Bhattacharyya 001; Konstantin Makarychev (CoRR, 2010)

Testing linear-invariant non-linear properties: A short report. - Arnab Bhattacharyya 001; Victor Chen; Madhu Sudan 001; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2010)

Testing monotonicity of distributions over general partial orders. - Arnab Bhattacharyya 001; Eldar Fischer; Ronitt Rubinfeld; Paul Valiant (Electron. Colloquium Comput. Complex., 2010)

Separations of Matroid Freeness Properties. - Arnab Bhattacharyya 001; Elena Grigorescu; Jakob Nordström; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2010)

A Unified Framework for Testing Linear-Invariant Properties. - Arnab Bhattacharyya 001; Elena Grigorescu; Asaf Shapira (Electron. Colloquium Comput. Complex., 2010)

Improved Approximation for the Directed Spanner Problem. - Piotr Berman; Arnab Bhattacharyya 001; Konstantin Makarychev; Sofya Raskhodnikova; Grigory Yaroslavtsev (ICALP (1), 2011)

The Complexity of Linear Dependence Problems in Vector Spaces. - Arnab Bhattacharyya 001; Piotr Indyk; David P. Woodruff; Ning Xie 002 (ICS, 2011)

Tight lower bounds for 2-query LCCs over finite fields. - Arnab Bhattacharyya 001; Zeev Dvir; Shubhangi Saraf; Amir Shpilka (Electron. Colloquium Comput. Complex., 2011)

Testing Odd-Cycle-Freeness in Boolean Functions. - Arnab Bhattacharyya 001; Elena Grigorescu; Prasad Raghavendra; Asaf Shapira (Electron. Colloquium Comput. Complex., 2011)

Testability of linear-invariant properties. - Arnab Bhattacharyya 001 (2011)

Testing Permanent Oracles - Revisited. - Sanjeev Arora; Arnab Bhattacharyya 001; Rajsekar Manokaran; Sushant Sachdeva (Electron. Colloquium Comput. Complex., 2012)

Every locally characterized affine-invariant property is testable. - Arnab Bhattacharyya 001; Eldar Fischer; Hamed Hatami; Pooya Hatami; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

Testing Low Complexity Affine-Invariant Properties. - Arnab Bhattacharyya 001; Eldar Fischer; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

Testing Assignments of Boolean CSPs. - Arnab Bhattacharyya 001; Yuichi Yoshida (Electron. Colloquium Comput. Complex., 2012)

Transitive-Closure Spanners. - Arnab Bhattacharyya 001; Elena Grigorescu; Kyomin Jung; Sofya Raskhodnikova; David P. Woodruff (SIAM J. Comput., 2012)

Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. - Arnab Bhattacharyya 001; Elena Grigorescu; Madhav Jha; Kyomin Jung; Sofya Raskhodnikova; David P. Woodruff (SIAM J. Discret. Math., 2012)

An Algebraic Characterization of Testable Boolean CSPs. - Arnab Bhattacharyya 001; Yuichi Yoshida (ICALP (1), 2013)

On the convergence of the Hegselmann-Krause system. - Arnab Bhattacharyya 001; Mark Braverman; Bernard Chazelle; Huy L. Nguyen (ITCS, 2013)

A Bipartite Graph with Non-Unimodal Independent Set Sequence. - Arnab Bhattacharyya 001; Jeff Kahn 001 (Electron. J. Comb., 2013)

On testing affine-invariant properties. - Arnab Bhattacharyya 001 (Electron. Colloquium Comput. Complex., 2013)

Approximation algorithms for spanner problems and Directed Steiner Forest. - Piotr Berman; Arnab Bhattacharyya 001; Konstantin Makarychev; Sofya Raskhodnikova; Grigory Yaroslavtsev (Inf. Comput., 2013)

Guest column: on testing affine-invariant properties over finite fields. - Arnab Bhattacharyya 001 (SIGACT News, 2013)

Steiner transitive-closure spanners of low-dimensional posets. - Piotr Berman; Arnab Bhattacharyya 001; Elena Grigorescu; Sofya Raskhodnikova; David P. Woodruff; Grigory Yaroslavtsev (Comb., 2014)

An explicit sparse recovery scheme in the L1-norm. - Arnab Bhattacharyya 001; Vineet Nair (CoRR, 2014)

Polynomial decompositions in polynomial time. - Arnab Bhattacharyya 001 (Electron. Colloquium Comput. Complex., 2014)

How friends and non-determinism affect opinion dynamics. - Arnab Bhattacharyya 001; Kirankumar Shiragur (CDC, 2015)

Algorithmic regularity for polynomials and applications. - Arnab Bhattacharyya 001; Pooya Hatami; Madhur Tulsiani (SODA, 2015)

Lower bounds for testing triangle-freeness in Boolean functions. - Arnab Bhattacharyya 001; Ning Xie 002 (Comput. Complex., 2015)

On learning k-parities with and without noise. - Arnab Bhattacharyya 001; Ameet Gadekar; Ninad Rajgopal (CoRR, 2015)

Using higher-order Fourier analysis over general fields. - Arnab Bhattacharyya 001; Abhishek Bhowmick 001 (Electron. Colloquium Comput. Complex., 2015)

Sample Complexity for Winner Prediction in Elections. - Arnab Bhattacharyya 001; Palash Dey (Electron. Colloquium Comput. Complex., 2015)

Fishing out Winners from Vote Streams. - Arnab Bhattacharyya 001; Palash Dey (Electron. Colloquium Comput. Complex., 2015)

Lower bounds for constant query affine-invariant LCCs and LTCs. - Arnab Bhattacharyya 001; Sivakanth Gopi (Electron. Colloquium Comput. Complex., 2015)

On the hardness of learning sparse parities. - Arnab Bhattacharyya 001; Ameet Gadekar; Suprovat Ghoshal; Rishi Saket (Electron. Colloquium Comput. Complex., 2015)

On Higher-Order Fourier Analysis over Non-Prime Fields. - Arnab Bhattacharyya 001; Abhishek Bhowmick 001; Chetan Gupta (APPROX-RANDOM, 2016)

An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems. - Arnab Bhattacharyya 001; Palash Dey; David P. Woodruff (PODS, 2016)

Tight lower bounds for linear 2-query LCCs over finite fields. - Arnab Bhattacharyya 001; Zeev Dvir; Shubhangi Saraf; Amir Shpilka (Comb., 2016)

The Dictionary Testing Problem. - Siddharth Barman; Arnab Bhattacharyya 001; Suprovat Ghoshal (CoRR, 2016)

Lower bounds for 2-query LCCs over large alphabet. - Arnab Bhattacharyya 001; Sivakanth Gopi (Electron. Colloquium Comput. Complex., 2016)

Lower Bounds for 2-Query LCCs over Large Alphabet. - Arnab Bhattacharyya 001; Sivakanth Gopi; Avishay Tal (APPROX-RANDOM, 2017)

On the Gap between Outcomes of Voting Rules. - Anurita Mathur; Arnab Bhattacharyya 001 (AAMAS, 2017)

Improved bounds for universal one-bit compressive sensing. - Jayadev Acharya; Arnab Bhattacharyya 001; Pritish Kamath (ISIT, 2017)

Hardness of learning noisy halfspaces using polynomial thresholds. - Arnab Bhattacharyya 001; Suprovat Ghoshal; Rishi Saket (Electron. Colloquium Comput. Complex., 2017)

Improved Learning of k-Parities. - Arnab Bhattacharyya 001; Ameet Gadekar; Ninad Rajgopal (COCOON, 2018)

Testing Sparsity over Known and Unknown Bases. - Siddharth Barman; Arnab Bhattacharyya 001; Suprovat Ghoshal (ICML, 2018)

Learning and Testing Causal Models with Interventions. - Jayadev Acharya; Arnab Bhattacharyya 001; Constantinos Daskalakis; Saravanan Kandasamy 002 (NeurIPS, 2018)

Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. - Arnab Bhattacharyya 001; Suprovat Ghoshal; Karthik C. S. 001; Pasin Manurangsi (Electron. Colloquium Comput. Complex., 2018)

Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. - Arnab Bhattacharyya 001; Fabrizio Grandoni 001; Aleksandar Nikolov; Barna Saha; Saket Saurabh 001; Aravindan Vijayaraghavan; Qin Zhang 001 (ACM Trans. Algorithms, 2018)

Minimum Intervention Cover of a Causal Graph. - Saravanan Kandasamy 002; Arnab Bhattacharyya 001; Vasant G. Honavar (AAAI, 2019)

Parameterized Intractability of Even Set and Shortest Vector Problem. - Arnab Bhattacharyya 001; Édouard Bonnet; László Egri; Suprovat Ghoshal; Karthik C. S. 001; Bingkai Lin; Pasin Manurangsi; Dániel Marx (Electron. Colloquium Comput. Complex., 2019)

Average Bias and Polynomial Sources. - Arnab Bhattacharyya 001; Philips George John; Suprovat Ghoshal; Raghu Meka (Electron. Colloquium Comput. Complex., 2019)

An Optimal Algorithm for ℓ1-Heavy Hitters in Insertion Streams and Related Problems. - Arnab Bhattacharyya 001; Palash Dey; David P. Woodruff (ACM Trans. Algorithms, 2019)

Learning and Sampling of Atomic Interventions from Observations. - Arnab Bhattacharyya 001; Sutanu Gayen; Saravanan Kandasamy 002; Ashwin Maran; N. Variyam Vinodchandran (ICML, 2020)

Combinatorial Lower Bounds for 3-Query LDCs. - Arnab Bhattacharyya 001; L. Sunil Chandran; Suprovat Ghoshal (ITCS, 2020)

Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; N. V. Vinodchandran (NeurIPS, 2020)

Efficiently Learning and Sampling Interventional Distributions from Observations. - Arnab Bhattacharyya 001; Sutanu Gayen; Saravanan Kandasamy 002; Ashwin Maran; N. V. Vinodchandran (CoRR, 2020)

Improved learning of k-parities. - Arnab Bhattacharyya 001; Ameet Gadekar; Ninad Rajgopal (Theor. Comput. Sci., 2020)

Efficient Statistics for Sparse Graphical Models from Truncated Samples. - Arnab Bhattacharyya 001; Rathin Desai; Sai Ganesh Nagarajan; Ioannis Panageas (AISTATS, 2021)

Testing Product Distributions: A Closer Look. - Arnab Bhattacharyya 001; Sutanu Gayen; Saravanan Kandasamy 002; N. V. Vinodchandran (ALT, 2021)

Model Counting meets F0 Estimation. - Aduri Pavan; N. V. Vinodchandran; Arnab Bhattacharyya 001; Kuldeep S. Meel (PODS, 2021)

Near-optimal learning of tree-structured distributions by Chow-Liu. - Arnab Bhattacharyya 001; Sutanu Gayen; Eric Price 001; N. V. Vinodchandran (STOC, 2021)

A formal methods approach to predicting new features of the eukaryotic vesicle traffic system. - Arnab Bhattacharyya 001; Ashutosh Gupta; Lakshmanan Kuppusamy; Somya Mani; Ankit Shukla 003; Mandayam K. Srivas; Mukund Thattai (Acta Informatica, 2021)

Predicting winner and estimating margin of victory in elections using sampling. - Arnab Bhattacharyya 001; Palash Dey (Artif. Intell., 2021)

Model Counting meets F0 Estimation. - Aduri Pavan; N. V. Vinodchandran; Arnab Bhattacharyya 001; Kuldeep S. Meel (CoRR, 2021)

Identifiability of AMP chain graph models. - Yuhao Wang; Arnab Bhattacharyya 001 (CoRR, 2021)

Efficient inference of interventional distributions. - Arnab Bhattacharyya 001; Sutanu Gayen; Saravanan Kandasamy 002; Vedant Raval; N. V. Vinodchandran (CoRR, 2021)

Property Testing - Problems and Techniques - Arnab Bhattacharyya 001; Yuichi Yoshida (Property Testing, 2022)

Identifiability of Linear AMP Chain Graph Models. - Yuhao Wang; Arnab Bhattacharyya 001 (AAAI, 2022)

Learning Sparse Fixed-Structure Gaussian Bayesian Networks. - Arnab Bhattacharyya 001; Davin Choo; Rishikesh Gajjala; Sutanu Gayen; Yuhao Wang (AISTATS, 2022)

Efficient interventional distribution learning in the PAC framework. - Arnab Bhattacharyya 001; Sutanu Gayen; Saravanan Kandasamy 002; Vedant Raval; N. Variyam Vinodchandran (AISTATS, 2022)

Universal 1-Bit Compressive Sensing for Bounded Dynamic Range Signals. - Sidhant Bansal; Arnab Bhattacharyya 001; Anamay Chaturvedi; Jonathan Scarlett (ISIT, 2022)

Independence Testing for Bounded Degree Bayesian Networks. - Arnab Bhattacharyya 001; Clément L. Canonne; Joy Qiping Yang (NeurIPS, 2022)

Verification and search algorithms for causal DAGs. - Davin Choo; Kirankumar Shiragur; Arnab Bhattacharyya 001 (NeurIPS, 2022)

An Adaptive Kernel Approach to Federated Learning of Heterogeneous Causal Effects. - Thanh Vinh Vo; Arnab Bhattacharyya 001; Young Lee; Tze-Yun Leong (NeurIPS, 2022)

Independence Testing for Bounded Degree Bayesian Network. - Arnab Bhattacharyya 001; Clément L. Canonne; Joy Qiping Yang (CoRR, 2022)

Low Degree Testing over the Reals. - Vipul Arora 002; Arnab Bhattacharyya 001; Noah Fleming; Esty Kelman; Yuichi Yoshida (Electron. Colloquium Comput. Complex., 2022)

Model Counting Meets Distinct Elements in a Data Stream. - Aduri Pavan; N. V. Vinodchandran; Arnab Bhattacharyya 001; Kuldeep S. Meel (SIGMOD Rec., 2022)

Constraint Optimization over Semirings. - Aduri Pavan; Kuldeep S. Meel; N. V. Vinodchandran; Arnab Bhattacharyya 001 (AAAI, 2023)

Sample Complexity of Distinguishing Cause from Effect. - Jayadev Acharya; Sourbh Bhadane; Arnab Bhattacharyya 001; Saravanan Kandasamy 002; Ziteng Sun (AISTATS, 2023)

On the Interventional Kullback-Leibler Divergence. - Jonas Bernhard Wildberger; Siyuan Guo; Arnab Bhattacharyya 001; Bernhard Schölkopf (CLeaR, 2023)

Active causal structure learning with advice. - Davin Choo; Themistoklis Gouleakis; Arnab Bhattacharyya 001 (ICML, 2023)

On Approximating Total Variation Distance. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; Dimitrios Myrisiotis; A. Pavan 001; N. V. Vinodchandran (IJCAI, 2023)

Near-Optimal Degree Testing for Bayes Nets. - Vipul Arora 002; Arnab Bhattacharyya 001; Clément L. Canonne; Joy Qiping Yang (ISIT, 2023)

Total Variation Distance Estimation Is as Easy as Probabilistic Inference. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; Dimitrios Myrisiotis; A. Pavan 001; N. V. Vinodchandran (Electron. Colloquium Comput. Complex., 2023)

Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu. - Arnab Bhattacharyya 001; Sutanu Gayen; Eric Price 001; Vincent Y. F. Tan; N. V. Vinodchandran (SIAM J. Comput., 2023)

Model Counting Meets Distinct Elements. - A. Pavan 001; N. V. Vinodchandran; Arnab Bhattacharyya 001; Kuldeep S. Meel (Commun. ACM, 2023)

Model Counting Meets F0 Estimation. - A. Pavan 001; N. Variyam Vinodchandran; Arnab Bhattacharyya 001; Kuldeep S. Meel (ACM Trans. Database Syst., 2023)

Optimal estimation of Gaussian (poly)trees. - Yuhao Wang; Ming Gao; Wai Ming Tai; Bryon Aragam; Arnab Bhattacharyya 001 (AISTATS, 2024)

Learning bounded-degree polytrees with known skeleton. - Davin Choo; Joy Qiping Yang; Arnab Bhattacharyya 001; Clément L. Canonne (ALT, 2024)

Outlier Robust Multivariate Polynomial Regression. - Vipul Arora 002; Arnab Bhattacharyya 001; Mathews Boban; Venkatesan Guruswami; Esty Kelman (ESA, 2024)

Total Variation Distance Meets Probabilistic Inference. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; Dimitrios Myrisiotis; A. Pavan 001; N. V. Vinodchandran (ICML, 2024)

Online bipartite matching with imperfect advice. - Davin Choo; Themistoklis Gouleakis; Chun Kai Ling; Arnab Bhattacharyya 001 (ICML, 2024)

Distribution Learning Meets Graph Structure Sampling. - Arnab Bhattacharyya 001; Sutanu Gayen; Philips George John; Sayantan Sen; N. V. Vinodchandran (CoRR, 2024)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs. - Philips George John; Arnab Bhattacharyya 001; Silviu Maniu; Dimitrios Myrisiotis; Zhenan Wu (CoRR, 2024)

Learning multivariate Gaussians with imperfect advice. - Arnab Bhattacharyya 001; Davin Choo; Philips George John; Themis Gouleakis (CoRR, 2024)

Learnability of Parameter-Bounded Bayes Nets. - Arnab Bhattacharyya 001; Davin Choo; Sutanu Gayen; Dimitrios Myrisiotis (AAAI, 2025)

Learning High-dimensional Gaussians from Censored Data. - Arnab Bhattacharyya 001; Constantinos Daskalakis; Themis Gouleakis; Yuhao Wang (AISTATS, 2025)

Probably approximately correct high-dimensional causal effect estimation given a valid adjustment set. - Davin Choo; Chandler Squires; Arnab Bhattacharyya 001; David Sontag (CLeaR, 2025)

Computational Explorations of Total Variation Distance. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; Dimitrios Myrisiotis; Aduri Pavan; N. V. Vinodchandran (ICLR, 2025)

Total variation distance for product distributions is #P-complete. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; Dimitrios Myrisiotis; A. Pavan 001; N. V. Vinodchandran (Inf. Process. Lett., 2025)