Pavan Aduri

Pavan Aduri

Iowa State University

H-index: 18

North America-United States

About Pavan Aduri

Pavan Aduri, With an exceptional h-index of 18 and a recent h-index of 10 (since 2020), a distinguished researcher at Iowa State University, specializes in the field of Computational Complexity, Algorithms.

His recent articles reflect a diverse array of research interests and contributions to the field:

List and certificate complexities in replicable learning

Maximizing submodular functions under submodular constraints

Constraint optimization over semirings

Total Variation Distance Estimation Is as Easy as Probabilistic Inference

Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube

Model Counting Meets Distinct Elements

Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma

Model Counting Meets F0 Estimation

Pavan Aduri Information

University

Position

___

Citations(all)

1131

Citations(since 2020)

409

Cited By

975

hIndex(all)

18

hIndex(since 2020)

10

i10Index(all)

32

i10Index(since 2020)

11

Email

University Profile Page

Iowa State University

Google Scholar

View Google Scholar Profile

Pavan Aduri Skills & Research Interests

Computational Complexity

Algorithms

Top articles of Pavan Aduri

Title

Journal

Author(s)

Publication Date

List and certificate complexities in replicable learning

Advances in Neural Information Processing Systems

Peter Dixon

A Pavan

Jason Vander Woude

NV Vinodchandran

2024/2/13

Maximizing submodular functions under submodular constraints

Madhavan R Padmanabhan

Yanhui Zhu

Samik Basu

A Pavan

2023/7/2

Constraint optimization over semirings

Proceedings of the AAAI Conference on Artificial Intelligence

Aduri Pavan

Kuldeep S Meel

NV Vinodchandran

Arnab Bhattacharyya

2023/6/26

Total Variation Distance Estimation Is as Easy as Probabilistic Inference

arXiv preprint arXiv:2309.09134

Arnab Bhattacharyya

Sutanu Gayen

Kuldeep S Meel

Dimitrios Myrisiotis

A Pavan

...

2023/9/17

Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube

arXiv preprint arXiv:2306.12593

Jason Vander Woude

Peter Dixon

A Pavan

Jamie Radcliffe

NV Vinodchandran

2023/6/21

Model Counting Meets Distinct Elements

Communications of the ACM

A Pavan

NV Vinodchandran

Arnab Bhattacharyya

Kuldeep S Meel

2023/8/23

Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma

arXiv preprint arXiv:2304.04837

Jason Vander Woude

Peter Dixon

A Pavan

Jamie Radcliffe

NV Vinodchandran

2023/4/10

Model Counting Meets F0 Estimation

Aduri Pavan

NV Vinodchandran

Arnab Bhattacharya

Kuldeep S Meel

2021/6/20

Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations

Michael Chen

A Pavan

NV Vinodchandran

2023

Size-constrained k-submodular maximization in near-linear time

Guanyu Nie

Yanhui Zhu

Yididiya Y Nadew

Samik Basu

A Pavan

...

2023/7/2

On approximating total variation distance

arXiv preprint arXiv:2206.07209

Arnab Bhattacharyya

Sutanu Gayen

Kuldeep S Meel

Dimitrios Myrisiotis

Aduri Pavan

...

2022/6/14

Pseudodeterminism: promises and lowerbounds

Peter Dixon

Aduri Pavan

Jason Vander Woude

NV Vinodchandran

2022/6/9

Model Counting Meets Distinct Elements in a Data Stream

ACM SIGMOD Record

A Pavan

NV Vinodchandran

Arnab Bhattacharyya

Kuldeep S Meel

2022/6/1

Geometry of Rounding

arXiv preprint arXiv:2211.02694

Jason Vander Woude

Peter Dixon

A Pavan

Jamie Radcliffe

NV Vinodchandran

2022/11/4

Measuring the impact of influence on individuals: Roadmap to quantifying attitude

Social Network Analysis and Mining

Xiaoyun Fu

Madhavan Padmanabhan

Raj Gaurav Kumar

Samik Basu

Shawn Dorius

...

2021/12

The magazine archive includes every article published in Communications of the ACM for over the past 50 years.

Communications of the ACM

Gary Lewandowski

Dennis J Bouvier

Tzu-Yi Chen

Robert McCartney

Kate Sanders

...

2010/7

Promise problems meet pseudodeterminism

arXiv preprint arXiv:2103.08589

Peter Dixon

Aduri Pavan

NV Vinodchandran

2021/3/15

Complete problems for multi-pseudodeterministic computations

Innovations in Theoretical Computer Science

Peter Dixon

Aduri Pavan

NV Vinodchandran

2021/1

Multi-objective submodular optimization with approximate oracles and influence maximization

Xiaoyun Fu

Rishabh Rajendra Bhatt

Samik Basu

Aduri Pavan

2021/12/15

Perfect zero knowledge: New upperbounds and relativized separations

Peter Dixon

Sutanu Gayen

Aduri Pavan

NV Vinodchandran

2020/11/16

See List of Professors in Pavan Aduri University(Iowa State University)