Vinodchandran Variyam
University of Nebraska-Lincoln
H-index: 20
North America-United States
Top articles of Vinodchandran Variyam
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
List and certificate complexities in replicable learning | Advances in Neural Information Processing Systems | Peter Dixon A Pavan Jason Vander Woude NV Vinodchandran | 2024/2/13 |
Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma | arXiv preprint arXiv:2304.04837 | Jason Vander Woude Peter Dixon A Pavan Jamie Radcliffe NV Vinodchandran | 2023/4/10 |
Distinct Elements in Streams: An Algorithm for the (Text) Book | arXiv preprint arXiv:2301.10191 | Sourav Chakraborty NV Vinodchandran Kuldeep S Meel | 2023/1/24 |
Total Variation Distance Estimation Is as Easy as Probabilistic Inference | arXiv preprint arXiv:2309.09134 | Arnab Bhattacharyya Sutanu Gayen Kuldeep S Meel Dimitrios Myrisiotis A Pavan | 2023/9/17 |
Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations | Michael Chen A Pavan NV Vinodchandran | 2023 | |
Model Counting Meets Distinct Elements | Communications of the ACM | A Pavan NV Vinodchandran Arnab Bhattacharyya Kuldeep S Meel | 2023/8/23 |
Constraint optimization over semirings | Proceedings of the AAAI Conference on Artificial Intelligence | Aduri Pavan Kuldeep S Meel NV Vinodchandran Arnab Bhattacharyya | 2023/6/26 |
Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube | arXiv preprint arXiv:2306.12593 | Jason Vander Woude Peter Dixon A Pavan Jamie Radcliffe NV Vinodchandran | 2023/6/21 |
Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size | Kuldeep S Meel Sourav Chakraborty NV Vinodchandran | 2022/6/12 | |
Pseudodeterminism: promises and lowerbounds | Peter Dixon Aduri Pavan Jason Vander Woude NV Vinodchandran | 2022/6/9 | |
Model Counting Meets Distinct Elements in a Data Stream | ACM SIGMOD Record | A Pavan NV Vinodchandran Arnab Bhattacharyya Kuldeep S Meel | 2022/6/1 |
Efficient interventional distribution learning in the PAC framework | Arnab Bhattacharyya Sutanu Gayen Saravanan Kandasamy Vedant Raval Vinodchandran N Variyam | 2022/5/3 | |
Geometry of Rounding | arXiv preprint arXiv:2211.02694 | Jason Vander Woude Peter Dixon A Pavan Jamie Radcliffe NV Vinodchandran | 2022/11/4 |
On approximating total variation distance | arXiv preprint arXiv:2206.07209 | Arnab Bhattacharyya Sutanu Gayen Kuldeep S Meel Dimitrios Myrisiotis Aduri Pavan | 2022/6/14 |
Estimating the size of union of sets in streaming models | Kuldeep S Meel NV Vinodchandran Sourav Chakraborty | 2021/6/20 | |
Complete problems for multi-pseudodeterministic computations | Innovations in Theoretical Computer Science | Peter Dixon Aduri Pavan NV Vinodchandran | 2021/1 |
Model Counting meets F0 Estimation | Aduri Pavan NV Vinodchandran Arnab Bhattacharya Kuldeep S Meel | 2021/6/20 | |
Near-optimal learning of tree-structured distributions by Chow-Liu | SIAM Journal of Computing | Arnab Bhattacharyya Sutanu Gayen Eric Price Vincent Y. F. Tan N. V. Vinodchandran | 2023 |
The magazine archive includes every article published in Communications of the ACM for over the past 50 years. | Communications of the ACM | Gary Lewandowski Dennis J Bouvier Tzu-Yi Chen Robert McCartney Kate Sanders | 2010/7 |
Promise problems meet pseudodeterminism | arXiv preprint arXiv:2103.08589 | Peter Dixon Aduri Pavan NV Vinodchandran | 2021/3/15 |
Co-Authors
