Aduri Pavan
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
27
Venues
14
Active years
1999–2025
Best venue rank
A*
Where they publish
Papers
27 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICLR | Computational Explorations of Total Variation Distance. | Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran |
| 2025 | ICLR | Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds. | Michael Chen, Aduri Pavan, N. V. Vinodchandran, Ruosong Wang, Lin Yang |
| 2023 | AAAI | Constraint Optimization over Semirings. | Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya |
| 2023 | UAI | Maximizing submodular functions under submodular constraints. | Madhavan R. Padmanabhan, Yanhui Zhu, Samik Basu, Aduri Pavan |
| 2022 | STOC | Pseudodeterminism: promises and lowerbounds. | Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran |
| 2021 | PODS | Model Counting meets F | Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel |
| 2020 | TCC | Perfect Zero Knowledge: New Upperbounds and Relativized Separations. | Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran |
| 2018 | MFCS | On Pseudodeterministic Approximation Algorithms. | Peter Dixon, Aduri Pavan, N. V. Vinodchandran |
| 2016 | MFCS | A Note on the Advice Complexity of Multipass Randomized Logspace. | Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran |
| 2015 | MFCS | On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape. | Debasis Mandal, Aduri Pavan, N. V. Vinodchandran |
| 2013 | MFCS | Length-Increasing Reductions for PSPACE-Completeness. | John M. Hitchcock, Aduri Pavan |
| 2012 | ICALP | A Thirty Year Old Conjecture about Promise Problems. | Andrew Hughes, Aduri Pavan, Nathan Russell, Alan L. Selman |
| 2011 | COCOON | Unions of Disjoint NP-Complete Sets. | Christian Glaer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers |
| 2010 | STACS | Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. | Xiaoyang Gu, John M. Hitchcock, Aduri Pavan |
| 2009 | LATA | The Fault Tolerance of NP-Hard Problems. | Christian Glaer, Aduri Pavan, Stephen D. Travers |
| 2006 | ICALP | Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. | Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang |
| 2006 | ICALP | Comparing Reductions to NP-Complete Sets. | John M. Hitchcock, Aduri Pavan |
| 2006 | STACS | Redundancy in Complete Sets. | Christian Glaer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
| 2006 | TAMC | Mitosis in Computational Complexity. | Christian Glaer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
| 2005 | FCT | Relations Between Average-Case and Worst-Case Complexity. | Aduri Pavan, N. V. Vinodchandran |
| 2005 | ICDE | Range Efficient Computation of F | Aduri Pavan, Srikanta Tirthapura |
| 2005 | MFCS | Autoreducibility, Mitoticity, and Immunity. | Christian Glaer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang |
| 2003 | STACS | Some Results on Derandomization. | Harry Buhrman, Lance Fortnow, Aduri Pavan |
| 2002 | COCOON | On Higher Arthur-Merlin Classes. | Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta |
| 2002 | STACS | Bi-Immunity Separates Strong NP-Completeness Notions. | Aduri Pavan, Alan L. Selman |
| 1999 | COCOON | Distributionally-Hard Languages. | Lance Fortnow, Aduri Pavan, Alan L. Selman |
| 1999 | STACS | On the Hardness of Permanent. | Jin-yi Cai, Aduri Pavan, D. Sivakumar |