@article{newpaper,author={Bhattacharyya, Arnab and Cormode, Graham and Fu, Yucheng and Meel, Kuldeep S.},title={Total Variation Distance Estimation through Domain Reduction},journal={CoRR},volume={abs/2609.18707},year={2026},url={https://arxiv.org/abs/2609.18707},eprinttype={arXiv},original_url={https://arxiv.org/abs/2609.18707}}
Testing Sparse Functions over the Reals
Vipul
Arora, Arnab
Bhattacharyya, Philips George
John, and Sayantan
Sen
@inproceedings{DBLP:conf/icalp/AroraBJS26,author={Arora, Vipul and Bhattacharyya, Arnab and John, Philips George and Sen, Sayantan},title={Testing Sparse Functions over the Reals},booktitle={{ICALP}},editor={Bhattacharya, Sayan and Nanongkai, Danupon and Benedikt, Michael and Puppis, Gabriele},series={LIPIcs},volume={374},pages={14:1--14:26},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2026},doi={10.4230/LIPICS.ICALP.2026.14},url={https://arxiv.org/abs/2603.28061},eprinttype={arXiv},original_url={https://doi.org/10.4230/LIPIcs.ICALP.2026.14},biburl={https://dblp.org/rec/conf/icalp/AroraBJS26.bib}}
2025
Computational Explorations of Total Variation Distance
Arnab
Bhattacharyya, Sutanu
Gayen, Kuldeep S.
Meel, Dimitrios
Myrisiotis, Aduri
Pavan, and N. V.
Vinodchandran
@inproceedings{DBLP:conf/iclr/0001GMMPV25,author={Bhattacharyya, Arnab and Gayen, Sutanu and Meel, Kuldeep S. and Myrisiotis, Dimitrios and Pavan, Aduri and Vinodchandran, N. V.},title={Computational Explorations of Total Variation Distance},booktitle={{ICLR}},publisher={OpenReview.net},year={2025},url={https://arxiv.org/abs/2412.10370},eprinttype={arXiv},original_url={https://openreview.net/forum?id=xak8c9l1nu},biburl={https://dblp.org/rec/conf/iclr/0001GMMPV25.bib}}
Distribution Learning Meets Graph Structure Sampling
Arnab
Bhattacharyya, Sutanu
Gayen, Philips George
John, Sayantan
Sen, and N. V.
Vinodchandran
@inproceedings{DBLP:conf/nips/BhattacharyyaGJ25,author={Bhattacharyya, Arnab and Gayen, Sutanu and John, Philips George and Sen, Sayantan and Vinodchandran, N. V.},title={Distribution Learning Meets Graph Structure Sampling},booktitle={NeurIPS},editor={Belgrave, Danielle and Zhang, Cheng and Montoya, Laura N. and Lin, Hsuan{-}Tien and Pascanu, Razvan and Koniusz, Piotr and Ghassemi, Marzyeh and Chen, Nancy and Ru{\'{\i}}z, Iv{\'{a}}n Vladimir Meza and Loaiza{-}Bonilla, Arturo},year={2025},url={https://arxiv.org/abs/2405.07914},eprinttype={arXiv},original_url={http://papers.nips.cc/paper_files/paper/2025/hash/1ecbfd5ea3a5745d5302c0c3ee35eb3a-Abstract-Conference.html},biburl={https://dblp.org/rec/conf/nips/BhattacharyyaGJ25.bib}}
Learnability of Parameter-Bounded Bayes Nets
Arnab
Bhattacharyya, Davin
Choo, Sutanu
Gayen, and Dimitrios
Myrisiotis
@inproceedings{DBLP:conf/aaai/0001CGM25,author={Bhattacharyya, Arnab and Choo, Davin and Gayen, Sutanu and Myrisiotis, Dimitrios},title={Learnability of Parameter-Bounded Bayes Nets},booktitle={{AAAI}},editor={Walsh, Toby and Shah, Julie and Kolter, Zico},pages={15559--15566},publisher={{AAAI} Press},year={2025},doi={10.1609/AAAI.V39I15.33708},url={https://arxiv.org/abs/2407.00927},eprinttype={arXiv},original_url={https://doi.org/10.1609/aaai.v39i15.33708},biburl={https://dblp.org/rec/conf/aaai/0001CGM25.bib}}
Learning High-dimensional Gaussians from Censored Data
Arnab
Bhattacharyya, Constantinos
Daskalakis, Themis
Gouleakis, and Yuhao
Wang
@inproceedings{DBLP:conf/aistats/BhattacharyyaDGW25,author={Bhattacharyya, Arnab and Daskalakis, Constantinos and Gouleakis, Themis and Wang, Yuhao},title={Learning High-dimensional Gaussians from Censored Data},booktitle={{AISTATS}},editor={Li, Yingzhen and Mandt, Stephan and Agrawal, Shipra and Khan, Mohammad Emtiyaz},series={Proceedings of Machine Learning Research},volume={258},pages={4132--4140},publisher={{PMLR}},year={2025},url={https://arxiv.org/abs/2504.19446},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v258/bhattacharyya25b.html},biburl={https://dblp.org/rec/conf/aistats/BhattacharyyaDGW25.bib}}
Learning multivariate Gaussians with imperfect advice
Arnab
Bhattacharyya, Davin
Choo, Philips George
John, and Themis
Gouleakis
@inproceedings{DBLP:conf/icml/0001CJG25,author={Bhattacharyya, Arnab and Choo, Davin and John, Philips George and Gouleakis, Themis},title={Learning multivariate Gaussians with imperfect advice},booktitle={{ICML}},editor={Singh, Aarti and Fazel, Maryam and Hsu, Daniel and Lacoste{-}Julien, Simon and Berkenkamp, Felix and Maharaj, Tegan and Wagstaff, Kiri and Zhu, Jerry},series={Proceedings of Machine Learning Research},volume={267},publisher={{PMLR} / OpenReview.net},year={2025},url={https://arxiv.org/abs/2411.12700},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v267/bhattacharyya25a.html},biburl={https://dblp.org/rec/conf/icml/0001CJG25.bib}}
Probably approximately correct high-dimensional causal effect estimation given a valid adjustment set
Davin
Choo, Chandler
Squires, Arnab
Bhattacharyya, and David
Sontag
@inproceedings{DBLP:conf/clear2/ChooSBS25,author={Choo, Davin and Squires, Chandler and Bhattacharyya, Arnab and Sontag, David},title={Probably approximately correct high-dimensional causal effect estimation given a valid adjustment set},booktitle={CLeaR},editor={Huang, Biwei and Drton, Mathias},series={Proceedings of Machine Learning Research},volume={275},pages={1032--1085},publisher={{PMLR}},year={2025},url={https://arxiv.org/abs/2411.08141},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v275/choo25a.html},biburl={https://dblp.org/rec/conf/clear2/ChooSBS25.bib}}
Product Distribution Learning with Imperfect Advice
Arnab
Bhattacharyya, Davin
Choo, Philips George
John, and Themis
Gouleakis
@inproceedings{DBLP:conf/nips/BhattacharyyaCJ25,author={Bhattacharyya, Arnab and Choo, Davin and John, Philips George and Gouleakis, Themis},title={Product Distribution Learning with Imperfect Advice},booktitle={NeurIPS},editor={Belgrave, Danielle and Zhang, Cheng and Montoya, Laura N. and Lin, Hsuan{-}Tien and Pascanu, Razvan and Koniusz, Piotr and Ghassemi, Marzyeh and Chen, Nancy and Ru{\'{\i}}z, Iv{\'{a}}n Vladimir Meza and Loaiza{-}Bonilla, Arturo},year={2025},url={https://arxiv.org/abs/2511.10366},eprinttype={arXiv},original_url={http://papers.nips.cc/paper_files/paper/2025/hash/e7405eab5e8104bffb23f6fe80cc6f32-Abstract-Conference.html},biburl={https://dblp.org/rec/conf/nips/BhattacharyyaCJ25.bib}}
Total variation distance for product distributions is #P-complete
Arnab
Bhattacharyya, Sutanu
Gayen, Kuldeep S.
Meel, Dimitrios
Myrisiotis, A.
Pavan, and N. V.
Vinodchandran
@article{DBLP:journals/ipl/BhattacharyyaGMMPV25,author={Bhattacharyya, Arnab and Gayen, Sutanu and Meel, Kuldeep S. and Myrisiotis, Dimitrios and Pavan, A. and Vinodchandran, N. V.},title={Total variation distance for product distributions is {\#}P-complete},journal={Information Processing Letters},volume={189},pages={106560},year={2025},doi={10.1016/J.IPL.2025.106560},url={https://arxiv.org/abs/2405.08255},eprinttype={arXiv},original_url={https://doi.org/10.1016/j.ipl.2025.106560},biburl={https://dblp.org/rec/journals/ipl/BhattacharyyaGMMPV25.bib}}
2024
Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
Philips George
John, Arnab
Bhattacharyya, Silviu
Maniu, Dimitrios
Myrisiotis, and Zhenan
Wu
@article{DBLP:journals/corr/abs-2411-10906,author={John, Philips George and Bhattacharyya, Arnab and Maniu, Silviu and Myrisiotis, Dimitrios and Wu, Zhenan},title={Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs},journal={CoRR},volume={abs/2411.10906},year={2024},doi={10.48550/ARXIV.2411.10906},url={https://arxiv.org/abs/2411.10906},eprinttype={arXiv},original_url={https://doi.org/10.48550/arXiv.2411.10906},biburl={https://dblp.org/rec/journals/corr/abs-2411-10906.bib}}
Learning bounded-degree polytrees with known skeleton
Davin
Choo, Joy Qiping
Yang, Arnab
Bhattacharyya, and Clément L.
Canonne
@inproceedings{DBLP:conf/alt/ChooY0C24,author={Choo, Davin and Yang, Joy Qiping and Bhattacharyya, Arnab and Canonne, Cl{\'{e}}ment L.},title={Learning bounded-degree polytrees with known skeleton},booktitle={ALT},editor={Vernade, Claire and Hsu, Daniel},series={Proceedings of Machine Learning Research},volume={237},pages={402--443},publisher={{PMLR}},year={2024},url={https://arxiv.org/abs/2310.06333},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v237/choo24a.html},biburl={https://dblp.org/rec/conf/alt/ChooY0C24.bib}}
Online bipartite matching with imperfect advice
Davin
Choo, Themistoklis
Gouleakis, Chun Kai
Ling, and Arnab
Bhattacharyya
@inproceedings{DBLP:conf/icml/ChooGL024,author={Choo, Davin and Gouleakis, Themistoklis and Ling, Chun Kai and Bhattacharyya, Arnab},title={Online bipartite matching with imperfect advice},booktitle={ICML},editor={Salakhutdinov, Ruslan and Kolter, Zico and Heller, Katherine A. and Weller, Adrian and Oliver, Nuria and Scarlett, Jonathan and Berkenkamp, Felix},series={Proceedings of Machine Learning Research},volume={235},pages={8762--8781},publisher={{PMLR} / OpenReview.net},year={2024},url={https://arxiv.org/abs/2405.09784},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v235/choo24a.html},biburl={https://dblp.org/rec/conf/icml/ChooGL024.bib}}
Optimal estimation of Gaussian (poly)trees
Yuhao
Wang, Ming
Gao, Wai Ming
Tai, Bryon
Aragam, and Arnab
Bhattacharyya
@inproceedings{DBLP:conf/aistats/WangGTA024,author={Wang, Yuhao and Gao, Ming and Tai, Wai Ming and Aragam, Bryon and Bhattacharyya, Arnab},title={Optimal estimation of Gaussian (poly)trees},booktitle={AISTATS},editor={Dasgupta, Sanjoy and Mandt, Stephan and Li, Yingzhen},series={Proceedings of Machine Learning Research},volume={238},pages={3619--3627},publisher={{PMLR}},year={2024},url={https://arxiv.org/abs/2402.06380},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v238/wang24h.html},biburl={https://dblp.org/rec/conf/aistats/WangGTA024.bib}}
@inproceedings{DBLP:conf/esa/00020BGK24,author={Arora, Vipul and Bhattacharyya, Arnab and Boban, Mathews and Guruswami, Venkatesan and Kelman, Esty},title={Outlier Robust Multivariate Polynomial Regression},booktitle={ESA},editor={Chan, Timothy M. and Fischer, Johannes and Iacono, John and Herman, Grzegorz},series={LIPIcs},volume={308},pages={12:1--12:17},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2024},doi={10.4230/LIPICS.ESA.2024.12},url={https://arxiv.org/abs/2403.09465},eprinttype={arXiv},original_url={https://doi.org/10.4230/LIPIcs.ESA.2024.12},biburl={https://dblp.org/rec/conf/esa/00020BGK24.bib}}
Total Variation Distance Meets Probabilistic Inference
Arnab
Bhattacharyya, Sutanu
Gayen, Kuldeep S.
Meel, Dimitrios
Myrisiotis, A.
Pavan, and N. V.
Vinodchandran
@inproceedings{DBLP:conf/icml/0001GMM0V24,author={Bhattacharyya, Arnab and Gayen, Sutanu and Meel, Kuldeep S. and Myrisiotis, Dimitrios and Pavan, A. and Vinodchandran, N. V.},title={Total Variation Distance Meets Probabilistic Inference},booktitle={ICML},editor={Salakhutdinov, Ruslan and Kolter, Zico and Heller, Katherine A. and Weller, Adrian and Oliver, Nuria and Scarlett, Jonathan and Berkenkamp, Felix},series={Proceedings of Machine Learning Research},volume={235},pages={3776--3794},publisher={{PMLR} / OpenReview.net},year={2024},url={https://arxiv.org/abs/2309.09134},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v235/bhattacharyya24a.html},biburl={https://dblp.org/rec/conf/icml/0001GMM0V24.bib}}
2023
Active causal structure learning with advice
Davin
Choo, Themistoklis
Gouleakis, and Arnab
Bhattacharyya
@inproceedings{DBLP:conf/icml/ChooG023,author={Choo, Davin and Gouleakis, Themistoklis and Bhattacharyya, Arnab},title={Active causal structure learning with advice},booktitle={ICML},editor={Krause, Andreas and Brunskill, Emma and Cho, Kyunghyun and Engelhardt, Barbara and Sabato, Sivan and Scarlett, Jonathan},series={Proceedings of Machine Learning Research},volume={202},pages={5838--5867},publisher={{PMLR}},year={2023},url={https://arxiv.org/abs/2305.19588},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v202/choo23a.html},biburl={https://dblp.org/rec/conf/icml/ChooG023.bib}}
Constraint Optimization over Semirings
Aduri
Pavan, Kuldeep S.
Meel, N. V.
Vinodchandran, and Arnab
Bhattacharyya
@inproceedings{DBLP:conf/aaai/PavanMV023,author={Pavan, Aduri and Meel, Kuldeep S. and Vinodchandran, N. V. and Bhattacharyya, Arnab},title={Constraint Optimization over Semirings},booktitle={AAAI},editor={Williams, Brian and Chen, Yiling and Neville, Jennifer},pages={4070--4077},publisher={{AAAI} Press},year={2023},doi={10.1609/AAAI.V37I4.25522},url={https://arxiv.org/abs/2302.12937},eprinttype={arXiv},original_url={https://doi.org/10.1609/aaai.v37i4.25522},biburl={https://dblp.org/rec/conf/aaai/PavanMV023.bib}}
Low Degree Testing over the Reals
Vipul
Arora, Arnab
Bhattacharyya, Noah
Fleming, Esty
Kelman, and Yuichi
Yoshida
@inproceedings{DBLP:conf/soda/00020FKY23,author={Arora, Vipul and Bhattacharyya, Arnab and Fleming, Noah and Kelman, Esty and Yoshida, Yuichi},title={Low Degree Testing over the Reals},booktitle={SODA},editor={Bansal, Nikhil and Nagarajan, Viswanath},pages={738--792},publisher={{SIAM}},year={2023},doi={10.1137/1.9781611977554.CH31},url={https://arxiv.org/abs/2204.08404},eprinttype={arXiv},original_url={https://doi.org/10.1137/1.9781611977554.ch31},biburl={https://dblp.org/rec/conf/soda/00020FKY23.bib}}
Model Counting Meets F_0 Estimation
A.
Pavan, N. Variyam
Vinodchandran, Arnab
Bhattacharyya, and Kuldeep S.
Meel
ACM Trans. Database Syst., 2023
Conference version: PODS 2021. Related research-highlight versions appeared in SIGMOD Record (2022) and Communications of the ACM (2023).
@article{DBLP:journals/tods/PavanVBM23,author={Pavan, A. and Vinodchandran, N. Variyam and Bhattacharyya, Arnab and Meel, Kuldeep S.},title={Model Counting Meets {$F_0$} Estimation},journal={{ACM} Trans. Database Syst.},volume={48},number={3},pages={7:1--7:28},year={2023},doi={10.1145/3603496},url={https://arxiv.org/abs/2105.00639},eprinttype={arXiv},note={Conference version: PODS 2021. Related research-highlight versions appeared in SIGMOD Record (2022) and Communications of the ACM (2023).},original_url={https://doi.org/10.1145/3603496},biburl={https://dblp.org/rec/journals/tods/PavanVBM23.bib}}
Near-Optimal Degree Testing for Bayes Nets
Vipul
Arora, Arnab
Bhattacharyya, Clément L.
Canonne, and Joy Qiping
Yang
@inproceedings{DBLP:conf/isit/AroraBCY23,author={Arora, Vipul and Bhattacharyya, Arnab and Canonne, Cl{\'{e}}ment L. and Yang, Joy Qiping},title={Near-Optimal Degree Testing for Bayes Nets},booktitle={ISIT},pages={1396--1401},publisher={{IEEE}},year={2023},doi={10.1109/ISIT54713.2023.10206666},url={https://arxiv.org/abs/2304.06733},eprinttype={arXiv},original_url={https://doi.org/10.1109/ISIT54713.2023.10206666},biburl={https://dblp.org/rec/conf/isit/AroraBCY23.bib}}
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu
Arnab
Bhattacharyya, Sutanu
Gayen, Eric
Price, Vincent Y. F.
Tan, and N. V.
Vinodchandran
SIAM J. Comput., 2023
Conference version: STOC 2021. The arXiv link is to the earlier four-author version; the journal version adds Vincent Y. F. Tan.
@article{DBLP:journals/siamcomp/BhattacharyyaGPTV23,author={Bhattacharyya, Arnab and Gayen, Sutanu and Price, Eric and Tan, Vincent Y. F. and Vinodchandran, N. V.},title={Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu},journal={{SIAM} J. Comput.},volume={52},number={3},pages={761--793},year={2023},doi={10.1137/22M1489678},url={https://arxiv.org/abs/2011.04144},eprinttype={arXiv},note={Conference version: STOC 2021. The arXiv link is to the earlier four-author version; the journal version adds Vincent Y. F. Tan.},original_url={https://doi.org/10.1137/22m1489678},biburl={https://dblp.org/rec/journals/siamcomp/BhattacharyyaGPTV23.bib}}
On Approximating Total Variation Distance
Arnab
Bhattacharyya, Sutanu
Gayen, Kuldeep S.
Meel, Dimitrios
Myrisiotis, A.
Pavan, and N. V.
Vinodchandran
@inproceedings{DBLP:conf/ijcai/0001GMMPV23,author={Bhattacharyya, Arnab and Gayen, Sutanu and Meel, Kuldeep S. and Myrisiotis, Dimitrios and Pavan, A. and Vinodchandran, N. V.},title={On Approximating Total Variation Distance},booktitle={IJCAI},pages={3479--3487},publisher={ijcai.org},year={2023},doi={10.24963/IJCAI.2023/387},url={https://arxiv.org/abs/2206.07209},eprinttype={arXiv},original_url={https://doi.org/10.24963/ijcai.2023/387},biburl={https://dblp.org/rec/conf/ijcai/0001GMMPV23.bib}}
On the Interventional Kullback-Leibler Divergence
Jonas Bernhard
Wildberger, Siyuan
Guo, Arnab
Bhattacharyya, and Bernhard
Schölkopf
@inproceedings{DBLP:conf/clear2/WildbergerG0S23,author={Wildberger, Jonas Bernhard and Guo, Siyuan and Bhattacharyya, Arnab and Sch{\"{o}}lkopf, Bernhard},title={On the Interventional Kullback-Leibler Divergence},booktitle={CLeaR},editor={van der Schaar, Mihaela and Zhang, Cheng and Janzing, Dominik},series={Proceedings of Machine Learning Research},volume={213},pages={328--349},publisher={{PMLR}},year={2023},url={https://arxiv.org/abs/2302.05380},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v213/wildberger23a.html},biburl={https://dblp.org/rec/conf/clear2/WildbergerG0S23.bib}}
Sample Complexity of Distinguishing Cause from Effect
Jayadev
Acharya, Sourbh
Bhadane, Arnab
Bhattacharyya, Saravanan
Kandasamy, and Ziteng
Sun
@inproceedings{DBLP:conf/aistats/AcharyaB00S23,author={Acharya, Jayadev and Bhadane, Sourbh and Bhattacharyya, Arnab and Kandasamy, Saravanan and Sun, Ziteng},title={Sample Complexity of Distinguishing Cause from Effect},booktitle={AISTATS},editor={Ruiz, Francisco J. R. and Dy, Jennifer G. and van de Meent, Jan{-}Willem},series={Proceedings of Machine Learning Research},volume={206},pages={10487--10504},publisher={{PMLR}},year={2023},url={https://proceedings.mlr.press/v206/acharya23b.html},biburl={https://dblp.org/rec/conf/aistats/AcharyaB00S23.bib}}
2022
An Adaptive Kernel Approach to Federated Learning of Heterogeneous Causal Effects
Thanh Vinh
Vo, Arnab
Bhattacharyya, Young
Lee, and Tze-Yun
Leong
@inproceedings{DBLP:conf/nips/Vo0LL22,author={Vo, Thanh Vinh and Bhattacharyya, Arnab and Lee, Young and Leong, Tze{-}Yun},title={An Adaptive Kernel Approach to Federated Learning of Heterogeneous Causal Effects},booktitle={NeurIPS},editor={Koyejo, Sanmi and Mohamed, S. and Agarwal, A. and Belgrave, Danielle and Cho, K. and Oh, A.},year={2022},url={https://arxiv.org/abs/2301.00346},eprinttype={arXiv},original_url={http://papers.nips.cc/paper_files/paper/2022/hash/9a9afa70eead1805f00e3a0df2a41157-Abstract-Conference.html},biburl={https://dblp.org/rec/conf/nips/Vo0LL22.bib}}
Efficient interventional distribution learning in the PAC framework
Arnab
Bhattacharyya, Sutanu
Gayen, Saravanan
Kandasamy, Vedant
Raval, and N. Variyam
Vinodchandran
@inproceedings{DBLP:conf/aistats/0001G0RV22,author={Bhattacharyya, Arnab and Gayen, Sutanu and Kandasamy, Saravanan and Raval, Vedant and Vinodchandran, N. Variyam},title={Efficient interventional distribution learning in the {PAC} framework},booktitle={AISTATS},editor={Camps{-}Valls, Gustau and Ruiz, Francisco J. R. and Valera, Isabel},series={Proceedings of Machine Learning Research},volume={151},pages={7531--7549},publisher={{PMLR}},year={2022},url={https://arxiv.org/abs/2107.11712},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v151/bhattacharyya22a.html},biburl={https://dblp.org/rec/conf/aistats/0001G0RV22.bib}}
@inproceedings{DBLP:conf/aaai/Wang022,author={Wang, Yuhao and Bhattacharyya, Arnab},title={Identifiability of Linear {AMP} Chain Graph Models},booktitle={AISTATS},pages={10080--10089},publisher={{AAAI} Press},year={2022},doi={10.1609/AAAI.V36I9.21247},url={https://arxiv.org/abs/2106.09350},eprinttype={arXiv},original_url={https://doi.org/10.1609/aaai.v36i9.21247},biburl={https://dblp.org/rec/conf/aaai/Wang022.bib}}
Independence Testing for Bounded Degree Bayesian Networks
Arnab
Bhattacharyya, Clément L.
Canonne, and Joy Qiping
Yang
@inproceedings{DBLP:conf/nips/0001CY22,author={Bhattacharyya, Arnab and Canonne, Cl{\'{e}}ment L. and Yang, Joy Qiping},title={Independence Testing for Bounded Degree Bayesian Networks},booktitle={NeurIPS},editor={Koyejo, Sanmi and Mohamed, S. and Agarwal, A. and Belgrave, Danielle and Cho, K. and Oh, A.},year={2022},url={https://arxiv.org/abs/2204.08690},eprinttype={arXiv},original_url={http://papers.nips.cc/paper_files/paper/2022/hash/611252d40f23c8b57a8bc9ffb577419b-Abstract-Conference.html},biburl={https://dblp.org/rec/conf/nips/0001CY22.bib}}
@inproceedings{DBLP:conf/aistats/0001CGGW22,author={Bhattacharyya, Arnab and Choo, Davin and Gajjala, Rishikesh and Gayen, Sutanu and Wang, Yuhao},title={Learning Sparse Fixed-Structure Gaussian Bayesian Networks},booktitle={AISTATS},editor={Camps{-}Valls, Gustau and Ruiz, Francisco J. R. and Valera, Isabel},series={Proceedings of Machine Learning Research},volume={151},pages={9400--9429},publisher={{PMLR}},year={2022},url={https://arxiv.org/abs/2107.10450},eprinttype={arXiv},original_url={https://proceedings.mlr.press/v151/bhattacharyya22b.html},biburl={https://dblp.org/rec/conf/aistats/0001CGGW22.bib}}
@book{DBLP:books/sp/BhattacharyyaY22,author={Bhattacharyya, Arnab and Yoshida, Yuichi},title={Property Testing - Problems and Techniques},publisher={Springer},year={2022},doi={10.1007/978-981-16-8622-1},isbn={978-981-16-8621-4},url={https://doi.org/10.1007/978-981-16-8622-1},biburl={https://dblp.org/rec/books/sp/BhattacharyyaY22.bib}}
Universal 1-Bit Compressive Sensing for Bounded Dynamic Range Signals
Sidhant
Bansal, Arnab
Bhattacharyya, Anamay
Chaturvedi, and Jonathan
Scarlett
@inproceedings{DBLP:conf/isit/BansalBCS22,author={Bansal, Sidhant and Bhattacharyya, Arnab and Chaturvedi, Anamay and Scarlett, Jonathan},title={Universal 1-Bit Compressive Sensing for Bounded Dynamic Range Signals},booktitle={ISIT},pages={3280--3284},publisher={{IEEE}},year={2022},doi={10.1109/ISIT50566.2022.9834417},url={https://arxiv.org/abs/2202.10611},eprinttype={arXiv},original_url={https://doi.org/10.1109/ISIT50566.2022.9834417},biburl={https://dblp.org/rec/conf/isit/BansalBCS22.bib}}
Verification and search algorithms for causal DAGs
Davin
Choo, Kirankumar
Shiragur, and Arnab
Bhattacharyya
@inproceedings{DBLP:conf/nips/ChooS022,author={Choo, Davin and Shiragur, Kirankumar and Bhattacharyya, Arnab},title={Verification and search algorithms for causal DAGs},booktitle={NeurIPS},editor={Koyejo, Sanmi and Mohamed, S. and Agarwal, A. and Belgrave, Danielle and Cho, K. and Oh, A.},year={2022},url={https://arxiv.org/abs/2206.15374},eprinttype={arXiv},original_url={http://papers.nips.cc/paper_files/paper/2022/hash/5340b0c0b76dc0115f5cc91c20c1251d-Abstract-Conference.html},biburl={https://dblp.org/rec/conf/nips/ChooS022.bib}}
2021
A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
Arnab
Bhattacharyya, Ashutosh
Gupta, Lakshmanan
Kuppusamy, Somya
Mani, Ankit
Shukla, Mandayam K.
Srivas, and Mukund
Thattai
@article{DBLP:journals/acta/BhattacharyyaGK21,author={Bhattacharyya, Arnab and Gupta, Ashutosh and Kuppusamy, Lakshmanan and Mani, Somya and Shukla, Ankit and Srivas, Mandayam K. and Thattai, Mukund},title={A formal methods approach to predicting new features of the eukaryotic vesicle traffic system},journal={Acta Informatica},volume={58},number={1-2},pages={57--93},year={2021},doi={10.1007/S00236-019-00357-3},url={https://doi.org/10.1007/s00236-019-00357-3},biburl={https://dblp.org/rec/journals/acta/BhattacharyyaGK21.bib}}
Efficient Statistics for Sparse Graphical Models from Truncated Samples
Arnab
Bhattacharyya, Rathin
Desai, Sai Ganesh
Nagarajan, and Ioannis
Panageas
@inproceedings{DBLP:conf/aistats/0001DNP21,author={Bhattacharyya, Arnab and Desai, Rathin and Nagarajan, Sai Ganesh and Panageas, Ioannis},title={Efficient Statistics for Sparse Graphical Models from Truncated Samples},booktitle={AISTATS},editor={Banerjee, Arindam and Fukumizu, Kenji},series={Proceedings of Machine Learning Research},volume={130},pages={1450--1458},publisher={{PMLR}},year={2021},url={https://arxiv.org/abs/2006.09735},eprinttype={arXiv},original_url={http://proceedings.mlr.press/v130/bhattacharyya21a.html},biburl={https://dblp.org/rec/conf/aistats/0001DNP21.bib}}
Parameterized Intractability of Even Set and Shortest Vector Problem
Arnab
Bhattacharyya,
Bonnet, László
Egri, Suprovat
Ghoshal,
Karthik C. S., Bingkai
Lin, Pasin
Manurangsi, and Dániel
Marx
Journal of the ACM, 2021
Conference version: ICALP 2018. The combined journal article also incorporates a preliminary version presented at ESA 2016.
@article{DBLP:journals/jacm/BhattacharyyaBE21,author={Bhattacharyya, Arnab and {\'{E}}douard Bonnet and Egri, L{\'{a}}szl{\'{o}} and Ghoshal, Suprovat and {Karthik {C. S.}} and Lin, Bingkai and Manurangsi, Pasin and Marx, D{\'{a}}niel},title={Parameterized Intractability of Even Set and Shortest Vector Problem},journal={Journal of the {ACM}},volume={68},number={3},pages={16:1--16:40},year={2021},doi={10.1145/3444942},url={https://arxiv.org/abs/1909.01986},eprinttype={arXiv},note={Conference version: ICALP 2018. The combined journal article also incorporates a preliminary version presented at ESA 2016.},related_arxiv={1803.09717},original_url={https://doi.org/10.1145/3444942},biburl={https://dblp.org/rec/journals/jacm/BhattacharyyaBE21.bib}}
Predicting winner and estimating margin of victory in elections using sampling
Arnab
Bhattacharyya and Palash
Dey
Artificial Intelligence, 2021
Conference version: AAMAS 2015. The arXiv link is to the earlier winner-prediction paper, not the complete combined journal article. The journal article also incorporates work presented at IJCAI 2015.
@article{DBLP:journals/ai/BhattacharyyaD21,author={Bhattacharyya, Arnab and Dey, Palash},title={Predicting winner and estimating margin of victory in elections using sampling},journal={Artificial Intelligence},volume={296},pages={103476},year={2021},doi={10.1016/J.ARTINT.2021.103476},url={https://arxiv.org/abs/1502.04354},eprinttype={arXiv},note={Conference version: AAMAS 2015. The arXiv link is to the earlier winner-prediction paper, not the complete combined journal article. The journal article also incorporates work presented at IJCAI 2015.},original_url={https://doi.org/10.1016/j.artint.2021.103476},biburl={https://dblp.org/rec/journals/ai/BhattacharyyaD21.bib}}
Testing Product Distributions: A Closer Look
Arnab
Bhattacharyya, Sutanu
Gayen, Saravanan
Kandasamy, and N. V.
Vinodchandran
@inproceedings{DBLP:conf/alt/0001G0V21,author={Bhattacharyya, Arnab and Gayen, Sutanu and Kandasamy, Saravanan and Vinodchandran, N. V.},title={Testing Product Distributions: {A} Closer Look},booktitle={ALT},editor={Feldman, Vitaly and Ligett, Katrina and Sabato, Sivan},series={Proceedings of Machine Learning Research},volume={132},pages={367--396},publisher={{PMLR}},year={2021},url={https://arxiv.org/abs/2012.14632},eprinttype={arXiv},original_url={http://proceedings.mlr.press/v132/bhattacharyya21a.html},biburl={https://dblp.org/rec/conf/alt/0001G0V21.bib}}
2020
Combinatorial Lower Bounds for 3-Query LDCs
Arnab
Bhattacharyya, L. Sunil
Chandran, and Suprovat
Ghoshal
@inproceedings{DBLP:conf/innovations/0001CG20,author={Bhattacharyya, Arnab and Chandran, L. Sunil and Ghoshal, Suprovat},title={Combinatorial Lower Bounds for 3-Query LDCs},booktitle={ITCS},editor={Vidick, Thomas},series={LIPIcs},volume={151},pages={85:1--85:8},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2020},doi={10.4230/LIPICS.ITCS.2020.85},url={https://arxiv.org/abs/1911.10698},eprinttype={arXiv},original_url={https://doi.org/10.4230/LIPIcs.ITCS.2020.85},biburl={https://dblp.org/rec/conf/innovations/0001CG20.bib}}
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning
Arnab
Bhattacharyya, Sutanu
Gayen, Kuldeep S.
Meel, and N. V.
Vinodchandran
@inproceedings{DBLP:conf/nips/0001GMV20,author={Bhattacharyya, Arnab and Gayen, Sutanu and Meel, Kuldeep S. and Vinodchandran, N. V.},title={Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning},booktitle={NeurIPS},editor={Larochelle, Hugo and Ranzato, Marc'Aurelio and Hadsell, Raia and Balcan, Maria{-}Florina and Lin, Hsuan{-}Tien},year={2020},url={https://arxiv.org/abs/2002.05378},eprinttype={arXiv},original_url={https://proceedings.neurips.cc/paper/2020/hash/a8acc28734d4fe90ea24353d901ae678-Abstract.html},biburl={https://dblp.org/rec/conf/nips/0001GMV20.bib}}
Improved learning of k-parities
Arnab
Bhattacharyya, Ameet
Gadekar, and Ninad
Rajgopal
@inproceedings{DBLP:conf/icml/0001G0MV20,author={Bhattacharyya, Arnab and Gayen, Sutanu and Kandasamy, Saravanan and Maran, Ashwin and Vinodchandran, N. Variyam},title={Learning and Sampling of Atomic Interventions from Observations},booktitle={ICML},series={Proceedings of Machine Learning Research},volume={119},pages={842--853},publisher={{PMLR}},year={2020},url={https://arxiv.org/abs/2002.04232},eprinttype={arXiv},original_url={http://proceedings.mlr.press/v119/bhattacharyya20a.html},biburl={https://dblp.org/rec/conf/icml/0001G0MV20.bib}}
2019
An Optimal Algorithm for \ell_1-Heavy Hitters in Insertion Streams and Related Problems
Arnab
Bhattacharyya, Palash
Dey, and David P.
Woodruff
ACM Trans. Algorithms, 2019
Conference version: PODS 2016. Subsumes the earlier preprint Fishing out Winners from Vote Streams (arXiv:1508.04522).
@article{DBLP:journals/talg/BhattacharyyaDW19,author={Bhattacharyya, Arnab and Dey, Palash and Woodruff, David P.},title={An Optimal Algorithm for {$\ell_1$}-Heavy Hitters in Insertion Streams and Related Problems},journal={{ACM} Trans. Algorithms},volume={15},number={1},pages={2:1--2:27},year={2019},doi={10.1145/3264427},url={https://arxiv.org/abs/1603.00213},eprinttype={arXiv},note={Conference version: PODS 2016. Subsumes the earlier preprint Fishing out Winners from Vote Streams (arXiv:1508.04522).},related_arxiv={1508.04522},original_url={https://doi.org/10.1145/3264427},biburl={https://dblp.org/rec/journals/talg/BhattacharyyaDW19.bib}}
Average Bias and Polynomial Sources
Arnab
Bhattacharyya, Philips George
John, Suprovat
Ghoshal, and Raghu
Meka
Electron. Colloquium Comput. Complex., 2019
The arXiv version was withdrawn by the authors in May 2019.
@article{DBLP:journals/eccc/BhattacharyyaJG19,author={Bhattacharyya, Arnab and John, Philips George and Ghoshal, Suprovat and Meka, Raghu},title={Average Bias and Polynomial Sources},journal={Electron. Colloquium Comput. Complex.},volume={{TR19}},year={2019},url={https://arxiv.org/abs/1905.11612},eprinttype={ECCC},note={The arXiv version was withdrawn by the authors in May 2019.},original_url={https://eccc.weizmann.ac.il/report/2019/079},biburl={https://dblp.org/rec/journals/eccc/BhattacharyyaJG19.bib},eid={{TR19-079}}}
Minimum Intervention Cover of a Causal Graph
Saravanan
Kandasamy, Arnab
Bhattacharyya, and Vasant G.
Honavar
@inproceedings{DBLP:conf/aaai/Kandasamy0H19,author={Kandasamy, Saravanan and Bhattacharyya, Arnab and Honavar, Vasant G.},title={Minimum Intervention Cover of a Causal Graph},booktitle={AAAI},pages={2876--2885},publisher={{AAAI} Press},year={2019},doi={10.1609/AAAI.V33I01.33012876},url={https://doi.org/10.1609/aaai.v33i01.33012876},biburl={https://dblp.org/rec/conf/aaai/Kandasamy0H19.bib}}
2018
Hardness of Learning Noisy Halfspaces using Polynomial Thresholds
Arnab
Bhattacharyya, Suprovat
Ghoshal, and Rishi
Saket
@inproceedings{DBLP:conf/colt/BhattacharyyaGS18,author={Bhattacharyya, Arnab and Ghoshal, Suprovat and Saket, Rishi},title={Hardness of Learning Noisy Halfspaces using Polynomial Thresholds},booktitle={COLT},editor={Bubeck, S{\'{e}}bastien and Perchet, Vianney and Rigollet, Philippe},series={Proceedings of Machine Learning Research},volume={75},pages={876--917},publisher={{PMLR}},year={2018},url={https://arxiv.org/abs/1707.01795},eprinttype={arXiv},original_url={http://proceedings.mlr.press/v75/bhattacharyya18a.html},biburl={https://dblp.org/rec/conf/colt/BhattacharyyaGS18.bib}}
Learning and Testing Causal Models with Interventions
Jayadev
Acharya, Arnab
Bhattacharyya, Constantinos
Daskalakis, and Saravanan
Kandasamy
@inproceedings{DBLP:conf/nips/AcharyaBDK18,author={Acharya, Jayadev and Bhattacharyya, Arnab and Daskalakis, Constantinos and Kandasamy, Saravanan},title={Learning and Testing Causal Models with Interventions},booktitle={NeurIPS},editor={Bengio, Samy and Wallach, Hanna M. and Larochelle, Hugo and Grauman, Kristen and Cesa{-}Bianchi, Nicol{\`{o}} and Garnett, Roman},pages={9469--9481},year={2018},url={https://arxiv.org/abs/1805.09697},eprinttype={arXiv},original_url={https://proceedings.neurips.cc/paper/2018/hash/78631a4bb5303be54fa1cfdcb958c00a-Abstract.html},biburl={https://dblp.org/rec/conf/nips/AcharyaBDK18.bib}}
Testing Sparsity over Known and Unknown Bases
Siddharth
Barman, Arnab
Bhattacharyya, and Suprovat
Ghoshal
@inproceedings{DBLP:conf/icml/BarmanBG18,author={Barman, Siddharth and Bhattacharyya, Arnab and Ghoshal, Suprovat},title={Testing Sparsity over Known and Unknown Bases},booktitle={ICML},editor={Dy, Jennifer G. and Krause, Andreas},series={Proceedings of Machine Learning Research},volume={80},pages={500--509},publisher={{PMLR}},year={2018},url={https://arxiv.org/abs/1608.01275},eprinttype={arXiv},original_url={http://proceedings.mlr.press/v80/barman18a.html},biburl={https://dblp.org/rec/conf/icml/BarmanBG18.bib}}
2017
Improved bounds for universal one-bit compressive sensing
Jayadev
Acharya, Arnab
Bhattacharyya, and Pritish
Kamath
@inproceedings{DBLP:conf/isit/AcharyaBK17,author={Acharya, Jayadev and Bhattacharyya, Arnab and Kamath, Pritish},title={Improved bounds for universal one-bit compressive sensing},booktitle={ISIT},pages={2353--2357},publisher={{IEEE}},year={2017},doi={10.1109/ISIT.2017.8006950},url={https://arxiv.org/abs/1705.00763},eprinttype={arXiv},original_url={https://doi.org/10.1109/ISIT.2017.8006950},biburl={https://dblp.org/rec/conf/isit/AcharyaBK17.bib}}
Lower Bounds for 2-Query LCCs over Large Alphabet
Arnab
Bhattacharyya, Sivakanth
Gopi, and Avishay
Tal
@inproceedings{DBLP:conf/approx/BhattacharyyaGT17,author={Bhattacharyya, Arnab and Gopi, Sivakanth and Tal, Avishay},title={Lower Bounds for 2-Query LCCs over Large Alphabet},booktitle={{RANDOM}},editor={Jansen, Klaus and Rolim, Jos{\'{e}} D. P. and Williamson, David and Vempala, Santosh S.},series={LIPIcs},volume={81},pages={30:1--30:20},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2017},doi={10.4230/LIPICS.APPROX-RANDOM.2017.30},url={https://arxiv.org/abs/1611.06980},eprinttype={arXiv},original_url={https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.30},biburl={https://dblp.org/rec/conf/approx/BhattacharyyaGT17.bib}}
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs
@inproceedings{DBLP:conf/atal/MathurB17,author={Mathur, Anurita and Bhattacharyya, Arnab},title={On the Gap between Outcomes of Voting Rules},booktitle={AAMAS},editor={Larson, Kate and Winikoff, Michael and Das, Sanmay and Durfee, Edmund H.},pages={1631--1633},publisher={{ACM}},year={2017},url={http://dl.acm.org/citation.cfm?id=3091386},biburl={https://dblp.org/rec/conf/atal/MathurB17.bib}}
2016
On Higher-Order Fourier Analysis over Non-Prime Fields
Arnab
Bhattacharyya, Abhishek
Bhowmick, and Chetan
Gupta
In RANDOM, 2016
The arXiv link is to the earlier two-author version, Using higher-order Fourier analysis over general fields; the conference version adds Chetan Gupta.
@inproceedings{DBLP:conf/approx/BhattacharyyaBG16,author={Bhattacharyya, Arnab and Bhowmick, Abhishek and Gupta, Chetan},title={On Higher-Order Fourier Analysis over Non-Prime Fields},booktitle={RANDOM},editor={Jansen, Klaus and Mathieu, Claire and Rolim, Jos{\'{e}} D. P. and Umans, Chris},series={LIPIcs},volume={60},pages={23:1--23:29},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2016},doi={10.4230/LIPICS.APPROX-RANDOM.2016.23},url={https://arxiv.org/abs/1505.00619},eprinttype={arXiv},note={The arXiv link is to the earlier two-author version, Using higher-order Fourier analysis over general fields; the conference version adds Chetan Gupta.},original_url={https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.23},biburl={https://dblp.org/rec/conf/approx/BhattacharyyaBG16.bib}}
On the Hardness of Learning Sparse Parities
Arnab
Bhattacharyya, Ameet
Gadekar, Suprovat
Ghoshal, and Rishi
Saket
@inproceedings{DBLP:conf/esa/BhattacharyyaGG16,author={Bhattacharyya, Arnab and Gadekar, Ameet and Ghoshal, Suprovat and Saket, Rishi},title={On the Hardness of Learning Sparse Parities},booktitle={ESA},editor={Sankowski, Piotr and Zaroliagis, Christos D.},series={LIPIcs},volume={57},pages={11:1--11:17},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2016},doi={10.4230/LIPICS.ESA.2016.11},url={https://arxiv.org/abs/1511.08270},eprinttype={arXiv},original_url={https://doi.org/10.4230/LIPIcs.ESA.2016.11},biburl={https://dblp.org/rec/conf/esa/BhattacharyyaGG16.bib}}
Tight lower bounds for linear 2-query LCCs over finite fields
Arnab
Bhattacharyya, Zeev
Dvir, Shubhangi
Saraf, and Amir
Shpilka
@article{DBLP:journals/combinatorica/BhattacharyyaDS16,author={Bhattacharyya, Arnab and Dvir, Zeev and Saraf, Shubhangi and Shpilka, Amir},title={Tight lower bounds for linear 2-query LCCs over finite fields},journal={Combinatorica},volume={36},number={1},pages={1--36},year={2016},doi={10.1007/S00493-015-3024-Z},url={https://doi.org/10.1007/s00493-015-3024-z},note={Conference version: FOCS 2011.},biburl={https://dblp.org/rec/journals/combinatorica/BhattacharyyaDS16.bib}}
2015
A unified framework for testing linear-invariant properties
Arnab
Bhattacharyya, Elena
Grigorescu, and Asaf
Shapira
@article{DBLP:journals/rsa/BhattacharyyaGS15,author={Bhattacharyya, Arnab and Grigorescu, Elena and Shapira, Asaf},title={A unified framework for testing linear-invariant properties},journal={Random Struct. Algorithms},volume={46},number={2},pages={232--260},year={2015},doi={10.1002/RSA.20507},url={https://arxiv.org/abs/1010.5016},eprinttype={arXiv},note={Conference version: FOCS 2010.},original_url={https://doi.org/10.1002/rsa.20507},biburl={https://dblp.org/rec/journals/rsa/BhattacharyyaGS15.bib}}
Algorithmic regularity for polynomials and applications
Arnab
Bhattacharyya, Pooya
Hatami, and Madhur
Tulsiani
In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, 2015
@inproceedings{DBLP:conf/soda/BhattacharyyaHT15,author={Bhattacharyya, Arnab and Hatami, Pooya and Tulsiani, Madhur},title={Algorithmic regularity for polynomials and applications},booktitle={Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},editor={Indyk, Piotr},pages={1870--1889},publisher={{SIAM}},year={2015},doi={10.1137/1.9781611973730.125},url={https://arxiv.org/abs/1311.5090},eprinttype={arXiv},original_url={https://doi.org/10.1137/1.9781611973730.125},biburl={https://dblp.org/rec/conf/soda/BhattacharyyaHT15.bib}}
How friends and non-determinism affect opinion dynamics
@article{DBLP:journals/cc/BhattacharyyaX15,author={Bhattacharyya, Arnab and Xie, Ning},title={Lower bounds for testing triangle-freeness in Boolean functions},journal={Computational Complexity},volume={24},number={1},pages={65--101},year={2015},doi={10.1007/S00037-014-0092-1},url={https://doi.org/10.1007/s00037-014-0092-1},note={Conference version: SODA 2010.},biburl={https://dblp.org/rec/journals/cc/BhattacharyyaX15.bib}}
@article{DBLP:journals/corr/BhattacharyyaN14,author={Bhattacharyya, Arnab and Nair, Vineet},title={An explicit sparse recovery scheme in the L1-norm},journal={CoRR},volume={abs/1411.2344},year={2014},url={https://arxiv.org/abs/1411.2344},eprinttype={arXiv},original_url={http://arxiv.org/abs/1411.2344},biburl={https://dblp.org/rec/journals/corr/BhattacharyyaN14.bib}}
@inproceedings{DBLP:conf/esa/Bhattacharyya14,author={Bhattacharyya, Arnab},title={Polynomial Decompositions in Polynomial Time},booktitle={ESA},editor={Schulz, Andreas S. and Wagner, Dorothea},series={Lecture Notes in Computer Science},volume={8737},pages={125--136},publisher={Springer},year={2014},doi={10.1007/978-3-662-44777-2_11},url={https://doi.org/10.1007/978-3-662-44777-2_11},biburl={https://dblp.org/rec/conf/esa/Bhattacharyya14.bib}}
Steiner transitive-closure spanners of low-dimensional posets
Piotr
Berman, Arnab
Bhattacharyya, Elena
Grigorescu, Sofya
Raskhodnikova, David P.
Woodruff, and Grigory
Yaroslavtsev
@article{DBLP:journals/combinatorica/BermanBGRWY14,author={Berman, Piotr and Bhattacharyya, Arnab and Grigorescu, Elena and Raskhodnikova, Sofya and Woodruff, David P. and Yaroslavtsev, Grigory},title={Steiner transitive-closure spanners of low-dimensional posets},journal={Combinatorica},volume={34},number={3},pages={255--277},year={2014},doi={10.1007/S00493-014-2833-9},url={https://arxiv.org/abs/1011.6100},eprinttype={arXiv},note={Conference version: ICALP 2011.},original_url={https://doi.org/10.1007/s00493-014-2833-9},biburl={https://dblp.org/rec/journals/combinatorica/BermanBGRWY14.bib}}
2013
A Bipartite Graph with Non-Unimodal Independent Set Sequence
@article{DBLP:journals/combinatorics/BhattacharyyaK13,author={Bhattacharyya, Arnab and Kahn, Jeff},title={A Bipartite Graph with Non-Unimodal Independent Set Sequence},journal={Electron. J. Comb.},volume={20},number={4},pages={11},year={2013},doi={10.37236/3034},url={https://arxiv.org/abs/1301.1752},eprinttype={arXiv},original_url={https://doi.org/10.37236/3034},biburl={https://dblp.org/rec/journals/combinatorics/BhattacharyyaK13.bib}}
An Algebraic Characterization of Testable Boolean CSPs
@inproceedings{DBLP:conf/icalp/BhattacharyyaY13,author={Bhattacharyya, Arnab and Yoshida, Yuichi},title={An Algebraic Characterization of Testable Boolean CSPs},booktitle={ICALP},editor={Fomin, Fedor V. and Freivalds, Rusins and Kwiatkowska, Marta Z. and Peleg, David},series={Lecture Notes in Computer Science},volume={7965},pages={123--134},publisher={Springer},year={2013},doi={10.1007/978-3-642-39206-1_11},url={https://doi.org/10.1007/978-3-642-39206-1_11},biburl={https://dblp.org/rec/conf/icalp/BhattacharyyaY13.bib}}
Approximation algorithms for spanner problems and Directed Steiner Forest
Piotr
Berman, Arnab
Bhattacharyya, Konstantin
Makarychev, Sofya
Raskhodnikova, and Grigory
Yaroslavtsev
Inf. Comput., 2013
Conference version: ICALP 2011. The arXiv link is to the earlier two-author version of Improved Approximation for the Directed Spanner Problem, not the complete combined journal article.
@article{DBLP:journals/iandc/BermanBMRY13,author={Berman, Piotr and Bhattacharyya, Arnab and Makarychev, Konstantin and Raskhodnikova, Sofya and Yaroslavtsev, Grigory},title={Approximation algorithms for spanner problems and Directed Steiner Forest},journal={Inf. Comput.},volume={222},pages={93--107},year={2013},doi={10.1016/J.IC.2012.10.007},url={https://arxiv.org/abs/1012.4062},eprinttype={arXiv},note={Conference version: ICALP 2011. The arXiv link is to the earlier two-author version of Improved Approximation for the Directed Spanner Problem, not the complete combined journal article.},original_url={https://doi.org/10.1016/j.ic.2012.10.007},biburl={https://dblp.org/rec/journals/iandc/BermanBMRY13.bib}}
Every locally characterized affine-invariant property is testable
Arnab
Bhattacharyya, Eldar
Fischer, Hamed
Hatami, Pooya
Hatami, and Shachar
Lovett
@inproceedings{DBLP:conf/stoc/BhattacharyyaFHHL13,author={Bhattacharyya, Arnab and Fischer, Eldar and Hatami, Hamed and Hatami, Pooya and Lovett, Shachar},title={Every locally characterized affine-invariant property is testable},booktitle={STOC},editor={Boneh, Dan and Roughgarden, Tim and Feigenbaum, Joan},pages={429--436},publisher={{ACM}},year={2013},doi={10.1145/2488608.2488662},url={https://arxiv.org/abs/1212.3849},eprinttype={arXiv},original_url={https://doi.org/10.1145/2488608.2488662},biburl={https://dblp.org/rec/conf/stoc/BhattacharyyaFHHL13.bib}}
Guest column: on testing affine-invariant properties over finite fields
@inproceedings{DBLP:conf/innovations/BhattacharyyaBCN13,author={Bhattacharyya, Arnab and Braverman, Mark and Chazelle, Bernard and Nguyen, Huy L.},title={On the convergence of the Hegselmann-Krause system},booktitle={ITCS},editor={Kleinberg, Robert D.},pages={61--66},publisher={{ACM}},year={2013},doi={10.1145/2422436.2422446},url={https://arxiv.org/abs/1211.1909},eprinttype={arXiv},original_url={https://doi.org/10.1145/2422436.2422446},biburl={https://dblp.org/rec/conf/innovations/BhattacharyyaBCN13.bib}}
@inproceedings{DBLP:conf/soda/BhattacharyyaFL13,author={Bhattacharyya, Arnab and Fischer, Eldar and Lovett, Shachar},title={Testing Low Complexity Affine-Invariant Properties},booktitle={SODA},editor={Khanna, Sanjeev},pages={1337--1355},publisher={{SIAM}},year={2013},doi={10.1137/1.9781611973105.97},url={https://arxiv.org/abs/1201.0330},eprinttype={arXiv},original_url={https://doi.org/10.1137/1.9781611973105.97},biburl={https://dblp.org/rec/conf/soda/BhattacharyyaFL13.bib}}
2012
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Arnab
Bhattacharyya, Elena
Grigorescu, Madhav
Jha, Kyomin
Jung, Sofya
Raskhodnikova, and David P.
Woodruff
@article{DBLP:journals/siamdm/BhattacharyyaGJJRW12,author={Bhattacharyya, Arnab and Grigorescu, Elena and Jha, Madhav and Jung, Kyomin and Raskhodnikova, Sofya and Woodruff, David P.},title={Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners},journal={{SIAM} J. Discret. Math.},volume={26},number={2},pages={618--646},year={2012},doi={10.1137/100808186},url={https://doi.org/10.1137/100808186},note={Conference version: RANDOM 2010.},biburl={https://dblp.org/rec/journals/siamdm/BhattacharyyaGJJRW12.bib}}
Testing Odd-Cycle-Freeness in Boolean Functions
Arnab
Bhattacharyya, Elena
Grigorescu, Prasad
Raghavendra, and Asaf
Shapira
@article{DBLP:journals/cpc/BhattacharyyaGRS12,author={Bhattacharyya, Arnab and Grigorescu, Elena and Raghavendra, Prasad and Shapira, Asaf},title={Testing Odd-Cycle-Freeness in Boolean Functions},journal={Comb. Probab. Comput.},volume={21},number={6},pages={835--855},year={2012},doi={10.1017/S0963548312000363},url={https://arxiv.org/abs/1105.1325},eprinttype={arXiv},note={Conference version: SODA 2012.},original_url={https://doi.org/10.1017/S0963548312000363},biburl={https://dblp.org/rec/journals/cpc/BhattacharyyaGRS12.bib}}
Testing Permanent Oracles - Revisited
Sanjeev
Arora, Arnab
Bhattacharyya, Rajsekar
Manokaran, and Sushant
Sachdeva
@inproceedings{DBLP:conf/approx/AroraBMS12,author={Arora, Sanjeev and Bhattacharyya, Arnab and Manokaran, Rajsekar and Sachdeva, Sushant},title={Testing Permanent Oracles - Revisited},booktitle={RANDOM},editor={Gupta, Anupam and Jansen, Klaus and Rolim, Jos{\'{e}} D. P. and Servedio, Rocco A.},series={Lecture Notes in Computer Science},volume={7408},pages={362--373},publisher={Springer},year={2012},doi={10.1007/978-3-642-32512-0_31},url={https://arxiv.org/abs/1207.4783},eprinttype={arXiv},original_url={https://doi.org/10.1007/978-3-642-32512-0_31},biburl={https://dblp.org/rec/conf/approx/AroraBMS12.bib}}
Transitive-Closure Spanners
Arnab
Bhattacharyya, Elena
Grigorescu, Kyomin
Jung, Sofya
Raskhodnikova, and David P.
Woodruff
@article{DBLP:journals/siamcomp/BhattacharyyaGJRW12,author={Bhattacharyya, Arnab and Grigorescu, Elena and Jung, Kyomin and Raskhodnikova, Sofya and Woodruff, David P.},title={Transitive-Closure Spanners},journal={{SIAM} J. Comput.},volume={41},number={6},pages={1380--1425},year={2012},doi={10.1137/110826655},url={https://arxiv.org/abs/0808.1787},eprinttype={arXiv},note={Conference version: SODA 2009.},original_url={https://doi.org/10.1137/110826655},biburl={https://dblp.org/rec/journals/siamcomp/BhattacharyyaGJRW12.bib}}
2011
Testability of linear-invariant properties
Arnab
Bhattacharyya
Massachusetts Institute of Technology, Cambridge, MA, USA, 2011
@phdthesis{DBLP:phd/ndltd/Bhattacharyya11,author={Bhattacharyya, Arnab},title={Testability of linear-invariant properties},school={Massachusetts Institute of Technology, Cambridge, MA, {USA}},year={2011},url={https://hdl.handle.net/1721.1/68435},biburl={https://dblp.org/rec/phd/ndltd/Bhattacharyya11.bib}}
Testing Linear-Invariant Non-Linear Properties
Arnab
Bhattacharyya, Victor
Chen, Madhu
Sudan, and Ning
Xie
Theory Comput., 2011
Conference version: STACS 2009. A short-report version also appeared in Property Testing: Current Research and Surveys (2010).
@article{DBLP:journals/toc/BhattacharyyaCSX11,author={Bhattacharyya, Arnab and Chen, Victor and Sudan, Madhu and Xie, Ning},title={Testing Linear-Invariant Non-Linear Properties},journal={Theory Comput.},volume={7},number={1},pages={75--99},year={2011},doi={10.4086/TOC.2011.V007A006},url={https://arxiv.org/abs/0809.2378},eprinttype={arXiv},note={Conference version: STACS 2009. A short-report version also appeared in Property Testing: Current Research and Surveys (2010).},original_url={https://doi.org/10.4086/toc.2011.v007a006},biburl={https://dblp.org/rec/journals/toc/BhattacharyyaCSX11.bib}}
Testing monotonicity of distributions over general partial orders
Arnab
Bhattacharyya, Eldar
Fischer, Ronitt
Rubinfeld, and Paul
Valiant
@inproceedings{DBLP:conf/innovations/BhattacharyyaFRV11,author={Bhattacharyya, Arnab and Fischer, Eldar and Rubinfeld, Ronitt and Valiant, Paul},title={Testing monotonicity of distributions over general partial orders},booktitle={ICS},editor={Chazelle, Bernard},pages={239--252},publisher={Tsinghua University Press},year={2011},url={http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/38.html},biburl={https://dblp.org/rec/conf/innovations/BhattacharyyaFRV11.bib}}
The Complexity of Linear Dependence Problems in Vector Spaces
Arnab
Bhattacharyya, Piotr
Indyk, David P.
Woodruff, and Ning
Xie
@inproceedings{DBLP:conf/innovations/BhattacharyyaIWX11,author={Bhattacharyya, Arnab and Indyk, Piotr and Woodruff, David P. and Xie, Ning},title={The Complexity of Linear Dependence Problems in Vector Spaces},booktitle={ICS},editor={Chazelle, Bernard},pages={496--508},publisher={Tsinghua University Press},year={2011},url={http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/33.html},biburl={https://dblp.org/rec/conf/innovations/BhattacharyyaIWX11.bib}}
2010
Optimal Testing of Reed-Muller Codes
Arnab
Bhattacharyya, Swastik
Kopparty, Grant
Schoenebeck, Madhu
Sudan, and David
Zuckerman
In FOCS, 2010
A chapter version also appeared in Property Testing: Current Research and Surveys (2010).
@inproceedings{DBLP:conf/focs/BhattacharyyaKSSZ10,author={Bhattacharyya, Arnab and Kopparty, Swastik and Schoenebeck, Grant and Sudan, Madhu and Zuckerman, David},title={Optimal Testing of Reed-Muller Codes},booktitle={FOCS},pages={488--497},publisher={{IEEE} Computer Society},year={2010},doi={10.1109/FOCS.2010.54},url={https://arxiv.org/abs/0910.0641},eprinttype={arXiv},note={A chapter version also appeared in Property Testing: Current Research and Surveys (2010).},original_url={https://doi.org/10.1109/FOCS.2010.54},biburl={https://dblp.org/rec/conf/focs/BhattacharyyaKSSZ10.bib}}
Separations of Matroid Freeness Properties
Arnab
Bhattacharyya, Elena
Grigorescu, Jakob
Nordström, and Ning
Xie
@article{DBLP:journals/corr/abs-1008-4401,author={Bhattacharyya, Arnab and Grigorescu, Elena and Nordstr{\"{o}}m, Jakob and Xie, Ning},title={Separations of Matroid Freeness Properties},journal={CoRR},volume={abs/1008.4401},year={2010},url={https://arxiv.org/abs/1008.4401},eprinttype={arXiv},original_url={http://arxiv.org/abs/1008.4401},biburl={https://dblp.org/rec/journals/corr/abs-1008-4401.bib}}
@article{DBLP:journals/eccc/BhattacharyyaGJRW09,author={Bhattacharyya, Arnab and Grigorescu, Elena and Jung, Kyomin and Raskhodnikova, Sofya and Woodruff, David P.},title={Transitive-Closure Spanners of the Hypercube and the Hypergrid},journal={Electron. Colloquium Comput. Complex.},volume={{TR09}},year={2009},url={https://eccc.weizmann.ac.il/report/2009/046},eprinttype={ECCC},biburl={https://dblp.org/rec/journals/eccc/BhattacharyyaGJRW09.bib},eid={{TR09-046}}}
2008
A Note on the Distance to Monotonicity of Boolean Functions
@article{DBLP:journals/eccc/Bhattacharyya08,author={Bhattacharyya, Arnab},title={A Note on the Distance to Monotonicity of Boolean Functions},journal={Electron. Colloquium Comput. Complex.},volume={{TR08}},year={2008},url={https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-012/index.html},eprinttype={ECCC},biburl={https://dblp.org/rec/journals/eccc/Bhattacharyya08.bib},eid={{TR08-012}}}
@inproceedings{DBLP:conf/cf/Bhattacharyya06,author={Bhattacharyya, Arnab},title={Morphogenesis as an amorphous computation},booktitle={Third Conference on Computing Frontiers},pages={53--64},publisher={{ACM}},year={2006},doi={10.1145/1128022.1128032},url={https://doi.org/10.1145/1128022.1128032},biburl={https://dblp.org/rec/conf/cf/Bhattacharyya06.bib}}
@inproceedings{DBLP:conf/oopsla/BhattacharryaF04,author={Bhattacharyya, Arnab and Fuhrer, Robert M.},title={Smell detection for eclipse},booktitle={Companion to the {OOPSLA}},editor={Vlissides, John M. and Schmidt, Douglas C.},pages={22},publisher={{ACM}},year={2004},doi={10.1145/1028664.1028677},url={https://doi.org/10.1145/1028664.1028677},biburl={https://dblp.org/rec/conf/oopsla/BhattacharryaF04.bib}}