default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDN. V. Vinodchandran
N. Variyam Vinodchandran
Person information
- affiliation: University of Nebraska-Lincoln, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j36]Aduri Pavan
, Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
On the Feasibility of Forgetting in Data Streams. Proc. ACM Manag. Data 2(2): 102 (2024)- [j35]Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, N. Variyam Vinodchandran:
A Scalable $t$t-Wise Coverage Estimator: Algorithms and Applications. IEEE Trans. Software Eng. 50(8): 2021-2039 (2024) - [c58]Mridul Nandi, N. V. Vinodchandran, Arijit Ghosh, Kuldeep S. Meel, Soumit Pal, Sourav Chakraborty:
Improved Streaming Algorithm for the Klee's Measure Problem and Generalizations. APPROX/RANDOM 2024: 26:1-26:21 - [c57]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance Meets Probabilistic Inference. ICML 2024 - [i40]Arnab Bhattacharyya, Sutanu Gayen, Philips George John, Sayantan Sen, N. V. Vinodchandran:
Distribution Learning Meets Graph Structure Sampling. CoRR abs/2405.07914 (2024) - [i39]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) - [i38]Aleena Chanda, N. V. Vinodchandran, Bertrand Clarke:
Point Prediction for Streaming Data. CoRR abs/2408.01318 (2024) - 2023
- [j34]A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting Meets Distinct Elements. Commun. ACM 66(9): 95-102 (2023) - [j33]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) - [j32]A. Pavan, N. Variyam Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting Meets F0 Estimation. ACM Trans. Database Syst. 48(3): 7:1-7:28 (2023) - [c56]Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya:
Constraint Optimization over Semirings. AAAI 2023: 4070-4077 - [c55]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
On Approximating Total Variation Distance. IJCAI 2023: 3479-3487 - [c54]Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran:
List and Certificate Complexities in Replicable Learning. NeurIPS 2023 - [c53]Michael Chen, A. Pavan, N. V. Vinodchandran:
Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations. DISC 2023: 37:1-37:7 - [i37]Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
Distinct Elements in Streams: An Algorithm for the (Text) Book. CoRR abs/2301.10191 (2023) - [i36]Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya:
Constraint Optimization over Semirings. CoRR abs/2302.12937 (2023) - [i35]Peter Dixon, A. Pavan, Jason Vander Woude, N. V. Vinodchandran:
List and Certificate Complexities in Replicable Learning. CoRR abs/2304.02240 (2023) - [i34]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 abs/2304.04837 (2023) - [i33]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) - [i32]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
- [j31]Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting Meets Distinct Elements in a Data Stream. SIGMOD Rec. 51(1): 87-94 (2022) - [c52]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Vedant Raval, N. Variyam Vinodchandran:
Efficient interventional distribution learning in the PAC framework. AISTATS 2022: 7531-7549 - [c51]Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
Distinct Elements in Streams: An Algorithm for the (Text) Book. ESA 2022: 34:1-34:6 - [c50]Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, N. Variyam Vinodchandran:
A Scalable t-wise Coverage Estimator. ICSE 2022: 36-47 - [c49]Kuldeep S. Meel, Sourav Chakraborty, N. V. Vinodchandran:
Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size. PODS 2022: 41-52 - [c48]Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran:
Pseudodeterminism: promises and lowerbounds. STOC 2022: 1552-1565 - [i31]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran:
On Approximating Total Variation Distance. CoRR abs/2206.07209 (2022) - [i30]Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran:
Geometry of Rounding. CoRR abs/2211.02694 (2022) - [i29]Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, N. V. Vinodchandran:
The Geometry of Rounding. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c47]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran:
Testing Product Distributions: A Closer Look. ALT 2021: 367-396 - [c46]Peter Dixon, A. Pavan, N. V. Vinodchandran:
Complete Problems for Multi-Pseudodeterministic Computations. ITCS 2021: 66:1-66:16 - [c45]Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty:
Estimating the Size of Union of Sets in Streaming Models. PODS 2021: 126-137 - [c44]Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting meets F0 Estimation. PODS 2021: 299-311 - [c43]Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran:
Near-optimal learning of tree-structured distributions by Chow-Liu. STOC 2021: 147-160 - [i28]Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
Promise Problems Meet Pseudodeterminism. CoRR abs/2103.08589 (2021) - [i27]Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting meets F0 Estimation. CoRR abs/2105.00639 (2021) - [i26]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Vedant Raval, N. V. Vinodchandran:
Efficient inference of interventional distributions. CoRR abs/2107.11712 (2021) - [i25]Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
Promise Problems Meet Pseudodeterminism. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c42]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Ashwin Maran, N. Variyam Vinodchandran:
Learning and Sampling of Atomic Interventions from Observations. ICML 2020: 842-853 - [c41]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, N. V. Vinodchandran:
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. NeurIPS 2020 - [c40]Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran:
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. TCC (1) 2020: 684-704 - [i24]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Ashwin Maran, N. V. Vinodchandran:
Efficiently Learning and Sampling Interventional Distributions from Observations. CoRR abs/2002.04232 (2020) - [i23]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) - [i22]Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran:
Near-Optimal Learning of Tree-Structured Distributions by Chow-Liu. CoRR abs/2011.04144 (2020) - [i21]Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran:
Testing Product Distributions: A Closer Look. CoRR abs/2012.14632 (2020) - [i20]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
- 2019
- [i19]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. TR19 (2019) - 2018
- [j30]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): 652-667 (2018) - [c39]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 - [c38]Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
On Pseudodeterministic Approximation Algorithms. MFCS 2018: 61:1-61:11 - [c37]Sutanu Gayen, N. V. Vinodchandran:
New Algorithms for Distributed Sliding Windows. SWAT 2018: 22:1-22:15 - 2017
- [c36]Taylor Spangler, N. V. Vinodchandran, Ashok Samal, Jordan R. Green:
Fractal features for automatic detection of dysarthria. BHI 2017: 437-440 - 2016
- [c35]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: 998-1005 - [c34]Sutanu Gayen, N. V. Vinodchandran:
Algorithms for k-median Clustering over Distributed Streams. COCOON 2016: 535-546 - [c33]Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran:
A Note on the Advice Complexity of Multipass Randomized Logspace. MFCS 2016: 31:1-31:7 - [c32]Paul Quint, Stephen D. Scott, N. V. Vinodchandran, Bradley Worley:
Constrained Group Testing to Predict Binding Response of Candidate Compounds. SDM 2016: 756-764 - [c31]Myra B. Cohen, Aduri Pavan, N. V. Vinodchandran:
Budgeted testing through an algorithmic lens. SIGSOFT FSE 2016: 948-951 - 2015
- [j29]N. V. Vinodchandran, Marius Zimand:
On Optimal Language Compression for Sets in PSPACE/poly. Theory Comput. Syst. 56(3): 581-590 (2015) - [c30]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: 151-162 - [c29]Debasis Mandal, Aduri Pavan, N. V. Vinodchandran:
On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape. MFCS (2) 2015: 459-471 - 2014
- [j28]Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. Comput. Complex. 23(1): 85-98 (2014) - [c28]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: 585-595 - [i18]Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. Variyam Vinodchandran, Lin F. Yang:
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. Electron. Colloquium Comput. Complex. TR14 (2014) - [i17]N. Variyam Vinodchandran:
Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c27]Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe:
An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. CCC 2013: 277-286 - [i16]N. V. Vinodchandran, Marius Zimand:
On optimal language compression for sets in PSPACE/poly. CoRR abs/1304.1005 (2013) - 2012
- [j27]Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the power of unambiguity in log-space. Comput. Complex. 21(4): 643-670 (2012) - [j26]Raghunath Tewari, N. V. Vinodchandran:
Green's theorem and isolation in planar graphs. Inf. Comput. 215: 1-7 (2012) - [j25]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): 765-779 (2012) - [c26]Derrick Stolee, N. V. Vinodchandran:
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. CCC 2012: 326-333 - 2011
- [j24]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): 627-636 (2011) - [j23]John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. ACM Trans. Comput. Theory 3(1): 1:1-1:12 (2011) - [c25]Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. COCOON 2011: 252-258 - [c24]Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS 2011: 579-590 - [i15]Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c23]Derrick Stolee, Chris Bourke, N. V. Vinodchandran:
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. CCC 2010: 131-138 - [i14]Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the Power of Unambiguity in Logspace. CoRR abs/1001.2034 (2010) - [i13]Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. CoRR abs/1004.5080 (2010) - [i12]Ricard Gavaldà, María López-Valdés, Elvira Mayordomo, N. V. Vinodchandran:
Resource-bounded Dimension in Computational Learning Theory. CoRR abs/1010.5470 (2010) - [i11]Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. TR10 (2010) - [i10]Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the Power of Unambiguity in Logspace. Electron. Colloquium Comput. Complex. TR10 (2010) - [i9]Derrick Stolee, N. V. Vinodchandran:
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. Electron. Colloquium Comput. Complex. TR10 (2010) - [i8]Raghunath Tewari, N. V. Vinodchandran:
Green's Theorem and Isolation in Planar Graphs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j22]Chris Bourke, Raghunath Tewari, N. V. Vinodchandran:
Directed Planar Reachability Is in Unambiguous Log-Space. ACM Trans. Comput. Theory 1(1): 4:1-4:17 (2009) - [c22]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. FSTTCS 2009: 215-226 - [i7]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. Electron. Colloquium Comput. Complex. TR09 (2009) - [i6]Derrick Stolee, Chris Bourke, N. V. Vinodchandran:
A log-space algorithm for reachability in planar DAGs with few sources. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j21]Aduri Pavan, N. V. Vinodchandran:
2-Local Random Reductions to 3-Valued Functions. Comput. Complex. 17(4): 501-514 (2008) - [j20]Chris Bourke, Kun Deng, Stephen D. Scott, Robert E. Schapire, N. V. Vinodchandran:
On reoptimizing multi-class classifiers. Mach. Learn. 71(2-3): 219-242 (2008) - [j19]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. 42(2): 131-142 (2008) - [j18]Aduri Pavan, N. V. Vinodchandran:
Relations between Average-Case and Worst-Case Complexity. Theory Comput. Syst. 42(4): 596-607 (2008) - [j17]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): 2084-2098 (2008) - [j16]Ravi K. Balachandran, Xukai Zou, Byrav Ramamurthy, Amandeep Thukral, N. Variyam Vinodchandran:
An efficient and attack-resistant key agreement scheme for secure group communications in mobile ad-hoc networks. Wirel. Commun. Mob. Comput. 8(10): 1297-1312 (2008) - 2007
- [j15]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): 167-178 (2007) - [c21]Chris Bourke, Raghunath Tewari, N. V. Vinodchandran:
Directed Planar Reachability is in Unambiguous Log-Space. CCC 2007: 217-221 - 2006
- [j14]John M. Hitchcock, N. V. Vinodchandran:
Dimension, entropy rates, and compression. J. Comput. Syst. Sci. 72(4): 760-782 (2006) - [j13]Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran:
Computational depth: Concept and applications. Theor. Comput. Sci. 354(3): 391-404 (2006) - [c20]Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran:
Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS 2006: 188-199 - [c19]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: 335-345 - [c18]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: 2310-2315 - 2005
- [j12]Peter Bro Miltersen, N. V. Vinodchandran:
Derandomizing Arthur-Merlin Games using Hitting Sets. Comput. Complex. 14(3): 256-279 (2005) - [j11]N. Variyam Vinodchandran:
Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games. Int. J. Found. Comput. Sci. 16(6): 1297-1308 (2005) - [j10]N. V. Vinodchandran:
A note on the circuit complexity of PP. Theor. Comput. Sci. 347(1-2): 415-418 (2005) - [j9]Chris Bourke, John M. Hitchcock, N. V. Vinodchandran:
Entropy rates and finite-state dimension. Theor. Comput. Sci. 349(3): 392-406 (2005) - [c17]Ajay Kumar Todimala, Byrav Ramamurthy, N. V. Vinodchandran:
On computing disjoint paths with dependent cost structure in optical networks. BROADNETS 2005: 155-166 - [c16]Aduri Pavan, N. V. Vinodchandran:
Relations Between Average-Case and Worst-Case Complexity. FCT 2005: 422-432 - [c15]Ravi K. Balachandran, Byrav Ramamurthy, Xukai Zou, N. Variyam Vinodchandran:
CRTDH: an efficient key agreement scheme for secure group communications in wireless ad hoc networks. ICC 2005: 1123-1127 - [c14]Geng Hao, N. V. Vinodchandran, Byrav Ramamurthy, Xukai Zou:
A balanced key tree approach for dynamic secure group communication. ICCCN 2005: 345-350 - [i5]Aduri Pavan, N. V. Vinodchandran:
2-Local Random Reductions to 3-Valued Functions. Electron. Colloquium Comput. Complex. TR05 (2005) - [i4]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. TR05 (2005) - 2004
- [j8]N. V. Vinodchandran:
AMexp[nsube](NP[cap]coNP)/poly. Inf. Process. Lett. 89(1): 43-47 (2004) - [j7]N. V. Vinodchandran:
Counting Complexity of Solvable Black-Box Group Problems. SIAM J. Comput. 33(4): 852-869 (2004) - [c13]John M. Hitchcock, N. V. Vinodchandran:
Dimension, Entropy Rates, and Compression. CCC 2004: 174-183 - [c12]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Partial Bi-immunity and NP-Completeness. CCC 2004: 198-203 - [c11]N. V. Vinodchandran:
Learning DNFs and Circuits Using Teaching Assistants. COCOON 2004: 188-197 - [c10]Qingping Tao, Stephen Donald Scott, N. V. Vinodchandran, Thomas Takeo Osugi:
SVM-based generalized multiple-instance learning via approximate box counting. ICML 2004 - [c9]Qingping Tao, Stephen Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller:
An Extended Kernel for Generalized Multiple-Instance Learning. ICTAI 2004: 272-277 - [i3]Aduri Pavan, N. V. Vinodchandran:
Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility. Electron. Colloquium Comput. Complex. TR04 (2004) - [i2]N. V. Vinodchandran:
A note on the circuit complexity of PP. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c8]Luis Antunes, Lance Fortnow, N. V. Vinodchandran:
Using Depth to Capture Average-Case Complexity. FCT 2003: 303-310 - 2002
- [j6]Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. Chic. J. Theor. Comput. Sci. 2002 (2002) - 2000
- [j5]Vikraman Arvind, N. V. Vinodchandran:
Exact learning via teaching assistants. Theor. Comput. Sci. 241(1-2): 51-81 (2000) - [j4]Vikraman Arvind, N. V. Vinodchandran:
The counting complexity of group-definable languages. Theor. Comput. Sci. 242(1-2): 199-218 (2000)
1990 – 1999
- 1999
- [c7]Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe:
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. COCOON 1999: 210-220 - [c6]