5851_aduri_pavan.jpg

Pavan Aduri

Computational Complexity Theory Algorithmic Replicability Data Stream Models Resource-Bounded Computation
Iowa State University Department of Computer Science

About

Pavan Aduri is a Professor and the current Interim Chair of the Department of Computer Science at Iowa State University, a role he began in July 2024. He also serves as the Chair of the Graduate Admissions & Recruitment Committee. Dr. Aduri earned his Ph.D. from the University at Buffalo in 2001 and joined the Iowa State faculty that same year. An ACM Distinguished Member, his research focuses on computational complexity theory and algorithms, specifically exploring the use of resources like time, memory, and randomness to solve complex tasks. His work in algorithmic replicability and data stream models has been recognized with significant funding from the National Science Foundation and features in flagship publications like Communications of the ACM.

Research Performance Summary

117
Total Papers
1400
Total Citations
21
H-Index
1996-2025
Active Research Span

First Recorded Paper

Complete distributional problem, hard instance problems, hard languages, and resourcebound measure

Year: 1996

Citations: 1

Venue: Manuscript, Department of Computer Science

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
5
2024
8
2023
13
2022
5
2021
6
2020
2
2019
1
2018
3
2016
5
2015
3
2014
4

Publication Venues and Collaboration

Journal, Conference, and Book Publication Breakdown

Conference 41
Journal 13
Book 1

Top Coauthors

Pavan Vinodchandran Selman

Research Impact by Period

2025-2026

Period Stats
Papers 5
Citations 3
Avg. Citations / Paper 0.6
H-Index 1

2020-2024

Period Stats
Papers 34
Citations 202
Avg. Citations / Paper 5.9
H-Index 8

2015-2019

Period Stats
Papers 12
Citations 115
Avg. Citations / Paper 9.6
H-Index 5

2010-2014

Period Stats
Papers 17
Citations 489
Avg. Citations / Paper 28.8
H-Index 10

2005-2009

Period Stats
Papers 24
Citations 345
Avg. Citations / Paper 14.4
H-Index 11

2000-2004

Period Stats
Papers 17
Citations 146
Avg. Citations / Paper 8.6
H-Index 8

1995-1999

Period Stats
Papers 8
Citations 100
Avg. Citations / Paper 12.5
H-Index 2

Contact and Professional Links

Contact Information

pavan@iastate.edu

Detected Research Keywords

Total Variation Distance Np Complete Sets Hardness Hypotheses Derandomization Distributionally Hard Languages Space Polynomial Time Hypotheses Derandomization Circuit Derandomization Circuit Complexity Average Case Worst Case Worst Case Problems Hard Languages