N. V. Vinodchandran
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
35
Venues
20
Active years
1996–2026
Best venue rank
A*
Where they publish
Papers
35 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | MFCS | Fast Rational Search via Stern-Brocot Tree. | Connor Weyers, N. V. Vinodchandran |
| 2025 | ICLR | Computational Explorations of Total Variation Distance. | Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran |
| 2025 | ICLR | Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds. | Michael Chen, Aduri Pavan, N. V. Vinodchandran, Ruosong Wang, Lin Yang |
| 2024 | ICML | Total Variation Distance Meets Probabilistic Inference. | Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran |
| 2023 | AAAI | Constraint Optimization over Semirings. | Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya |
| 2023 | IJCAI | On Approximating Total Variation Distance. | Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran |
| 2022 | ESA | Distinct Elements in Streams: An Algorithm for the (Text) Book. | Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel |
| 2022 | PODS | Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size. | Kuldeep S. Meel, Sourav Chakraborty, N. V. Vinodchandran |
| 2022 | STOC | Pseudodeterminism: promises and lowerbounds. | Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran |
| 2021 | ALT | Testing Product Distributions: A Closer Look. | Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran |
| 2021 | PODS | Estimating the Size of Union of Sets in Streaming Models. | Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty |
| 2021 | PODS | Model Counting meets F | Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel |
| 2021 | STOC | Near-optimal learning of tree-structured distributions by Chow-Liu. | Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran |
| 2020 | TCC | Perfect Zero Knowledge: New Upperbounds and Relativized Separations. | Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran |
| 2018 | MFCS | On Pseudodeterministic Approximation Algorithms. | Peter Dixon, Aduri Pavan, N. V. Vinodchandran |
| 2016 | COCOON | Algorithms for k-median Clustering over Distributed Streams. | Sutanu Gayen, N. V. Vinodchandran |
| 2016 | MFCS | A Note on the Advice Complexity of Multipass Randomized Logspace. | Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran |
| 2016 | SDM | Constrained Group Testing to Predict Binding Response of Candidate Compounds. | Paul Quint, Stephen D. Scott, N. V. Vinodchandran, Bradley Worley |
| 2015 | MFCS | New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. | Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang |
| 2015 | MFCS | On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape. | Debasis Mandal, Aduri Pavan, N. V. Vinodchandran |
| 2011 | COCOON | ReachFewL = ReachUL. | Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran |
| 2006 | ICALP | Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. | Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang |
| 2005 | Broadnets | On computing disjoint paths with dependent cost structure in optical networks. | Ajay Kumar Todimala, Byrav Ramamurthy, N. V. Vinodchandran |
| 2005 | FCT | Relations Between Average-Case and Worst-Case Complexity. | Aduri Pavan, N. V. Vinodchandran |
| 2005 | ICCCN | A balanced key tree approach for dynamic secure group communication. | Geng Hao, N. V. Vinodchandran, Byrav Ramamurthy, Xukai Zou |
| 2004 | COCOON | Learning DNFs and Circuits Using Teaching Assistants. | N. V. Vinodchandran |
| 2004 | ICML | SVM-based generalized multiple-instance learning via approximate box counting. | Qingping Tao, Stephen Donald Scott, N. V. Vinodchandran, Thomas Takeo Osugi |
| 2004 | ICTAI | An Extended Kernel for Generalized Multiple-Instance Learning. | Qingping Tao, Stephen Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller |
| 2003 | FCT | Using Depth to Capture Average-Case Complexity. | Luis Antunes, Lance Fortnow, N. V. Vinodchandran |
| 1999 | COCOON | Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. | Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe |
| 1999 | FOCS | Derandomizing Arthur-Merlin Games Using Hitting Sets. | Peter Bro Miltersen, N. V. Vinodchandran |
| 1999 | ISAAC | The Query Complexity of Program Checking by Constant-Depth Circuits. | Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran |
| 1997 | ALT | Exact Learning via Teaching Assistants (Extended Abstract). | Vikraman Arvind, N. V. Vinodchandran |
| 1996 | ALT | The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). | Vikraman Arvind, N. V. Vinodchandran |
| 1996 | STACS | Solvable Black-Box Group Problems Are Low for PP. | Vikraman Arvind, N. V. Vinodchandran |