The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

N. V. Vinodchandran: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Vikraman Arvind, N. V. Vinodchandran
    Exact Learning via Teaching Assistants (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:291-306 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. N. V. Vinodchandran
    Learning DNFs and Circuits Using Teaching Assistants. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:188-197 [Conf]
  8. 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]
  9. Aduri Pavan, N. V. Vinodchandran
    Relations Between Average-Case and Worst-Case Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:422-432 [Conf]
  10. Peter Bro Miltersen, N. V. Vinodchandran
    Derandomizing Arthur-Merlin Games Using Hitting Sets. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:71-80 [Conf]
  11. 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]
  12. N. V. Vinodchandran
    Improved Lowness Results for Solvable Black-box Group Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:220-234 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]

  38. A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. [Citation Graph (, )][DBLP]


  39. Kolmogorov Complexity in Randomness Extraction. [Citation Graph (, )][DBLP]


  40. 2-Local Random Reductions to 3-Valued Functions. [Citation Graph (, )][DBLP]


  41. On the Power of Unambiguity in Logspace [Citation Graph (, )][DBLP]


  42. Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs [Citation Graph (, )][DBLP]


Search in 0.326secs, Finished in 0.328secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002