| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Raghunath Tewari, N. V. Vinodchandran |
Green's theorem and isolation in planar graphs.  |
Inf. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran |
Space complexity of perfect matching in bounded genus bipartite graphs. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran |
ReachFewL = ReachUL. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang |
Extracting Kolmogorov complexity with applications to dimension zero-one laws. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran |
ReachFewL = ReachUL. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran |
Kolmogorov Complexity in Randomness Extraction. |
TOCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raghunath Tewari, N. V. Vinodchandran |
Green's Theorem and Isolation in Planar Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Derrick Stolee, N. V. Vinodchandran |
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran |
On the Power of Unambiguity in Logspace. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ricard Gavaldà, María López-Valdés, Elvira Mayordomo, N. V. Vinodchandran |
Resource-bounded Dimension in Computational Learning Theory |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran |
On the Power of Unambiguity in Logspace |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Derrick Stolee, Chris Bourke, N. V. Vinodchandran |
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
acyclic digraph, logspace algorithm, planar graph, reachability |
| 1 | Chris Bourke, Raghunath Tewari, N. V. Vinodchandran |
Directed Planar Reachability Is in Unambiguous Log-Space. |
TOCT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran |
Kolmogorov Complexity in Randomness Extraction. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Derrick Stolee, Chris Bourke, N. V. Vinodchandran |
A log-space algorithm for reachability in planar DAGs with few sources. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran |
Kolmogorov Complexity in Randomness Extraction. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Bourke, Kun Deng, Stephen D. Scott, Robert E. Schapire, N. V. Vinodchandran |
On reoptimizing multi-class classifiers. |
Machine Learning |
2008 |
DBLP DOI BibTeX RDF |
Receiver Operator Characteristic (ROC), Classifier reoptimization, Multi-class classification |
| 1 | Aduri Pavan, N. V. Vinodchandran |
2-Local Random Reductions to 3-Valued Functions. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15 |
| 1 | John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran |
Partial Bi-immunity, Scaled Dimension, and NP-Completeness. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Many-one completeness, Bi-immunity, Scaled dimension, Turing completeness |
| 1 | Aduri Pavan, N. V. Vinodchandran |
Relations between Average-Case and Worst-Case Complexity. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Average-case complexity, Arthur-Merlin games, Worst-case complexity |
| 1 | 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. |
Wireless Communications and Mobile Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran |
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Bourke, Raghunath Tewari, N. V. Vinodchandran |
Directed Planar Reachability is in Unambiguous Log-Space. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Antunes 0002, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran |
Computational depth: Concept and applications. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, N. V. Vinodchandran |
Dimension, entropy rates, and compression. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang |
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran |
Some Results on Average-Case Hardness Within the Polynomial Hierarchy. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang |
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, N. V. Vinodchandran |
2-Local Random Reductions to 3-Valued Functions |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | N. V. Vinodchandran |
A note on the circuit complexity of PP. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Bourke, John M. Hitchcock, N. V. Vinodchandran |
Entropy rates and finite-state dimension. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bro Miltersen, N. V. Vinodchandran |
Derandomizing Arthur-Merlin Games using Hitting Sets. |
Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15 |
| 1 | Ajay Kumar Todimala, Byrav Ramamurthy, N. V. Vinodchandran |
On computing disjoint paths with dependent cost structure in optical networks. |
BROADNETS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, N. V. Vinodchandran |
Relations Between Average-Case and Worst-Case Complexity. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | N. Variyam Vinodchandran |
Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | N. V. Vinodchandran |
AMexp[nsube](NP[cap]coNP)/poly. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | N. V. Vinodchandran |
A note on the circuit complexity of PP |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, N. V. Vinodchandran |
Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | N. V. Vinodchandran |
Counting Complexity of Solvable Black-Box Group Problems. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Qingping Tao, Stephen D. Scott, N. V. Vinodchandran, Thomas Takeo Osugi |
SVM-based generalized multiple-instance learning via approximate box counting. |
ICML |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Qingping Tao, Stephen D. Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller |
An Extended Kernel for Generalized Multiple-Instance Learning. |
ICTAI |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | N. V. Vinodchandran |
Learning DNFs and Circuits Using Teaching Assistants. |
COCOON |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran |
Partial Bi-immunity and NP-Completeness. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, N. V. Vinodchandran |
Dimension, Entropy Rates, and Compression. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Antunes 0002, Lance Fortnow, N. V. Vinodchandran |
Using Depth to Capture Average-Case Complexity. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran |
The Query Complexity of Program Checking by Constant-Depth Circuits. |
Chicago J. Theor. Comput. Sci. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, N. V. Vinodchandran |
Exact learning via teaching assistants. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, N. V. Vinodchandran |
The counting complexity of group-definable languages. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe |
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bro Miltersen, N. V. Vinodchandran |
Derandomizing Arthur-Merlin Games Using Hitting Sets. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
derandomization, hitting sets, Arthur-Merlin games |
| 1 | Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran |
The Query Complexity of Program Checking by Constant-Depth Circuits. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran |
The Query Complexity of Program Checking by Constant-Depth Circuits |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, N. V. Vinodchandran |
Solvable Black-Box Group Problems are Low for PP. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, N. V. Vinodchandran |
Exact Learning via Teaching Assistants (Extended Abstract). |
ALT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | N. V. Vinodchandran |
Improved Lowness Results for Solvable Black-box Group Problems. |
FSTTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, N. V. Vinodchandran |
Solvable Black-Box Group Problems Are Low for PP. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, N. V. Vinodchandran |
The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). |
ALT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, N. V. Vinodchandran |
A Note on Mod and Generalised Mod Classes. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran |
A Note on SpanP Functions. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")