5903_210512_variyam_007.jpg

Vinodchandran Variyam

Computational Complexity Theory Resource-Bounded Computation Algorithm Design Mathematical Modeling In Machine Learning Data Analytics For Complex Datasets
University of Nebraska-Lincoln School of Computing

About

Professor Vinodchandran Variyam is a prominent faculty member at the University of Nebraska–Lincoln, where he serves as a Professor and the Software Development Tribe Lead within the School of Computing. His work is primarily centered on the foundational aspects of computer science, with a deep specialization in computational complexity theory. He investigates the inherent limitations and capabilities of computers, focusing on how resource constraints—such as time, memory, and randomness—impact problem-solving. Beyond pure theory, his expertise extends to algorithm design, machine learning, and data analytics, where he applies rigorous mathematical modeling to improve how systems process and learn from complex datasets. As a leader in the department, he oversees the strategic direction of software development education and research, mentoring students at the intersection of theoretical foundations and practical software engineering.

Research Performance Summary

128
Total Papers
1735
Total Citations
21
H-Index
1994-2025
Active Research Span

First Recorded Paper

A note on SpanP functions

Year: 1994

Citations: 4

Venue: Inf. Process. Lett. 51 (1)

Latest Recorded Paper

Total variation distance for product distributions is# P-complete

Year: 2025

Citations: 0

Venue: Information Processing Letters 189

Last 10 Years Publication Activity

This timeline shows the professor's yearly publication activity.

2025
6
2024
10
2023
12
2022
8
2021
7
2020
5
2019
2
2018
5
2017
1
2016
6
2015
2

Publication Venues and Collaboration

Journal, Conference, and Book Publication Breakdown

Conference 51
Journal 12
Book 1

Top Coauthors

Vinodchandran Pavan Bhattacharyya

Research Impact by Period

2025-2026

Period Stats
Papers 6
Citations 3
Avg. Citations / Paper 0.5
H-Index 1

2020-2024

Period Stats
Papers 42
Citations 336
Avg. Citations / Paper 8
H-Index 10

2015-2019

Period Stats
Papers 16
Citations 105
Avg. Citations / Paper 6.6
H-Index 4

2010-2014

Period Stats
Papers 14
Citations 237
Avg. Citations / Paper 16.9
H-Index 10

2005-2009

Period Stats
Papers 25
Citations 742
Avg. Citations / Paper 29.7
H-Index 13

2000-2004

Period Stats
Papers 14
Citations 190
Avg. Citations / Paper 13.6
H-Index 6

1995-1999

Period Stats
Papers 10
Citations 118
Avg. Citations / Paper 11.8
H-Index 4

1990-1994

Period Stats
Papers 1
Citations 4
Avg. Citations / Paper 4
H-Index 1

Contact and Professional Links

Contact Information

vinod@unl.edu
4024725002

Detected Research Keywords

Total Variation Distance Solvable Black Box Black Box Group Box Group Problems Arthur Merlin Games Generalized Multiple Instance Multiple Instance Learning Directed Planar Reachability Key Agreement Scheme Agreement Scheme Secure