On the Hardness of Permanent. - Jin-yi Cai; Aduri Pavan; D. Sivakumar (STACS, 1999)

Reductions Do Not Preserve Fast Convergence Rates in Average Time. - Jay Belanger; Aduri Pavan; Jie Wang 002 (Algorithmica, 1999)

Complete distributional problems, hard languages, and resource-bounded measure. - Aduri Pavan; Alan L. Selman (Theor. Comput. Sci., 2000)

Distributionally Hard Languages. - Lance Fortnow; Aduri Pavan; Alan L. Selman (Theory Comput. Syst., 2001)

Separation of NP-Completeness Notions. - Aduri Pavan; Alan L. Selman (SIAM J. Comput., 2001)

Bi-Immunity Separates Strong NP-Completeness Notions - Aduri Pavan; Alan L. Selman (Electron. Colloquium Comput. Complex., 2002)

Proving SAT does not have Small Circuits with an Application to the Two. - Lance Fortnow; Aduri Pavan; Samik Sengupta (CCC, 2003)

Partial Bi-immunity and NP-Completeness. - John M. Hitchcock; Aduri Pavan; N. V. Vinodchandran (CCC, 2004)

Partial Bi-Immunity and NP-Completeness - John M. Hitchcock; Aduri Pavan; Pramodchandran N. Variyam (Electron. Colloquium Comput. Complex., 2004)

Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility - Aduri Pavan; N. V. Vinodchandran (Electron. Colloquium Comput. Complex., 2004)

On Higher Arthur-Merlin Classes. - Jin-yi Cai; Denis Charles; Aduri Pavan; Samik Sengupta (Int. J. Found. Comput. Sci., 2004)

Range Efficient Computation of F0 over Massive Data Streams. - Aduri Pavan; Srikanta Tirthapura (ICDE, 2005)

Redundancy in Complete Sets - Christian Glaßer; Aduri Pavan; Alan L. Selman; Liyu Zhang 001 (Electron. Colloquium Comput. Complex., 2005)

Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws - Lance Fortnow; John M. Hitchcock; Aduri Pavan; N. V. Vinodchandran; Fengming Wang (Electron. Colloquium Comput. Complex., 2005)

Resource-bounded strong dimension versus resource-bounded category. - John M. Hitchcock; Aduri Pavan (Inf. Process. Lett., 2005)

Some Results on Derandomization. - Harry Buhrman; Lance Fortnow; Aduri Pavan (Theory Comput. Syst., 2005)

Some Results on Average-Case Hardness Within the Polynomial Hierarchy. - Aduri Pavan; Rahul Santhanam; N. V. Vinodchandran (FSTTCS, 2006)

Mitosis in Computational Complexity. - Christian Glaßer; Aduri Pavan; Alan L. Selman; Liyu Zhang 001 (TAMC, 2006)

Comparing Reductions to NP-Complete Sets. - John M. Hitchcock; Aduri Pavan (Electron. Colloquium Comput. Complex., 2006)

Properties of NP-Complete Sets. - Christian Glaßer; Aduri Pavan; Alan L. Selman; Samik Sengupta (SIAM J. Comput., 2006)

Robustness of PSPACE-complete sets. - Aduri Pavan; Fengming Wang (Inf. Process. Lett., 2007)

Autoreducibility, mitoticity, and immunity. - Christian Glaßer; Mitsunori Ogihara; Aduri Pavan; Alan L. Selman; Liyu Zhang 001 (J. Comput. Syst. Sci., 2007)

Range-Efficient Counting of Distinct Elements in a Massive Data Stream. - A. Pavan 001; Srikanta Tirthapura (SIAM J. Comput., 2007)

Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. - Aduri Pavan; Alan L. Selman; Samik Sengupta; N. V. Vinodchandran (Theor. Comput. Sci., 2007)

Hardness Hypotheses, Derandomization, and Circuit Complexity. - John M. Hitchcock; Aduri Pavan (Comput. Complex., 2008)

2-Local Random Reductions to 3-Valued Functions. - Aduri Pavan; N. V. Vinodchandran (Comput. Complex., 2008)

Proving SAT does not have small circuits with an application to the two queries problem. - Lance Fortnow; Aduri Pavan; Samik Sengupta (J. Comput. Syst. Sci., 2008)

Partial Bi-immunity, Scaled Dimension, and NP-Completeness. - John M. Hitchcock; Aduri Pavan; N. V. Vinodchandran (Theory Comput. Syst., 2008)

Relations between Average-Case and Worst-Case Complexity. - Aduri Pavan; N. V. Vinodchandran (Theory Comput. Syst., 2008)

Splitting NP-Complete Sets. - Christian Glaßer; Aduri Pavan; Alan L. Selman; Liyu Zhang 001 (SIAM J. Comput., 2008)

Kolmogorov Complexity in Randomness Extraction. - John M. Hitchcock; Aduri Pavan; N. V. Vinodchandran (Electron. Colloquium Comput. Complex., 2009)

