N. V. Vinodchandran

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 49

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

PODS

STOC

Publications

Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
Total Variation Distance for Product Distributions is #P-Complete. CoRR (2024)
Aduri Pavan, Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel
On the Feasibility of Forgetting in Data Streams. Proc. ACM Manag. Data 2 (2) (2024)
Arnab Bhattacharyya, Sutanu Gayen, Philips George John, Sayantan Sen, N. V. Vinodchandran
Distribution Learning Meets Graph Structure Sampling. CoRR (2024)
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
On Approximating Total Variation Distance. IJCAI (2023)
Peter Dixon, A. Pavan, Jason Vander Woude, N. V. Vinodchandran
List and Certificate Complexities in Replicable Learning. CoRR (2023)
Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya
Constraint Optimization over Semirings. CoRR (2023)
Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma. CoRR (2023)
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) (2023)
Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel
Distinct Elements in Streams: An Algorithm for the (Text) Book. CoRR (2023)
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 (2023)
A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
Model Counting Meets Distinct Elements. Commun. ACM 66 (9) (2023)
Michael Chen, A. Pavan, N. V. Vinodchandran
Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations. DISC (2023)
Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran
List and Certificate Complexities in Replicable Learning. NeurIPS (2023)
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. (2023)
Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya
Constraint Optimization over Semirings. AAAI (2023)
A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
Model Counting Meets Distinct Elements in a Data Stream. SIGMOD Rec. 51 (1) (2022)
Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran
Pseudodeterminism: promises and lowerbounds. STOC (2022)
Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
Geometry of Rounding. CoRR (2022)
Kuldeep S. Meel, Sourav Chakraborty, N. V. Vinodchandran
Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size. PODS (2022)
Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, N. V. Vinodchandran
The Geometry of Rounding. Electron. Colloquium Comput. Complex. (2022)
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran
On Approximating Total Variation Distance. CoRR (2022)
Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel
Distinct Elements in Streams: An Algorithm for the (Text) Book. ESA (2022)
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Vedant Raval, N. V. Vinodchandran
Efficient inference of interventional distributions. CoRR (2021)
Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharya, Kuldeep S. Meel
Estimation. PODS (2021)
Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty
Estimating the Size of Union of Sets in Streaming Models. PODS (2021)
Peter Dixon, A. Pavan, N. V. Vinodchandran
Complete Problems for Multi-Pseudodeterministic Computations. ITCS (2021)
Peter Dixon, Aduri Pavan, N. V. Vinodchandran
Promise Problems Meet Pseudodeterminism. Electron. Colloquium Comput. Complex. 28 (2021)
Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
Model Counting meets F0 Estimation. CoRR (2021)
Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran
Near-optimal learning of tree-structured distributions by Chow-Liu. STOC (2021)
Peter Dixon, Aduri Pavan, N. V. Vinodchandran
Promise Problems Meet Pseudodeterminism. CoRR (2021)
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran
Testing Product Distributions: A Closer Look. ALT (2021)
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Ashwin Maran, N. V. Vinodchandran
Efficiently Learning and Sampling Interventional Distributions from Observations. CoRR (2020)
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran
Testing Product Distributions: A Closer Look. CoRR (2020)
Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. IACR Cryptol. ePrint Arch. 2020 (2020)
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, N. V. Vinodchandran
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. NeurIPS (2020)
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, N. V. Vinodchandran
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. CoRR (2020)
Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. TCC (1) (2020)
Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran
Near-Optimal Learning of Tree-Structured Distributions by Chow-Liu. CoRR (2020)
Ryo Ashida, Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N. V. Vinodchandran, Osamu Watanabe
A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs. Electron. Colloquium Comput. Complex. 26 (2019)
Peter Dixon, Aduri Pavan, N. V. Vinodchandran
On Pseudodeterministic Approximation Algorithms. MFCS (2018)
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)
Sutanu Gayen, N. V. Vinodchandran
New Algorithms for Distributed Sliding Windows. SWAT (2018)
Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. Algorithmica 80 (2) (2018)
Taylor Spangler, N. V. Vinodchandran, Ashok Samal, Jordan R. Green
Fractal features for automatic detection of dysarthria. BHI (2017)
Paul Quint, Stephen D. Scott, N. V. Vinodchandran, Bradley Worley
Constrained Group Testing to Predict Binding Response of Candidate Compounds. SDM (2016)
Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran
A Note on the Advice Complexity of Multipass Randomized Logspace. MFCS (2016)
Aduri Pavan, Paul Quint, Stephen D. Scott, N. V. Vinodchandran, J. Smith
Computing triangle and open-wedge heavy-hitters in large networks. IEEE BigData (2016)
Myra B. Cohen, Aduri Pavan, N. V. Vinodchandran
Budgeted testing through an algorithmic lens. SIGSOFT FSE (2016)
Sutanu Gayen, N. V. Vinodchandran
Algorithms for k-median Clustering over Distributed Streams. COCOON (2016)
Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. MFCS (2) (2015)
Debasis Mandal, Aduri Pavan, N. V. Vinodchandran
On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape. MFCS (2) (2015)
N. V. Vinodchandran, Marius Zimand
On Optimal Language Compression for Sets in PSPACE/poly. Theory Comput. Syst. 56 (3) (2015)
Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. FSTTCS (2014)
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
ReachFewL = ReachUL. Comput. Complex. 23 (1) (2014)
N. V. Vinodchandran, Marius Zimand
On optimal language compression for sets in PSPACE/poly CoRR (2013)
Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe
An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. Computational Complexity Conference (2013)
Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
On the power of unambiguity in log-space. Comput. Complex. 21 (4) (2012)
Derrick Stolee, N. V. Vinodchandran
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. Computational Complexity Conference (2012)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. 78 (3) (2012)
Raghunath Tewari, N. V. Vinodchandran
Green's theorem and isolation in planar graphs. Inf. Comput. 215 (2012)
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
ReachFewL = ReachUL. Electron. Colloquium Comput. Complex. 18 (2011)
Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
Extracting Kolmogorov complexity with applications to dimension zero-one laws. Inf. Comput. 209 (4) (2011)
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
ReachFewL = ReachUL. COCOON (2011)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. 17 (2010)
Raghunath Tewari, N. V. Vinodchandran
Green's Theorem and Isolation in Planar Graphs. Electron. Colloquium Comput. Complex. 17 (2010)
Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
On the Power of Unambiguity in Logspace CoRR (2010)
Ricard Gavaldà, María López-Valdés, Elvira Mayordomo, N. V. Vinodchandran
Resource-bounded Dimension in Computational Learning Theory CoRR (2010)
Derrick Stolee, N. V. Vinodchandran
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. Electron. Colloquium Comput. Complex. 17 (2010)
Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
On the Power of Unambiguity in Logspace. Electron. Colloquium Comput. Complex. 17 (2010)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs CoRR (2010)
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. Computational Complexity Conference (2010)
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
Kolmogorov Complexity in Randomness Extraction. FSTTCS (2009)
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
A log-space algorithm for reachability in planar DAGs with few sources. Electron. Colloquium Comput. Complex. 16 (2009)
Chris Bourke, Raghunath Tewari, N. V. Vinodchandran
Directed Planar Reachability Is in Unambiguous Log-Space. ACM Trans. Comput. Theory 1 (1) (2009)
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
Kolmogorov Complexity in Randomness Extraction. Electron. Colloquium Comput. Complex. 16 (2009)
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. 42 (2) (2008)
Qingping Tao, Stephen D. Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller
Kernels for Generalized Multiple-Instance Learning. IEEE Trans. Pattern Anal. Mach. Intell. 30 (12) (2008)
Aduri Pavan, N. V. Vinodchandran
2-Local Random Reductions to 3-Valued Functions. Comput. Complex. 17 (4) (2008)
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E. Schapire, N. V. Vinodchandran
On reoptimizing multi-class classifiers. Mach. Learn. 71 (2-3) (2008)
Aduri Pavan, N. V. Vinodchandran
Relations between Average-Case and Worst-Case Complexity. Theory Comput. Syst. 42 (4) (2008)
Chris Bourke, Raghunath Tewari, N. V. Vinodchandran
Directed Planar Reachability is in Unambiguous Log-Space. Computational Complexity Conference (2007)
Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. 385 (1-3) (2007)
Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. ICALP (1) (2006)
Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran
Computational depth: Concept and applications. Theor. Comput. Sci. 354 (3) (2006)
Sarang Deshpande, Ajay Kumar Todimala, Ravi K. Balachandran, Byrav Ramamurthy, Xukai Zou, N. V. Vinodchandran
A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks. ICC (2006)
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS (2006)
John M. Hitchcock, N. V. Vinodchandran
Dimension, entropy rates, and compression. J. Comput. Syst. Sci. 72 (4) (2006)
Chris Bourke, John M. Hitchcock, N. V. Vinodchandran
Entropy rates and finite-state dimension. Theor. Comput. Sci. 349 (3) (2005)
Ajay Kumar Todimala, Byrav Ramamurthy, N. V. Vinodchandran
On computing disjoint paths with dependent cost structure in optical networks. BROADNETS (2005)
N. V. Vinodchandran
A note on the circuit complexity of PP. Theor. Comput. Sci. 347 (1-2) (2005)
Aduri Pavan, N. V. Vinodchandran
Relations Between Average-Case and Worst-Case Complexity. FCT (2005)
Peter Bro Miltersen, N. V. Vinodchandran
Derandomizing Arthur-Merlin Games using Hitting Sets. Comput. Complex. 14 (3) (2005)
Aduri Pavan, N. V. Vinodchandran
2-Local Random Reductions to 3-Valued Functions Electron. Colloquium Comput. Complex. (062) (2005)
Geng Hao, N. V. Vinodchandran, Byrav Ramamurthy, Xukai Zou
A balanced key tree approach for dynamic secure group communication. ICCCN (2005)
Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws Electron. Colloquium Comput. Complex. (105) (2005)
Aduri Pavan, N. V. Vinodchandran
Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility Electron. Colloquium Comput. Complex. (053) (2004)
N. V. Vinodchandran
Counting Complexity of Solvable Black-Box Group Problems. SIAM J. Comput. 33 (4) (2004)
N. V. Vinodchandran
[nsube](NP[cap]coNP)/poly. Inf. Process. Lett. 89 (1) (2004)
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
Partial Bi-immunity and NP-Completeness. Computational Complexity Conference (2004)
Qingping Tao, Stephen Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller
An Extended Kernel for Generalized Multiple-Instance Learning. ICTAI (2004)

N. V. Vinodchandran.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

N. V. Vinodchandran