Trust in e-commerce AF Salam, L Iyer, P Palvia, R Singh Communications of the ACM 48 (2), 72-77, 2005 | 448 | 2005 |
Derandomizing Arthur-Merlin games using hitting sets PB Miltersen, NV Vinodchandran 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999 | 154* | 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 | 115 | 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 | 79 | 2009 |
Computational depth: concept and applications L Antunes, L Fortnow, D Van Melkebeek, NV Vinodchandran Theoretical Computer Science 354 (3), 391-404, 2006 | 73 | 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 | 63 | 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 | 60 | 2005 |
Entropy rates and finite-state dimension C Bourke, JM Hitchcock, NV Vinodchandran Theoretical Computer Science 349 (3), 392-406, 2005 | 51 | 2005 |
A note on the circuit complexity of PP NV Vinodchandran Theoretical Computer Science 347 (1), 415-418, 2005 | 40 | 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 | 39 | 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 | 32 | 2013 |
Greenʼs theorem and isolation in planar graphs R Tewari, NV Vinodchandran Information and Computation 215, 1-7, 2012 | 32 | 2012 |
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 | 31 | 2017 |
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 | 30 | 2021 |
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 | 29 | 2014 |
Dimension, entropy rates, and compression JM Hitchcock, NV Vinodchandran Journal of Computer and System Sciences 72 (4), 760-782, 2006 | 26 | 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 | 25 | 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 | 23 | 2004 |
Kolmogorov complexity in randomness extraction JM Hitchcock, A Pavan, NV Vinodchandran ACM Transactions on Computation Theory (TOCT) 3 (1), 1-12, 2011 | 22 | 2011 |
On reoptimizing multi-class classifiers C Bourke, K Deng, SD Scott, RE Schapire, NV Vinodchandran Machine Learning 71 (2), 219-242, 2008 | 22 | 2008 |