default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSutanu Gayen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance Meets Probabilistic Inference. ICML 2024- [i13]Arnab Bhattacharyya, Sutanu Gayen, Philips George John, Sayantan Sen, N. V. Vinodchandran:
Distribution Learning Meets Graph Structure Sampling. CoRR abs/2405.07914 (2024) - [i12]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance for Product Distributions is #P-Complete. CoRR abs/2405.08255 (2024) - [i11]Arnab Bhattacharyya, Davin Choo, Sutanu Gayen, Dimitrios Myrisiotis:
Learnability of Parameter-Bounded Bayes Nets. CoRR abs/2407.00927 (2024) - 2023
- [j1]Arnab Bhattacharyya, Sutanu Gayen
, Eric Price, Vincent Y. F. Tan, N. V. Vinodchandran:
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu. SIAM J. Comput. 52(3): 761-793 (2023) - [c11]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
On Approximating Total Variation Distance. IJCAI 2023: 3479-3487 - [i10]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance Estimation Is as Easy as Probabilistic Inference. CoRR abs/2309.09134 (2023) - [i9]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance Estimation Is as Easy as Probabilistic Inference. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c10]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Vedant Raval, N. Variyam Vinodchandran:
Efficient interventional distribution learning in the PAC framework. AISTATS 2022: 7531-7549 - [c9]Arnab Bhattacharyya, Davin Choo, Rishikesh Gajjala, Sutanu Gayen, Yuhao Wang:
Learning Sparse Fixed-Structure Gaussian Bayesian Networks. AISTATS 2022: 9400-9429 - [i8]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran:
On Approximating Total Variation Distance. CoRR abs/2206.07209 (2022) - 2021
- [c8]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran:
Testing Product Distributions: A Closer Look. ALT 2021: 367-396 - [c7]Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran:
Near-optimal learning of tree-structured distributions by Chow-Liu. STOC 2021: 147-160 - [i7]Arnab Bhattacharyya, Davin Choo, Rishikesh Gajjala, Sutanu Gayen, Yuhao Wang:
Learning Sparse Fixed-Structure Gaussian Bayesian Networks. CoRR abs/2107.10450 (2021) - [i6]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Vedant Raval, N. V. Vinodchandran:
Efficient inference of interventional distributions. CoRR abs/2107.11712 (2021) - 2020
- [c6]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Ashwin Maran, N. Variyam Vinodchandran:
Learning and Sampling of Atomic Interventions from Observations. ICML 2020: 842-853 - [c5]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, N. V. Vinodchandran:
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. NeurIPS 2020 - [c4]Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran:
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. TCC (1) 2020: 684-704 - [i5]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Ashwin Maran, N. V. Vinodchandran:
Efficiently Learning and Sampling Interventional Distributions from Observations. CoRR abs/2002.04232 (2020) - [i4]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, N. V. Vinodchandran:
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. CoRR abs/2002.05378 (2020) - [i3]Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran:
Near-Optimal Learning of Tree-Structured Distributions by Chow-Liu. CoRR abs/2011.04144 (2020) - [i2]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran:
Testing Product Distributions: A Closer Look. CoRR abs/2012.14632 (2020) - [i1]Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran:
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. IACR Cryptol. ePrint Arch. 2020: 768 (2020)
2010 – 2019
- 2018
- [c3]Sairam Behera, Sutanu Gayen, Jitender S. Deogun, N. V. Vinodchandran:
KmerEstimate: A Streaming Algorithm for Estimating k-mer Counts with Optimal Space Usage. BCB 2018: 438-447 - [c2]Sutanu Gayen, N. V. Vinodchandran:
New Algorithms for Distributed Sliding Windows. SWAT 2018: 22:1-22:15 - 2016
- [c1]Sutanu Gayen, N. V. Vinodchandran:
Algorithms for k-median Clustering over Distributed Streams. COCOON 2016: 535-546
Coauthor Index
aka: N. Variyam Vinodchandran
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
