Search the dblp DataBase
N. V. Vinodchandran :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Vikraman Arvind , N. V. Vinodchandran The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ALT, 1996, pp:100-112 [Conf ] Vikraman Arvind , N. V. Vinodchandran Exact Learning via Teaching Assistants (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ALT, 1997, pp:291-306 [Conf ] Ajay Kumar Todimala , Byrav Ramamurthy , N. V. Vinodchandran On computing disjoint paths with dependent cost structure in optical networks. [Citation Graph (0, 0)][DBLP ] BROADNETS, 2005, pp:155-166 [Conf ] John M. Hitchcock , Aduri Pavan , N. V. Vinodchandran Partial Bi-immunity and NP-Completeness. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2004, pp:198-203 [Conf ] John M. Hitchcock , N. V. Vinodchandran Dimension, Entropy Rates, and Compression. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2004, pp:174-183 [Conf ] Peter Bro Miltersen , N. V. Vinodchandran , Osamu Watanabe Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:210-220 [Conf ] N. V. Vinodchandran Learning DNFs and Circuits Using Teaching Assistants. [Citation Graph (0, 0)][DBLP ] COCOON, 2004, pp:188-197 [Conf ] Luis Antunes , Lance Fortnow , N. V. Vinodchandran Using Depth to Capture Average-Case Complexity. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:303-310 [Conf ] Aduri Pavan , N. V. Vinodchandran Relations Between Average-Case and Worst-Case Complexity. [Citation Graph (0, 0)][DBLP ] FCT, 2005, pp:422-432 [Conf ] Peter Bro Miltersen , N. V. Vinodchandran Derandomizing Arthur-Merlin Games Using Hitting Sets. [Citation Graph (0, 0)][DBLP ] FOCS, 1999, pp:71-80 [Conf ] Aduri Pavan , Rahul Santhanam , N. V. Vinodchandran Some Results on Average-Case Hardness Within the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2006, pp:188-199 [Conf ] N. V. Vinodchandran Improved Lowness Results for Solvable Black-box Group Problems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1997, pp:220-234 [Conf ] Lance Fortnow , John M. Hitchcock , Aduri Pavan , N. V. Vinodchandran , Fengming Wang Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. [Citation Graph (0, 0)][DBLP ] ICALP (1), 2006, pp:335-345 [Conf ] Qingping Tao , Stephen Scott , N. V. Vinodchandran , Thomas Takeo Osugi SVM-based generalized multiple-instance learning via approximate box counting. [Citation Graph (0, 0)][DBLP ] ICML, 2004, pp:- [Conf ] Qingping Tao , Stephen Scott , N. V. Vinodchandran , Thomas Takeo Osugi , Brandon Mueller An Extended Kernel for Generalized Multiple-Instance Learning. [Citation Graph (0, 0)][DBLP ] ICTAI, 2004, pp:272-277 [Conf ] Vikraman Arvind , K. V. Subrahmanyam , N. V. Vinodchandran The Query Complexity of Program Checking by Constant-Depth Circuits. [Citation Graph (0, 0)][DBLP ] ISAAC, 1999, pp:123-132 [Conf ] Vikraman Arvind , N. V. Vinodchandran Solvable Black-Box Group Problems Are Low for PP. [Citation Graph (0, 0)][DBLP ] STACS, 1996, pp:99-110 [Conf ] Peter Bro Miltersen , N. V. Vinodchandran Derandomizing Arthur-Merlin Games using Hitting Sets. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 2005, v:14, n:3, pp:256-279 [Journal ] Vikraman Arvind , K. V. Subrahmanyam , N. V. Vinodchandran The Query Complexity of Program Checking by Constant-Depth Circuits. [Citation Graph (0, 0)][DBLP ] Chicago J. Theor. Comput. Sci., 2002, v:2002, n:, pp:- [Journal ] Aduri Pavan , N. V. Vinodchandran Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:053, pp:- [Journal ] N. V. Vinodchandran A note on the circuit complexity of PP [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:056, pp:- [Journal ] Aduri Pavan , N. V. Vinodchandran 2-Local Random Reductions to 3-Valued Functions [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:062, pp:- [Journal ] Lance Fortnow , John M. Hitchcock , Aduri Pavan , N. V. Vinodchandran , Fengming Wang Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:105, pp:- [Journal ] Vikraman Arvind , K. V. Subrahmanyam , N. V. Vinodchandran The Query Complexity of Program Checking by Constant-Depth Circuits [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:78, pp:- [Journal ] Meena Mahajan , Thomas Thierauf , N. V. Vinodchandran A Note on SpanP Functions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:1, pp:7-10 [Journal ] Meena Mahajan , N. V. Vinodchandran A Note on Mod and Generalised Mod Classes. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:55, n:1, pp:27-31 [Journal ] N. V. Vinodchandran AMexp [nsube](NP[cap]coNP)/poly. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:89, n:1, pp:43-47 [Journal ] John M. Hitchcock , N. V. Vinodchandran Dimension, entropy rates, and compression. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2006, v:72, n:4, pp:760-782 [Journal ] N. V. Vinodchandran Counting Complexity of Solvable Black-Box Group Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:33, n:4, pp:852-869 [Journal ] Luis Antunes , Lance Fortnow , Dieter van Melkebeek , N. V. Vinodchandran Computational depth: Concept and applications. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:354, n:3, pp:391-404 [Journal ] Vikraman Arvind , N. V. Vinodchandran Exact learning via teaching assistants. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:241, n:1-2, pp:51-81 [Journal ] Vikraman Arvind , N. V. Vinodchandran The counting complexity of group-definable languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:242, n:1-2, pp:199-218 [Journal ] Vikraman Arvind , N. V. Vinodchandran Solvable Black-Box Group Problems are Low for PP. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:180, n:1-2, pp:17-45 [Journal ] Chris Bourke , John M. Hitchcock , N. V. Vinodchandran Entropy rates and finite-state dimension. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:349, n:3, pp:392-406 [Journal ] N. V. Vinodchandran A note on the circuit complexity of PP. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:347, n:1-2, pp:415-418 [Journal ] Chris Bourke , Raghunath Tewari , N. V. Vinodchandran Directed Planar Reachability is in Unambiguous Log-Space. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2007, pp:217-221 [Conf ] Aduri Pavan , Alan L. Selman , Samik Sengupta , N. V. Vinodchandran Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:385, n:1-3, pp:167-178 [Journal ] A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. [Citation Graph (, )][DBLP ] Kolmogorov Complexity in Randomness Extraction. [Citation Graph (, )][DBLP ] 2-Local Random Reductions to 3-Valued Functions. [Citation Graph (, )][DBLP ] On the Power of Unambiguity in Logspace [Citation Graph (, )][DBLP ] Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.306secs