On the Power of Unambiguity in Logspace. - Aduri Pavan; Raghunath Tewari; N. V. Vinodchandran (Electron. Colloquium Comput. Complex., 2010)

The fault tolerance of NP-hard problems. - Christian Glaßer; Aduri Pavan; Stephen D. Travers (Inf. Comput., 2011)

A Thirty Year Old Conjecture about Promise Problems. - Andrew Hughes; Aduri Pavan; Nathan Russell; Alan L. Selman (ICALP (1), 2012)

On the power of unambiguity in log-space. - Aduri Pavan; Raghunath Tewari; N. V. Vinodchandran (Comput. Complex., 2012)

Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses. - Xiaoyang Gu; John M. Hitchcock; Aduri Pavan (Theory Comput. Syst., 2012)

Parallel triangle counting in massive streaming graphs. - Kanat Tangwongsan; A. Pavan 001; Srikanta Tirthapura (CIKM, 2013)

An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. - Tatsuya Imai; Kotaro Nakagawa; Aduri Pavan; N. V. Vinodchandran; Osamu Watanabe 001 (CCC, 2013)

Length-Increasing Reductions for PSPACE-Completeness. - John M. Hitchcock; Aduri Pavan (MFCS, 2013)

Counting and Sampling Triangles from a Graph Stream. - A. Pavan 001; Kanat Tangwongsan; Srikanta Tirthapura; Kun-Lung Wu (Proc. VLDB Endow., 2013)

Strong Reductions and Isomorphism of Complete Sets. - Ryan C. Harkins; John M. Hitchcock; Aduri Pavan (Comput., 2014)

New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. - Diptarka Chakraborty; Aduri Pavan; Raghunath Tewari; N. Variyam Vinodchandran; Lin F. Yang (Electron. Colloquium Comput. Complex., 2014)

Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis. - Debasis Mandal; Aduri Pavan; Rajeswari Venugopalan (Electron. Colloquium Comput. Complex., 2014)

Unions of Disjoint NP-Complete Sets. - Christian Glaßer; John M. Hitchcock; Aduri Pavan; Stephen D. Travers (ACM Trans. Comput. Theory, 2014)

On the NP-Completeness of the Minimum Circuit Size Problem. - John M. Hitchcock; Aduri Pavan (FSTTCS, 2015)

On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape. - Debasis Mandal; Aduri Pavan; N. V. Vinodchandran (MFCS (2), 2015)

Computing triangle and open-wedge heavy-hitters in large networks. - Aduri Pavan; Paul Quint; Stephen D. Scott 001; N. V. Vinodchandran; J. Smith (IEEE BigData, 2016)

A Note on the Advice Complexity of Multipass Randomized Logspace. - Peter Dixon 002; Debasis Mandal; Aduri Pavan; N. V. Vinodchandran (MFCS, 2016)

Budgeted testing through an algorithmic lens. - Myra B. Cohen; Aduri Pavan; N. V. Vinodchandran (SIGSOFT FSE, 2016)

Space-Efficient Estimation of Statistics Over Sub-Sampled Streams. - Andrew McGregor 001; A. Pavan 001; Srikanta Tirthapura; David P. Woodruff (Algorithmica, 2016)

A thirty Year old conjecture about promise problems. - Andrew Hughes; Debasis Mandal; Aduri Pavan; Nathan Russell; Alan L. Selman (Comput. Complex., 2016)

Improved Triangle Counting in Graph Streams: Power of Multi-Sampling. - Neeraj Kavassery-Parakkat; Kiana Mousavi Hanjani; A. Pavan 001 (ASONAM, 2018)

Influence Maximization in Social Networks With Non-Target Constraints. - Madhavan R. Padmanabhan; Naresh Somisetty; Samik Basu 001; A. Pavan 001 (IEEE BigData, 2018)

On Pseudodeterministic Approximation Algorithms. - Peter Dixon 002; Aduri Pavan; N. V. Vinodchandran (MFCS, 2018)

A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs. - Ryo Ashida; Tatsuya Imai; Kotaro Nakagawa; A. Pavan 001; N. V. Vinodchandran; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2019)

Disrupting Diffusion: Critical Nodes in Network. - Raj Gaurav Kumar; Preeti Bhardwaj; Samik Basu 001; Aduri Pavan (WI/IAT, 2020)

Perfect Zero Knowledge: New Upperbounds and Relativized Separations. - Peter Dixon 002; Sutanu Gayen; A. Pavan 001; N. V. Vinodchandran (IACR Cryptol. ePrint Arch., 2020)

Multi-Objective Submodular Optimization with Approximate Oracles and Influence Maximization. - Xiaoyun Fu; Rishabh Rajendra Bhatt; Samik Basu 001; Aduri Pavan (IEEE BigData, 2021)

Complete Problems for Multi-Pseudodeterministic Computations. - Peter Dixon 002; A. Pavan 001; N. V. Vinodchandran (ITCS, 2021)

