Prof. Vinodchandran Variyam is broadly interested in computer science topics where there is a fundamental computational efficiency concern. Concretely, his research spans multiple areas of core computer science topics including computational complexity theory, machine learning, and large data management. His contributions to complexity theory have played a significant role in advancing the state-of-the-art in several topics including de-randomization, circuit complexity, space-limited computations, and Kolmogorov complexity.
In addition to computational complexity, his current research themes also include reproducible computations, sample efficiency in distribution learning and testing, and algorithms for streaming data and their applications. Prof. Vinodchandran Variyam is currently a professor at the University of Nebraska-Lincoln.