☰

N V. Vinodchandran - Publications

Affiliations: 
Mathematics The University of Nebraska - Lincoln, Lincoln, NE 
Area:
Mathematics, Computer Science
Tree Info Similar researchers PubMed Report error

24/49 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Braverman V, Liu Z, Singh T, Vinodchandran NV, Yang LF. New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory Algorithmica. 80: 652-667. DOI: 10.1007/S00453-017-0277-5  0.387
2015 Braverman V, Liu Z, Singh T, Vinodchandran NV, Yang LF. New bounds for the CLIQUE-GAP problem using graph decomposition theory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9235: 151-162. DOI: 10.1007/978-3-662-48054-0_13  0.322
2014 Chakraborty D, Pavan A, Tewari R, Vinodchandran NV, Yang LF. New time-space upperbounds for directed reachability in high-genus and H-minor-free graphs Leibniz International Proceedings in Informatics, Lipics. 29: 585-595. DOI: 10.4230/LIPIcs.FSTTCS.2014.585  0.329
2014 Garvin B, Stolee D, Tewari R, Vinodchandran NV. ReachFewL = ReachUL Computational Complexity. 23: 85-98. DOI: 10.1007/S00037-012-0050-8  0.424
2013 Imai T, Nakagawa K, Pavan A, Vinodchandran NV, Watanabe O. An O(n1/2+Σ)-space and polynomial-time algorithm for directed planar reachability Proceedings of the Annual Ieee Conference On Computational Complexity. 277-286. DOI: 10.1109/CCC.2013.35  0.3
2012 Datta S, Kulkarni R, Tewari R, Vinodchandran NV. Space complexity of perfect matching in bounded genus bipartite graphs Journal of Computer and System Sciences. 78: 765-779. DOI: 10.1016/J.Jcss.2011.11.002  0.463
2012 Tewari R, Vinodchandran NV. Greens theorem and isolation in planar graphs Information and Computation. 215: 1-7. DOI: 10.1016/J.Ic.2012.03.002  0.382
2012 Pavan A, Tewari R, Vinodchandran NV. On the power of unambiguity in log-space Computational Complexity. 21: 643-670. DOI: 10.1007/S00037-012-0047-3  0.449
2011 Datta S, Kulkarni R, Tewari R, Vinodchandran NV. Space complexity of perfect matching in bounded genus bipartite graphs Leibniz International Proceedings in Informatics, Lipics. 9: 579-590. DOI: 10.4230/LIPIcs.STACS.2011.579  0.406
2011 Fortnow L, Hitchcock JM, Pavan A, Vinodchandran NV, Wang F. Extracting Kolmogorov complexity with applications to dimension zero-one laws Information and Computation. 209: 627-636. DOI: 10.1016/J.Ic.2010.09.006  0.346
2009 Bourke C, Tewari R, Vinodchandran NV. Directed planar reachability is in unambiguous log-space Acm Transactions On Computation Theory. 1. DOI: 10.1145/1490270.1490274  0.443
2008 Tao Q, Scott SD, Vinodchandran NV, Osugi TT, Mueller B. Kernels for generalized multiple-instance learning. Ieee Transactions On Pattern Analysis and Machine Intelligence. 30: 2084-98. PMID 18988944 DOI: 10.1109/Tpami.2007.70846  0.358
2008 Bourke C, Deng K, Scott SD, Schapire RE, Vinodchandran NV. On reoptimizing multi-class classifiers Machine Learning. 71: 219-242. DOI: 10.1007/S10994-008-5056-8  0.333
2008 Pavan A, Vinodchandran NV. Relations between average-case and worst-case complexity Theory of Computing Systems. 42: 596-607. DOI: 10.1007/S00224-007-9071-0  0.371
2008 Hitchcock JM, Pavan A, Vinodchandran NV. Partial Bi-immunity, scaled dimension, and NP-completeness Theory of Computing Systems. 42: 131-142. DOI: 10.1007/S00224-007-9000-2  0.322
2006 Antunes L, Fortnow L, Van Melkebeek D, Vinodchandran NV. Computational depth: Concept and applications Theoretical Computer Science. 354: 391-404. DOI: 10.1016/J.Tcs.2005.11.033  0.339
2006 Hitchcock JM, Vinodchandran NV. Dimension, entropy rates, and compression Journal of Computer and System Sciences. 72: 760-782. DOI: 10.1016/J.Jcss.2005.10.002  0.432
2005 Vinodchandran NV. Nondeterministic circuit minimization problem and derandomizing arthur-merlin games International Journal of Foundations of Computer Science. 16: 1297-1308. DOI: 10.1142/S0129054105003819  0.423
2005 Bourke C, Hitchcock JM, Vinodchandran NV. Entropy rates and finite-state dimension Theoretical Computer Science. 349: 392-406. DOI: 10.1016/J.Tcs.2005.09.040  0.322
2005 Vinodchandran NV. A note on the circuit complexity of PP Theoretical Computer Science. 347: 415-418. DOI: 10.1016/J.Tcs.2005.07.032  0.318
2004 Vinodchandran NV. Counting complexity of solvable black-box group problems Siam Journal On Computing. 33: 852-869. DOI: 10.1137/S0097539703420651  0.444
2000 Arvind V, Vinodchandran NV. The counting complexity of group-definable languages Theoretical Computer Science. 242: 199-218. DOI: 10.1016/S0304-3975(98)00218-7  0.381
1999 Miltersen PB, Vinodchandran NV. Derandomizing Arthur-Merlin games using hitting sets Annual Symposium On Foundations of Computer Science - Proceedings. 71-80. DOI: 10.1007/S00037-005-0197-7  0.342
1997 Vinodchandran NV. Improved lowness results for solvable black-box group problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1346: 220-234.  0.393
Low-probability matches (unlikely to be authored by this person)
2015 Vinodchandran NV, Zimand M. On Optimal Language Compression for Sets in PSPACE/poly Theory of Computing Systems. 56: 581-590. DOI: 10.1007/S00224-014-9535-Y  0.299
1999 Arvind V, Subrahmanyam KV, Vinodchandran NV. The query complexity of program checking by constant-depth circuits Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1741: 123-132. DOI: 10.1007/3-540-46632-0_13  0.29
2011 Hitchcock JM, Pavan A, Vinodchandran NV. Kolmogorov complexity in randomness extraction Acm Transactions On Computation Theory. 3. DOI: 10.1145/2003685.2003686  0.287
2008 Pavan A, Vinodchandran NV. 2-local random reductions to 3-valued functions Computational Complexity. 17: 501-514. DOI: 10.1007/S00037-008-0245-1  0.284
1996 Arvind V, Vinodchandran NV. The complexity of exactly learning algebraic concepts: (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1160: 100-112.  0.277
2012 Stolee D, Vinodchandran NV. Space-efficient algorithms for reachability in surface-embedded graphs Proceedings of the Annual Ieee Conference On Computational Complexity. 326-333. DOI: 10.1109/CCC.2012.15  0.271
1996 Arvind V, Vinodchandran NV. Solvable black-box group problems are low for PP Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1046: 99-110. DOI: 10.1016/S0304-3975(96)00100-4  0.266
2004 Vinodchandran NV. AMexp⊈(NP∩coNP)/poly Information Processing Letters. 89: 43-47. DOI: 10.1016/j.ipl.2003.09.011  0.232
2004 Vinodchandran NV. Learning DNFs and circuits using teaching assistants Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3106: 188-197.  0.222
2004 Hitchcock JM, Pavan A, Vinodchandran NV. Partial bi-immunity and NP-completeness Proceedings of the Annual Ieee Conference On Computational Complexity. 19: 198-203.  0.209
2015 Mandal D, Pavan A, Vinodchandran NV. On probabilistic space-bounded machines with multiple access to random tape Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9235: 459-471. DOI: 10.1007/978-3-662-48054-0_38  0.208
1997 Arvind V, Vinodchandran NV. Exact learning via teaching assistants Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1316: 291-306. DOI: 10.1007/3-540-63577-7_50  0.205
1999 Miltersen PB, Vinodchandran NV, Watanabe O. Super-polynomial versus half-exponential circuit size in the exponential hierarchy Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1627: 210-220. DOI: 10.1007/3-540-48686-0_21  0.184
2005 Todimala A, Ramamurthy B, Vinodchandran NV. On computing disjoint paths with dependent cost structure in optical networks 2nd International Conference On Broadband Networks, Broadnets 2005. 2005: 155-164. DOI: 10.1109/ICBN.2005.1589610  0.184
1995 Mahajan M, Vinodchandran NV. A note on Mod and generalised Mod classes Information Processing Letters. 55: 27-31. DOI: 10.1016/0020-0190(95)00026-9  0.176
2016 Gayen S, Vinodchandran NV. Algorithms for k-median clustering over distributed streams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9797: 535-546. DOI: 10.1007/978-3-319-42634-1_43  0.144
2010 Stolee D, Bourke C, Vinodchandran NV. A log-space algorithm for reachability in planar acyclic digraphs with few sources Proceedings of the Annual Ieee Conference On Computational Complexity. 131-138. DOI: 10.1109/CCC.2010.36  0.143
2005 Hao G, Vinodchandran NV, Ramamurthy B, Zou X. A balanced key tree approach for dynamic secure group communication Proceedings - International Conference On Computer Communications and Networks, Icccn. 2005: 345-350. DOI: 10.1109/ICCCN.2005.1523882  0.139
2003 Antunes L, Fortnow L, Vinodchandran NV. Using depth to capture average-case complexity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2751: 303-310.  0.121
2004 Tao Q, Scott S, Vinodchandran NV, Osugi TT. SVM-based generalized multiple-instance learning via approximate box counting Proceedings, Twenty-First International Conference On Machine Learning, Icml 2004. 799-806.  0.111
2006 Deshpande S, Todimala A, Balachandran RK, Ramamurthy B, Zou X, Vinodchandran NV. A new cryptographic scheme for securing dynamic conferences in data networks Ieee International Conference On Communications. 5: 2310-2315. DOI: 10.1109/ICC.2006.255114  0.107
2004 Tao Q, Scott S, Vinodchandran NV, Osugi TT, Mueller B. An extended kernel for generalized multiple-instance learning Proceedings - International Conference On Tools With Artificial Intelligence, Ictai. 272-277.  0.103
2005 Balachandran RK, Ramamurthy B, Zou X, Vinodchandran NV. CRTDH: An efficient key agreement scheme for secure group communications in wireless ad hoc networks Ieee International Conference On Communications. 2: 1123-1127.  0.081
2003 Zou X, Ramamurthy B, Vinodchandran NV, Balachandran RK. Algorithms for unified hierarchy based access control Proceedings of the Second Iasted International Conference On Communications, Internet, and Information Technology. 31-36.  0.08
1994 Mahajan M, Thierauf T, Vinodchandran NV. A note on SpanP functions Information Processing Letters. 51: 7-10. DOI: 10.1016/0020-0190(94)00068-9  0.067
Hide low-probability matches.