Skip Navigation

Computer Science and Engineering

Educating for the Computing Age

Faculty Vita Format Report  (2006 - 2009)



 
 

Variyam, Vinodchandran

  
 
 

Faculty and Research Interests:

  
 
  vinod
Title:  Associate Professor
Research Area:  Computational complexity theory, computational learning theory, computational group theory, randomized computations.
Contact Info:  vinod@cse.unl.edu
http://www.cse.unl.edu/~vinod
 
 
 

Journal Publications:

  
 
  Chris Bourke, Kun Deng, Stephen D. Scott, Robert Schapire, and N. V. Vinodchandran. "On reoptimizing multi-class classifiers." Machine Learning. 71.2 (2008): 219-242  <http://www.springerlink.com/content/plk5puh8767...>  
  Qingping Tao, Stephen Scott, N. V. Vinodchandran, Thomas Osugi and Brandon Mueller. "Kernels for Generalized Multiple-Instance Learning." IEEE Transactions on Pattern Analysis and Machine Intelligence. 30.12 (2008): 2084-2097  <http://ieeexplore.ieee.org/iel5/34/4359286/0442...>  
  R. K. Balachandran, X. Zou, B. Rmammurthy, A. Thukral & N. V. Vinodchandran. "An Efficient and Attack-resistant Key Agreement Scheme for Secure Group Communications in Mobile Ad-Hoc Networks." Wireless Communications in Mobile Ad-Hoc Networks. (2007).  
  J. M. Hitchcock, A. Pavan & N. V. Vinodchandran. "Partial Bi-immunity, Scaled Dimension, and NP-Completeness." Theory of Computing Systems. 42.2 (2008): 131-142  
  A. Pavan & N.V. Vinodchandran. "Relations between average-case and worst-case complexity." Theory of Computing Systems. 42.4 (2008): 596-607  <http://www.springerlink.com/content/phxqq3x8173...>  
  A. Pavan, S. Sengupta, A. Selman & N.V. Vinodchandran. "Polylogarithmic Round Interactive Proofs for coNP collapses the Exponential Hierarchy." Theoretical Computer Science. 385.1 (2007): 167-178  
  J.M. Hitchcock & N.V. Vinodchandran. "Dimension, Entropy rates, and Circuit Complexity." Journal of Computer and System Sciences. 72.4 (2006): 760-782  
  L. Antunes, L. Fortnow, D. Van Melkebeek & N.V. Vinodchandran. "Computational Depth: Concept and Applications." Theoretical Computer Science. 354.3 (2006): 391-404  
 
 

Papers in Conference Proceedings:

  
 
  C. Bourke, R. Tewari & N.V. Vinodchandran. "Directed Planar Reachability is in Unambiguous Logspace." IEEE Conference on Computational Complexity. (2007): 217-221  
  A. Pavan, R. Santhanam & N.V. Vinodchandran. "Some Results on Average-Case Hardness within the Polynomial Hierarchy." 26th International Conference on Foundations of Software Technology and Theoretical Computer Science. 4337 (2006): 188-199  
  Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, & Fengming Wang. "Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws." ICALP 2006. (2006): 335-345  
  Deng Kun, Christopher Bourke, Stephen Scott, Vinod Variyam. "New Algorithms for Optimizing Multi-Class Classifiers via ROC Surfaces." The Third Workshop on ROC Analysis in Machine Learning. (2006): 17-24  
  S. Despande, A. Todimala, R. K. Balachandran, B. Ramamurthy, X. Zou, & N. V. Vinodchandran. "A New Cryptographic Scheme for Secure Dynamic Conferencing for Data Networks." ICC 06. (2006).  
 
 

Technical Reports:

  
 
  Chris Bourke. A Note on the Karp-Lipton Collapse for the Exponential Hierarchy. 01/10/2007. Download:TR-UNL-CSE-2007-0004pdf  
  Kun Deng, Chris Bourke, Stephen D. Scott, Robert E. Schapire, and N. V. Vinodchandran. On Reoptimizing Multi-Class Classifiers. 12/12/2006. Download:TR-UNL-CSE-2006-0017pdf  
 
Cached Ver Nov 20th 2009