Aduri Pavan - RankMe

102 papers A* 8A 11B 7C 2Misc 3Journal 55Unranked 16

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Computational Explorations of Total Variation Distance. ICLR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran
2025	A*	`conf`	Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds. ICLR Michael Chen, Aduri Pavan, N. V. Vinodchandran, Ruosong Wang, Lin Yang
2025	J	`jnl`	Representation Obliviousness and Pseudodeterminism in Streaming Algorithms. Proc. ACM Manag. Data Michael Chen, Sourav Chakraborty, Aduri Pavan, N. V. Vinodchandran
2024	B	`conf`	Fairness in Monotone k-submodular Maximization: Algorithms and Applications. IEEE Big Data Yanhui Zhu, Samik Basu, Aduri Pavan
2024	J	`jnl`	On the Feasibility of Forgetting in Data Streams. Proc. ACM Manag. Data Aduri Pavan, Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel
2024	A*	`conf`	Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma. NeurIPS Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
2023	A*	`conf`	Constraint Optimization over Semirings. AAAI Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya
2023	J	`jnl`	Constraint Optimization over Semirings. CoRR Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya
2023	J	`jnl`	Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma. CoRR Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
2023	A*	`conf`	List and Certificate Complexities in Replicable Learning. NeurIPS Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran
2023	A	`conf`	Maximizing submodular functions under submodular constraints. UAI Madhavan R. Padmanabhan, Yanhui Zhu, Samik Basu, Aduri Pavan
2022	J	`jnl`	Geometry of Rounding. CoRR Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
2022	J	`jnl`	Model Counting Meets Distinct Elements in a Data Stream. SIGMOD Rec. Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2022	J	`jnl`	On Approximating Total Variation Distance. CoRR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran
2022	A*	`conf`	Pseudodeterminism: promises and lowerbounds. STOC Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran
2021	A*	`conf`	Model Counting meets F PODS Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2021	J	`jnl`	Model Counting meets F0 Estimation. CoRR Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2021	—	`conf`	Multi-Objective Submodular Optimization with Approximate Oracles and Influence Maximization. IEEE BigData Xiaoyun Fu, Rishabh Rajendra Bhatt, Samik Basu, Aduri Pavan
2021	J	`jnl`	Promise Problems Meet Pseudodeterminism. CoRR Peter Dixon, Aduri Pavan, N. V. Vinodchandran
2021	J	`jnl`	Promise Problems Meet Pseudodeterminism. Electron. Colloquium Comput. Complex. Peter Dixon, Aduri Pavan, N. V. Vinodchandran
2020	—	`conf`	Disrupting Diffusion: Critical Nodes in Network. WI/IAT Raj Gaurav Kumar, Preeti Bhardwaj, Samik Basu, Aduri Pavan
2020	B	`conf`	Measuring the Impact of Influence on Individuals: Roadmap to Quantifying Attitude. ASONAM Xiaoyun Fu, Madhavan R. Padmanabhan, Raj Gaurav Kumar, Samik Basu, Shawn F. Dorius, Aduri Pavan
2020	J	`jnl`	Measuring the Impact of Influence on Individuals: Roadmap to Quantifying Attitude. CoRR Xiaoyun Fu, Madhavan Rajagopal Padmanabhan, Raj Gaurav Kumar, Samik Basu, Shawn F. Dorius, Aduri Pavan
2020	—	`conf`	Perfect Zero Knowledge: New Upperbounds and Relativized Separations. TCC (1) Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran
2018	B	`conf`	On Pseudodeterministic Approximation Algorithms. MFCS Peter Dixon, Aduri Pavan, N. V. Vinodchandran
2016	B	`conf`	A Note on the Advice Complexity of Multipass Randomized Logspace. MFCS Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran
2016	J	`jnl`	A thirty Year old conjecture about promise problems. Comput. Complex. Andrew Hughes, Debasis Mandal, Aduri Pavan, Nathan Russell, Alan L. Selman
2016	—	`conf`	Budgeted testing through an algorithmic lens. SIGSOFT FSE Myra B. Cohen, Aduri Pavan, N. V. Vinodchandran
2016	—	`conf`	Computing triangle and open-wedge heavy-hitters in large networks. IEEE BigData Aduri Pavan, Paul Quint, Stephen D. Scott, N. V. Vinodchandran, J. Smith
2015	—	`conf`	On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape. MFCS (2) Debasis Mandal, Aduri Pavan, N. V. Vinodchandran
2015	—	`conf`	On the NP-Completeness of the Minimum Circuit Size Problem. FSTTCS John M. Hitchcock, Aduri Pavan
2014	—	`conf`	New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. FSTTCS Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang
2014	J	`jnl`	New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. Electron. Colloquium Comput. Complex. Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. Variyam Vinodchandran, Lin F. Yang
2014	—	`conf`	Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis. FSTTCS Debasis Mandal, Aduri Pavan, Rajeswari Venugopalan
2014	J	`jnl`	Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis. Electron. Colloquium Comput. Complex. Debasis Mandal, Aduri Pavan, Rajeswari Venugopalan
2014	J	`jnl`	Strong Reductions and Isomorphism of Complete Sets. Comput. Ryan C. Harkins, John M. Hitchcock, Aduri Pavan
2014	J	`jnl`	Unions of Disjoint NP-Complete Sets. ACM Trans. Comput. Theory Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers
2013	A	`conf`	An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. CCC Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe
2013	B	`conf`	Length-Increasing Reductions for PSPACE-Completeness. MFCS John M. Hitchcock, Aduri Pavan
2012	—	`conf`	A Thirty Year Old Conjecture about Promise Problems. ICALP (1) Andrew Hughes, Aduri Pavan, Nathan Russell, Alan L. Selman
2012	J	`jnl`	Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses. Theory Comput. Syst. Xiaoyang Gu, John M. Hitchcock, Aduri Pavan
2012	J	`jnl`	On the power of unambiguity in log-space. Comput. Complex. Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
2011	J	`jnl`	Extracting Kolmogorov complexity with applications to dimension zero-one laws. Inf. Comput. Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
2011	J	`jnl`	Kolmogorov Complexity in Randomness Extraction. ACM Trans. Comput. Theory John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran
2011	J	`jnl`	The fault tolerance of NP-hard problems. Inf. Comput. Christian Glaßer, Aduri Pavan, Stephen D. Travers
2011	Misc	`conf`	Unions of Disjoint NP-Complete Sets. COCOON Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers
2010	J	`jnl`	Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses CoRR Xiaoyang Gu, John M. Hitchcock, Aduri Pavan
2010	A	`conf`	Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. STACS Xiaoyang Gu, John M. Hitchcock, Aduri Pavan
2010	J	`jnl`	On the Power of Unambiguity in Logspace CoRR Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
2010	J	`jnl`	On the Power of Unambiguity in Logspace. Electron. Colloquium Comput. Complex. Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
2009	—	`conf`	Kolmogorov Complexity in Randomness Extraction. FSTTCS John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
2009	J	`jnl`	Kolmogorov Complexity in Randomness Extraction. Electron. Colloquium Comput. Complex. John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
2009	C	`conf`	The Fault Tolerance of NP-Hard Problems. LATA Christian Glaßer, Aduri Pavan, Stephen D. Travers
2008	J	`jnl`	2-Local Random Reductions to 3-Valued Functions. Comput. Complex. Aduri Pavan, N. V. Vinodchandran
2008	J	`jnl`	Hardness Hypotheses, Derandomization, and Circuit Complexity. Comput. Complex. John M. Hitchcock, Aduri Pavan
2008	J	`jnl`	Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
2008	J	`jnl`	Proving SAT does not have small circuits with an application to the two queries problem. J. Comput. Syst. Sci. Lance Fortnow, Aduri Pavan, Samik Sengupta
2008	J	`jnl`	Relations between Average-Case and Worst-Case Complexity. Theory Comput. Syst. Aduri Pavan, N. V. Vinodchandran
2008	J	`jnl`	Splitting NP-Complete Sets. SIAM J. Comput. Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
2007	J	`jnl`	Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
2007	J	`jnl`	Comparing reductions to NP-complete sets. Inf. Comput. John M. Hitchcock, Aduri Pavan
2007	J	`jnl`	Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran
2007	J	`jnl`	Robustness of PSPACE-complete sets. Inf. Process. Lett. Aduri Pavan, Fengming Wang
2007	—	`conf`	Strong Reductions and Isomorphism of Complete Sets. FSTTCS Ryan C. Harkins, John M. Hitchcock, Aduri Pavan
2006	—	`conf`	Comparing Reductions to NP-Complete Sets. ICALP (1) John M. Hitchcock, Aduri Pavan
2006	J	`jnl`	Comparing Reductions to NP-Complete Sets. Electron. Colloquium Comput. Complex. John M. Hitchcock, Aduri Pavan
2006	—	`conf`	Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. ICALP (1) Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
2006	J	`jnl`	Hardness Hypotheses, Derandomization, and Circuit Complexity. Electron. Colloquium Comput. Complex. John M. Hitchcock, Aduri Pavan
2006	C	`conf`	Mitosis in Computational Complexity. TAMC Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
2006	J	`jnl`	Properties of NP-Complete Sets. SIAM J. Comput. Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
2006	A	`conf`	Redundancy in Complete Sets. STACS Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
2006	—	`conf`	Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
2005	J	`jnl`	2-Local Random Reductions to 3-Valued Functions Electron. Colloquium Comput. Complex. Aduri Pavan, N. V. Vinodchandran
2005	J	`jnl`	Autoreducibility, Mitoticity, and Immunity Electron. Colloquium Comput. Complex. Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
2005	B	`conf`	Autoreducibility, Mitoticity, and Immunity. MFCS Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
2005	J	`jnl`	Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws Electron. Colloquium Comput. Complex. Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
2005	A*	`conf`	Range Efficient Computation of F ICDE Aduri Pavan, Srikanta Tirthapura
2005	J	`jnl`	Redundancy in Complete Sets Electron. Colloquium Comput. Complex. Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
2005	B	`conf`	Relations Between Average-Case and Worst-Case Complexity. FCT Aduri Pavan, N. V. Vinodchandran
2005	J	`jnl`	Resource-bounded strong dimension versus resource-bounded category. Inf. Process. Lett. John M. Hitchcock, Aduri Pavan
2005	J	`jnl`	Some Results on Derandomization. Theory Comput. Syst. Harry Buhrman, Lance Fortnow, Aduri Pavan
2004	J	`jnl`	Bi-immunity separates strong NP-completeness notions. Inf. Comput. Aduri Pavan, Alan L. Selman
2004	—	`conf`	Hardness Hypotheses, Derandomization, and Circuit Complexity. FSTTCS John M. Hitchcock, Aduri Pavan
2004	J	`jnl`	On Higher Arthur-Merlin Classes. Int. J. Found. Comput. Sci. Jin-Yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta
2004	J	`jnl`	Partial Bi-Immunity and NP-Completeness Electron. Colloquium Comput. Complex. John M. Hitchcock, Aduri Pavan, Pramodchandran N. Variyam
2004	A	`conf`	Partial Bi-immunity and NP-Completeness. CCC John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
2004	J	`jnl`	Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility Electron. Colloquium Comput. Complex. Aduri Pavan, N. V. Vinodchandran
2004	J	`jnl`	Properties of NP-Complete Sets Electron. Colloquium Comput. Complex. Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
2004	A	`conf`	Properties of NP-Complete Sets. CCC Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
2003	A	`conf`	Proving SAT does not have Small Circuits with an Application to the Two. CCC Lance Fortnow, Aduri Pavan, Samik Sengupta
2003	A	`conf`	Some Results on Derandomization. STACS Harry Buhrman, Lance Fortnow, Aduri Pavan
2002	J	`jnl`	Bi-Immunity Separates Strong NP-Completeness Notions Electron. Colloquium Comput. Complex. Aduri Pavan, Alan L. Selman
2002	A	`conf`	Bi-Immunity Separates Strong NP-Completeness Notions. STACS Aduri Pavan, Alan L. Selman
2002	Misc	`conf`	On Higher Arthur-Merlin Classes. COCOON Jin-Yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta
2001	J	`jnl`	Distributionally Hard Languages. Theory Comput. Syst. Lance Fortnow, Aduri Pavan, Alan L. Selman
2001	A	`conf`	Separation of NP-Completeness Notions. CCC Aduri Pavan, Alan L. Selman
2001	J	`jnl`	Separation of NP-Completeness Notions. SIAM J. Comput. Aduri Pavan, Alan L. Selman
2001	J	`jnl`	Separation of NP-completeness Notions Electron. Colloquium Comput. Complex. Aduri Pavan, Alan L. Selman
2000	J	`jnl`	Complete distributional problems, hard languages, and resource-bounded measure. Theor. Comput. Sci. Aduri Pavan, Alan L. Selman
1999	Misc	`conf`	Distributionally-Hard Languages. COCOON Lance Fortnow, Aduri Pavan, Alan L. Selman
1999	A	`conf`	On the Hardness of Permanent. STACS Jin-Yi Cai, Aduri Pavan, D. Sivakumar
1999	J	`jnl`	Reductions Do Not Preserve Fast Convergence Rates in Average Time. Algorithmica Jay Belanger, Aduri Pavan, Jie Wang