Directed Planar Reachability is in Unambiguous Logspace.
Chris Bourke, Raghunath Tewari, and
N. V. Vinodchandran.
ACM Transactions on Computation Theory (to appear).
2-Local Random Reductions to 3-Valued Functions.
A. Pavan and N. V. Vinodchandran.
Computational Complexity (to appear).
Kernels for Generalized
Multiple-Instance Learning.
Qingping Tao,
Stephen Scott,
N. V. Vinodchandran, Thomas Takeo Osugi, and Brandon Mueller.
IEEE Transactions on Pattern Analysis and Machine
Intelligence 30(12), (2008), Pages 2084-2097.
On
Reoptimizing Multi-Class Classifiers.
Kun
Deng, Chris
Bourke, Robert
Schapire, Stephen Scott,
and N. V. Vinodchandran.
Machine Learning 71(2-3),
(2008), Pages 219-242.
Relations between Average-case and Worst-case Complexity.
A. Pavan and N. V. Vinodchandran.
Theory of Computing Systems 42(4), (2008), Pages 596-607.
Partial
Bi-immunity, Scaled Dimension, and NP-Completeness.
J. Hitchcock,
A. Pavan, and
N. V. Vinodchandran.
Theory of Computing Systems 42(2), (2008), Pages
131-142.
Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy.
A. Pavan,
A. Selman,
S. Sengupta, and N. V. Vinodchandran.
Theoretical Computer Science 385 (2007) pages 167-178.
Some
Results on Average-Case Hardness within the Polynomial Hierarchy.
A. Pavan, R. Santhanam, and N. V. Vinodchandran
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 06).
LNCS Vol: 4337, pages 188-199.
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws.
L. Fortnow,
J. Hitchcock,
A. Pavan, N. V. Vinodchandran, and F. Wang.
International Colloquium on
Automata, Languages and Programming (ICALP 06).
LNCS Vol: 3903, pages 335-245.
Computational Depth: Concept and Applications.
Luis Antunes, Lance Fortnow, Dieter van Melkebeek, and
N. V. Vinodchandran.
Theoretical Computer Science 354(3), (2006), Pages
391-404
Special issue devoted to the fourth International
Symposium on Fundamentals of Computation Theory.
Dimension, Entropy Rates, and Compression.
J. Hitchcock and N. V. Vinodchandran.
Journal of
Computer and System Sciences, 72(4) (2006) pages 760-782.
A Note on the Circuit Complexity
of PP.
N. V. Vinodchandran.
Theoretical Computer Science,
347, (2005) 415-418.
Entropy Rates and Finite-State Dimension.
Chris Bourke, John M. Hitchcock , and
N. V. Vinodchandran.
Theoretical Computer Science, 349 (2005), pages 392-406.
Nondeterministic Circuit Minimization Problem
and Derandomizing Arthur-Merlin Games.
N. V. Vinodchandran.
International Journal on Foundations of Computer Science
16(6) (2005), pages 1297-1308.
Derandomizing Arthur-Merlin games using
Hitting Sets.
Peter Bro Miltersen and
N. V. Vinodchandran.
Computational Complexity , 14 (2005), pages 256-279.
Learning DNFs and Circuits using Teaching
Assistants.
N. V. Vinodchandran.
Computing and Combinatorics
Conference, 2004 (COCOON 04).
LNCS Vol: 3106, pages 188-197.
Counting Complexity of
Solvable Black-box Group Problems.
N. V. Vinodchandran.
SIAM Journal on Computing, 33(4): 2004 pages 852-869.
AMexp not Contained in (NP\cap
CoNP)/Poly.
N. V. Vinodchandran.
Information Processing Letters. 89: 2004,
pages 43-47.
Query Complexity of Program
Checking by Constant-Depth Circuits.
V. Arvind, K. V. Subrahmanyam, and
N. V. Vinodchandran.
Chicago Journal of Theoretical Computer Science, (2002) Article 2.
Exact Learning via
Teaching Assistants.
V. Arvind and
N. V. Vinodchandran.
Theoretical Computer Science, 241 (2000), pages 51--81.
Special issue devoted to the Seventh International Workshop on
Algorithmic Learning Theory.
The Complexity of
Group-definable NP Languages.
V. Arvind and
N. V. Vinodchandran.
Theoretical Computer
Science, 242 (2000), pages 199--218.
Superpolynomial versus
Subexponential Circuit Size in the Exponential Hierarchy.
Peter Bro
Miltersen, N. V. Vinodchandran, and Osamu
Watanabe.
Computing and Combinatorics Conference 1999 (COCOON 99) ,
LNCS Vol: 1627, pages 210--220.
Counting Complexity
and Computational Group theory.
N. V. Vinodchandran.
PhD. Thesis, Institute of
Mathematical Sciences, Chennai, India. 1999.
Solvable Black-Box Group
Problems are Low for PP.
V. Arvind and
N. V. Vinodchandran.
Theoretical Computer Science, 180
(1997), pages 17-47