Vinodchandran Variyam
Vinodchandran Variyam
Other namesN. V. Vinodchandran
Professor, Computer Science and Engineering, University of Nebraska-Lincoln
Verified email at - Homepage
Cited by
Cited by
Derandomizing Arthur-Merlin games using hitting sets
PB Miltersen, NV Vinodchandran
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
SVM-based generalized multiple-instance learning via approximate box counting
Q Tao, S Scott, NV Vinodchandran, TT Osugi
Proceedings of the twenty-first international conference on Machine learning …, 2004
Directed planar reachability is in unambiguous log-space
C Bourke, R Tewari, NV Vinodchandran
ACM Transactions on Computation Theory (TOCT) 1 (1), 1-17, 2009
Computational depth: concept and applications
L Antunes, L Fortnow, D Van Melkebeek, NV Vinodchandran
Theoretical Computer Science 354 (3), 391-404, 2006
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
PB Miltersen, NV Vinodchandran, O Watanabe
International Computing and Combinatorics Conference, 210-220, 1999
CRTDH: an efficient key agreement scheme for secure group communications in wireless ad hoc networks
RK Balachandran, B Ramamurthy, X Zou, NV Vinodchandran
IEEE International Conference on Communications, 2005. ICC 2005. 2005 2 …, 2005
Entropy rates and finite-state dimension
C Bourke, JM Hitchcock, NV Vinodchandran
Theoretical Computer Science 349 (3), 392-406, 2005
A note on the circuit complexity of PP
NV Vinodchandran
Theoretical Computer Science 347 (1), 415-418, 2005
Extracting Kolmogorov complexity with applications to dimension zero-one laws
L Fortnow, JM Hitchcock, A Pavan, NV Vinodchandran, F Wang
Automata, Languages and Programming: 33rd International Colloquium, ICALP …, 2006
An O (n˝+?)-Space and Polynomial-Time Algorithm for Directed Planar Reachability
T Imai, K Nakagawa, A Pavan, NV Vinodchandran, O Watanabe
2013 IEEE Conference on Computational Complexity, 277-286, 2013
Fractal features for automatic detection of dysarthria
T Spangler, NV Vinodchandran, A Samal, JR Green
2017 IEEE EMBS International Conference on Biomedical & Health Informatics …, 2017
Greenʼs theorem and isolation in planar graphs
R Tewari, NV Vinodchandran
Information and Computation 215, 1-7, 2012
New time-space upperbounds for directed reachability in high-genus and h-minor-free graphs
D Chakraborty, A Pavan, R Tewari, NV Vinodchandran, LF Yang
34th International Conference on Foundation of Software Technology and …, 2014
Near-optimal learning of tree-structured distributions by Chow-Liu
A Bhattacharyya, S Gayen, E Price, NV Vinodchandran
Proceedings of the 53rd annual acm SIGACT symposium on theory of computing …, 2021
Dimension, entropy rates, and compression
JM Hitchcock, NV Vinodchandran
Journal of Computer and System Sciences 72 (4), 760-782, 2006
Space complexity of perfect matching in bounded genus bipartite graphs
S Datta, R Kulkarni, R Tewari, NV Vinodchandran
Journal of Computer and System Sciences 78 (3), 765-779, 2012
An extended kernel for generalized multiple-instance learning
Q Tao, S Scott, NV Vinodchandran, TT Osugi, B Mueller
16th IEEE International Conference on Tools with Artificial Intelligence …, 2004
Kolmogorov complexity in randomness extraction
JM Hitchcock, A Pavan, NV Vinodchandran
ACM Transactions on Computation Theory (TOCT) 3 (1), 1-12, 2011
On reoptimizing multi-class classifiers
C Bourke, K Deng, SD Scott, RE Schapire, NV Vinodchandran
Machine Learning 71 (2), 219-242, 2008
Solvable black-box group problems are low for PP
V Arvind, NV Vinodchandran
Theoretical Computer Science 180 (1-2), 17-45, 1997
The system can't perform the operation now. Try again later.
Articles 1–20