Model Counting meets F0 Estimation. - Aduri Pavan; N. V. Vinodchandran; Arnab Bhattacharyya 001; Kuldeep S. Meel (PODS, 2021)

Model Counting meets F0 Estimation. - Aduri Pavan; N. V. Vinodchandran; Arnab Bhattacharyya 001; Kuldeep S. Meel (CoRR, 2021)

Promise Problems Meet Pseudodeterminism. - Peter Dixon 002; Aduri Pavan; N. V. Vinodchandran (Electron. Colloquium Comput. Complex., 2021)

Measuring the impact of influence on individuals: roadmap to quantifying attitude. - Xiaoyun Fu; Madhavan R. Padmanabhan; Raj Gaurav Kumar; Samik Basu 001; Shawn F. Dorius; A. Pavan 001 (Soc. Netw. Anal. Min., 2021)

Pseudodeterminism: promises and lowerbounds. - Peter Dixon 002; Aduri Pavan; Jason Vander Woude; N. V. Vinodchandran (STOC, 2022)

The Geometry of Rounding. - Jason Vander Woude; Peter Dixon 002; A. Pavan 001; Jamie Radcliffe; N. V. Vinodchandran (Electron. Colloquium Comput. Complex., 2022)

Model Counting Meets Distinct Elements in a Data Stream. - Aduri Pavan; N. V. Vinodchandran; Arnab Bhattacharyya 001; Kuldeep S. Meel (SIGMOD Rec., 2022)

Constraint Optimization over Semirings. - Aduri Pavan; Kuldeep S. Meel; N. V. Vinodchandran; Arnab Bhattacharyya 001 (AAAI, 2023)

On Approximating Total Variation Distance. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; Dimitrios Myrisiotis; A. Pavan 001; N. V. Vinodchandran (IJCAI, 2023)

List and Certificate Complexities in Replicable Learning. - Peter Dixon 002; Aduri Pavan; Jason Vander Woude; N. V. Vinodchandran (NeurIPS, 2023)

Size-constrained k-submodular maximization in near-linear time. - Guanyu Nie; Yanhui Zhu; Yididiya Y. Nadew; Samik Basu 001; A. Pavan 001; Christopher John Quinn (UAI, 2023)

Maximizing submodular functions under submodular constraints. - Madhavan R. Padmanabhan; Yanhui Zhu; Samik Basu 001; Aduri Pavan (UAI, 2023)

Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations. - Michael Chen; A. Pavan 001; N. V. Vinodchandran (DISC, 2023)

Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma. - Jason Vander Woude; Peter Dixon 002; Aduri Pavan; Jamie Radcliffe; N. V. Vinodchandran (CoRR, 2023)

Total Variation Distance Estimation Is as Easy as Probabilistic Inference. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; Dimitrios Myrisiotis; A. Pavan 001; N. V. Vinodchandran (Electron. Colloquium Comput. Complex., 2023)

Model Counting Meets Distinct Elements. - A. Pavan 001; N. V. Vinodchandran; Arnab Bhattacharyya 001; Kuldeep S. Meel (Commun. ACM, 2023)

Model Counting Meets F0 Estimation. - A. Pavan 001; N. Variyam Vinodchandran; Arnab Bhattacharyya 001; Kuldeep S. Meel (ACM Trans. Database Syst., 2023)

Fairness in Monotone k-submodular Maximization: Algorithms and Applications. - Yanhui Zhu; Samik Basu 001; Aduri Pavan (IEEE Big Data, 2024)

Regularized Unconstrained Weakly Submodular Maximization. - Yanhui Zhu; Samik Basu 001; A. Pavan 001 (CIKM, 2024)

Total Variation Distance Meets Probabilistic Inference. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; Dimitrios Myrisiotis; A. Pavan 001; N. V. Vinodchandran (ICML, 2024)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints. - Yanhui Zhu; Samik Basu 001; A. Pavan 001 (IJCAI, 2024)

Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma. - Jason Vander Woude; Peter Dixon 002; Aduri Pavan; Jamie Radcliffe; N. V. Vinodchandran (NeurIPS, 2024)

Fairness in Monotone k-submodular Maximization: Algorithms and Applications. - Yanhui Zhu; Samik Basu 001; A. Pavan 001 (CoRR, 2024)

On the Feasibility of Forgetting in Data Streams. - Aduri Pavan; Sourav Chakraborty 001; N. V. Vinodchandran; Kuldeep S. Meel (Proc. ACM Manag. Data, 2024)

Computational Explorations of Total Variation Distance. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; Dimitrios Myrisiotis; Aduri Pavan; N. V. Vinodchandran (ICLR, 2025)

Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds. - Michael Chen; Aduri Pavan; N. V. Vinodchandran; Ruosong Wang; Lin Yang 011 (ICLR, 2025)

Total variation distance for product distributions is #P-complete. - Arnab Bhattacharyya 001; Sutanu Gayen; Kuldeep S. Meel; Dimitrios Myrisiotis; A. Pavan 001; N. V. Vinodchandran (Inf. Process. Lett., 2025)