default search action
Aduri Pavan
A. Pavan 0001
Person information
- affiliation: Iowa State University, Department of Computer Science, Ames, USA
Other persons with the same name
- A. Pavan 0002 — Politecnico di Milano, Milan, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j35]Aduri Pavan, Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
On the Feasibility of Forgetting in Data Streams. Proc. ACM Manag. Data 2(2): 102 (2024) - [c53]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance Meets Probabilistic Inference. ICML 2024 - [c52]Yanhui Zhu, Samik Basu, A. Pavan:
Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints. IJCAI 2024: 7082-7090 - [i35]Yanhui Zhu, Samik Basu, A. Pavan:
Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints. CoRR abs/2405.05942 (2024) - [i34]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance for Product Distributions is #P-Complete. CoRR abs/2405.08255 (2024) - [i33]Yanhui Zhu, Samik Basu, A. Pavan:
Regularized Unconstrained Weakly Submodular Maximization. CoRR abs/2408.04620 (2024) - 2023
- [j34]A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting Meets Distinct Elements. Commun. ACM 66(9): 95-102 (2023) - [j33]A. Pavan, N. Variyam Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting Meets F0 Estimation. ACM Trans. Database Syst. 48(3): 7:1-7:28 (2023) - [c51]Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya:
Constraint Optimization over Semirings. AAAI 2023: 4070-4077 - [c50]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
On Approximating Total Variation Distance. IJCAI 2023: 3479-3487 - [c49]Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran:
List and Certificate Complexities in Replicable Learning. NeurIPS 2023 - [c48]Guanyu Nie, Yanhui Zhu, Yididiya Y. Nadew, Samik Basu, A. Pavan, Christopher John Quinn:
Size-constrained k-submodular maximization in near-linear time. UAI 2023: 1545-1554 - [c47]Madhavan R. Padmanabhan, Yanhui Zhu, Samik Basu, Aduri Pavan:
Maximizing submodular functions under submodular constraints. UAI 2023: 1618-1627 - [c46]Michael Chen, A. Pavan, N. V. Vinodchandran:
Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations. DISC 2023: 37:1-37:7 - [i32]Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya:
Constraint Optimization over Semirings. CoRR abs/2302.12937 (2023) - [i31]Peter Dixon, A. Pavan, Jason Vander Woude, N. V. Vinodchandran:
List and Certificate Complexities in Replicable Learning. CoRR abs/2304.02240 (2023) - [i30]Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran:
Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma. CoRR abs/2304.04837 (2023) - [i29]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance Estimation Is as Easy as Probabilistic Inference. CoRR abs/2309.09134 (2023) - [i28]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance Estimation Is as Easy as Probabilistic Inference. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j32]Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting Meets Distinct Elements in a Data Stream. SIGMOD Rec. 51(1): 87-94 (2022) - [c45]Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran:
Pseudodeterminism: promises and lowerbounds. STOC 2022: 1552-1565 - [i27]Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran:
On Approximating Total Variation Distance. CoRR abs/2206.07209 (2022) - [i26]Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran:
Geometry of Rounding. CoRR abs/2211.02694 (2022) - [i25]Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, N. V. Vinodchandran:
The Geometry of Rounding. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j31]Xiaoyun Fu, Madhavan R. Padmanabhan, Raj Gaurav Kumar, Samik Basu, Shawn F. Dorius, A. Pavan:
Measuring the impact of influence on individuals: roadmap to quantifying attitude. Soc. Netw. Anal. Min. 11(1): 61 (2021) - [c44]Xiaoyun Fu, Rishabh Rajendra Bhatt, Samik Basu, Aduri Pavan:
Multi-Objective Submodular Optimization with Approximate Oracles and Influence Maximization. IEEE BigData 2021: 328-334 - [c43]Peter Dixon, A. Pavan, N. V. Vinodchandran:
Complete Problems for Multi-Pseudodeterministic Computations. ITCS 2021: 66:1-66:16 - [c42]Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting meets F0 Estimation. PODS 2021: 299-311 - [i24]Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
Promise Problems Meet Pseudodeterminism. CoRR abs/2103.08589 (2021) - [i23]Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting meets F0 Estimation. CoRR abs/2105.00639 (2021) - [i22]Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
Promise Problems Meet Pseudodeterminism. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c41]Xiaoyun Fu, Madhavan R. Padmanabhan, Raj Gaurav Kumar, Samik Basu, Shawn F. Dorius, Aduri Pavan:
Measuring the Impact of Influence on Individuals: Roadmap to Quantifying Attitude. ASONAM 2020: 227-231 - [c40]Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran:
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. TCC (1) 2020: 684-704 - [c39]Raj Gaurav Kumar, Preeti Bhardwaj, Samik Basu, Aduri Pavan:
Disrupting Diffusion: Critical Nodes in Network. WI/IAT 2020: 397-404 - [i21]Xiaoyun Fu, Madhavan Rajagopal Padmanabhan, Raj Gaurav Kumar, Samik Basu, Shawn F. Dorius, Aduri Pavan:
Measuring the Impact of Influence on Individuals: Roadmap to Quantifying Attitude. CoRR abs/2010.13304 (2020) - [i20]Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran:
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. IACR Cryptol. ePrint Arch. 2020: 768 (2020)
2010 – 2019
- 2019
- [i19]Ryo Ashida, Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N. V. Vinodchandran, Osamu Watanabe:
A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c38]Neeraj Kavassery-Parakkat, Kiana Mousavi Hanjani, A. Pavan:
Improved Triangle Counting in Graph Streams: Power of Multi-Sampling. ASONAM 2018: 33-40 - [c37]Madhavan R. Padmanabhan, Naresh Somisetty, Samik Basu, A. Pavan:
Influence Maximization in Social Networks With Non-Target Constraints. IEEE BigData 2018: 771-780 - [c36]Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
On Pseudodeterministic Approximation Algorithms. MFCS 2018: 61:1-61:11 - 2016
- [j30]Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff:
Space-Efficient Estimation of Statistics Over Sub-Sampled Streams. Algorithmica 74(2): 787-811 (2016) - [j29]Andrew Hughes, Debasis Mandal, Aduri Pavan, Nathan Russell, Alan L. Selman:
A thirty Year old conjecture about promise problems. Comput. Complex. 25(4): 883-919 (2016) - [c35]Aduri Pavan, Paul Quint, Stephen D. Scott, N. V. Vinodchandran, J. Smith:
Computing triangle and open-wedge heavy-hitters in large networks. IEEE BigData 2016: 998-1005 - [c34]Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran:
A Note on the Advice Complexity of Multipass Randomized Logspace. MFCS 2016: 31:1-31:7 - [c33]Myra B. Cohen, Aduri Pavan, N. V. Vinodchandran:
Budgeted testing through an algorithmic lens. SIGSOFT FSE 2016: 948-951 - 2015
- [c32]John M. Hitchcock, Aduri Pavan:
On the NP-Completeness of the Minimum Circuit Size Problem. FSTTCS 2015: 236-245 - [c31]Debasis Mandal, Aduri Pavan, N. V. Vinodchandran:
On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape. MFCS (2) 2015: 459-471 - 2014
- [j28]Ryan C. Harkins, John M. Hitchcock, Aduri Pavan:
Strong Reductions and Isomorphism of Complete Sets. Comput. 3(2): 91-104 (2014) - [j27]Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers:
Unions of Disjoint NP-Complete Sets. ACM Trans. Comput. Theory 6(1): 3:1-3:10 (2014) - [c30]Debasis Mandal, Aduri Pavan, Rajeswari Venugopalan:
Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis. FSTTCS 2014: 445-456 - [c29]Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang:
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. FSTTCS 2014: 585-595 - [i18]Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. Variyam Vinodchandran, Lin F. Yang:
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. Electron. Colloquium Comput. Complex. TR14 (2014) - [i17]Debasis Mandal, Aduri Pavan, Rajeswari Venugopalan:
Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j26]A. Pavan, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Counting and Sampling Triangles from a Graph Stream. Proc. VLDB Endow. 6(14): 1870-1881 (2013) - [c28]Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura:
Parallel triangle counting in massive streaming graphs. CIKM 2013: 781-786 - [c27]Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe:
An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. CCC 2013: 277-286 - [c26]John M. Hitchcock, Aduri Pavan:
Length-Increasing Reductions for PSPACE-Completeness. MFCS 2013: 540-550 - [i16]Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura:
Parallel Triangle Counting in Massive Streaming Graphs. CoRR abs/1308.2166 (2013) - 2012
- [j25]Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the power of unambiguity in log-space. Comput. Complex. 21(4): 643-670 (2012) - [j24]Xiaoyang Gu, John M. Hitchcock, Aduri Pavan:
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses. Theory Comput. Syst. 51(2): 248-265 (2012) - [c25]Andrew Hughes, Aduri Pavan, Nathan Russell, Alan L. Selman:
A Thirty Year Old Conjecture about Promise Problems. ICALP (1) 2012: 473-484 - [c24]Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff:
Space-efficient estimation of statistics over sub-sampled streams. PODS 2012: 273-282 - 2011
- [j23]Christian Glaßer, Aduri Pavan, Stephen D. Travers:
The fault tolerance of NP-hard problems. Inf. Comput. 209(3): 443-455 (2011) - [j22]Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov complexity with applications to dimension zero-one laws. Inf. Comput. 209(4): 627-636 (2011) - [j21]John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. ACM Trans. Comput. Theory 3(1): 1:1-1:12 (2011) - [c23]Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers:
Unions of Disjoint NP-Complete Sets. COCOON 2011: 240-251 - 2010
- [c22]Xiaoyang Gu, John M. Hitchcock, Aduri Pavan:
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. STACS 2010: 429-440 - [i15]Xiaoyang Gu, John M. Hitchcock, Aduri Pavan:
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. CoRR abs/1001.0117 (2010) - [i14]Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the Power of Unambiguity in Logspace. CoRR abs/1001.2034 (2010) - [i13]Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the Power of Unambiguity in Logspace. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c21]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. FSTTCS 2009: 215-226 - [c20]Christian Glaßer, Aduri Pavan, Stephen D. Travers:
The Fault Tolerance of NP-Hard Problems. LATA 2009: 374-385 - [i12]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j20]John M. Hitchcock, Aduri Pavan:
Hardness Hypotheses, Derandomization, and Circuit Complexity. Comput. Complex. 17(1): 119-146 (2008) - [j19]Aduri Pavan, N. V. Vinodchandran:
2-Local Random Reductions to 3-Valued Functions. Comput. Complex. 17(4): 501-514 (2008) - [j18]Lance Fortnow, Aduri Pavan, Samik Sengupta:
Proving SAT does not have small circuits with an application to the two queries problem. J. Comput. Syst. Sci. 74(3): 358-363 (2008) - [j17]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. 42(2): 131-142 (2008) - [j16]Aduri Pavan, N. V. Vinodchandran:
Relations between Average-Case and Worst-Case Complexity. Theory Comput. Syst. 42(4): 596-607 (2008) - [j15]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Splitting NP-Complete Sets. SIAM J. Comput. 37(5): 1517-1535 (2008) - 2007
- [j14]John M. Hitchcock, Aduri Pavan:
Comparing reductions to NP-complete sets. Inf. Comput. 205(5): 694-706 (2007) - [j13]Aduri Pavan, Fengming Wang:
Robustness of PSPACE-complete sets. Inf. Process. Lett. 103(3): 102-104 (2007) - [j12]Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. 73(5): 735-754 (2007) - [j11]A. Pavan, Srikanta Tirthapura:
Range-Efficient Counting of Distinct Elements in a Massive Data Stream. SIAM J. Comput. 37(2): 359-379 (2007) - [j10]Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran:
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. 385(1-3): 167-178 (2007) - [c19]Ryan C. Harkins, John M. Hitchcock, Aduri Pavan:
Strong Reductions and Isomorphism of Complete Sets. FSTTCS 2007: 168-178 - 2006
- [j9]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. SIAM J. Comput. 36(2): 516-542 (2006) - [c18]Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran:
Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS 2006: 188-199 - [c17]Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. ICALP (1) 2006: 335-345 - [c16]John M. Hitchcock, Aduri Pavan:
Comparing Reductions to NP-Complete Sets. ICALP (1) 2006: 465-476 - [c15]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Redundancy in Complete Sets. STACS 2006: 444-454 - [c14]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Mitosis in Computational Complexity. TAMC 2006: 61-67 - [i11]John M. Hitchcock, Aduri Pavan:
Comparing Reductions to NP-Complete Sets. Electron. Colloquium Comput. Complex. TR06 (2006) - [i10]John M. Hitchcock, Aduri Pavan:
Hardness Hypotheses, Derandomization, and Circuit Complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j8]John M. Hitchcock, Aduri Pavan:
Resource-bounded strong dimension versus resource-bounded category. Inf. Process. Lett. 95(3): 377-381 (2005) - [j7]Harry Buhrman, Lance Fortnow, Aduri Pavan:
Some Results on Derandomization. Theory Comput. Syst. 38(2): 211-227 (2005) - [c13]Aduri Pavan, N. V. Vinodchandran:
Relations Between Average-Case and Worst-Case Complexity. FCT 2005: 422-432 - [c12]Aduri Pavan, Srikanta Tirthapura:
Range Efficient Computation of F0 over Massive Data Streams. ICDE 2005: 32-43 - [c11]Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, Mitoticity, and Immunity. MFCS 2005: 387-398 - [i9]Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, Mitoticity, and Immunity. Electron. Colloquium Comput. Complex. TR05 (2005) - [i8]Aduri Pavan, N. V. Vinodchandran:
2-Local Random Reductions to 3-Valued Functions. Electron. Colloquium Comput. Complex. TR05 (2005) - [i7]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Redundancy in Complete Sets. Electron. Colloquium Comput. Complex. TR05 (2005) - [i6]Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j6]Aduri Pavan, Alan L. Selman:
Bi-immunity separates strong NP-completeness notions. Inf. Comput. 188(1): 116-126 (2004) - [j5]Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta:
On Higher Arthur-Merlin Classes. Int. J. Found. Comput. Sci. 15(1): 3-19 (2004) - [c10]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. CCC 2004: 184-197 - [c9]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Partial Bi-immunity and NP-Completeness. CCC 2004: 198-203 - [c8]John M. Hitchcock, Aduri Pavan:
Hardness Hypotheses, Derandomization, and Circuit Complexity. FSTTCS 2004: 336-347 - [i5]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. Electron. Colloquium Comput. Complex. TR04 (2004) - [i4]John M. Hitchcock, Aduri Pavan, Pramodchandran N. Variyam:
Partial Bi-Immunity and NP-Completeness. Electron. Colloquium Comput. Complex. TR04 (2004) - [i3]Aduri Pavan, N. V. Vinodchandran:
Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c7]Lance Fortnow, Aduri Pavan, Samik Sengupta:
Proving SAT does not have Small Circuits with an Application to the Two. CCC 2003: 347- - [c6]Harry Buhrman, Lance Fortnow, Aduri Pavan:
Some Results on Derandomization. STACS 2003: 212-222 - 2002
- [c5]Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta:
On Higher Arthur-Merlin Classes. COCOON 2002: 18-27 - [c4]Aduri Pavan, Alan L. Selman:
Bi-Immunity Separates Strong NP-Completeness Notions. STACS 2002: 408-418 - [i2]Aduri Pavan, Alan L. Selman:
Bi-Immunity Separates Strong NP-Completeness Notions. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j4]Lance Fortnow, Aduri Pavan, Alan L. Selman:
Distributionally Hard Languages. Theory Comput. Syst. 34(3): 245-261 (2001) - [j3]Aduri Pavan, Alan L. Selman:
Separation of NP-Completeness Notions. SIAM J. Comput. 31(3): 906-918 (2001) - [c3]Aduri Pavan, Alan L. Selman:
Separation of NP-Completeness Notions. CCC 2001: 78-89 - [i1]Aduri Pavan, Alan L. Selman:
Separation of NP-completeness Notions. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j2]Aduri Pavan, Alan L. Selman:
Complete distributional problems, hard languages, and resource-bounded measure. Theor. Comput. Sci. 234(1-2): 273-286 (2000)
1990 – 1999
- 1999
- [j1]Jay Belanger, Aduri Pavan, Jie Wang:
Reductions Do Not Preserve Fast Convergence Rates in Average Time. Algorithmica 23(4): 363-373 (1999) - [c2]Lance Fortnow, Aduri Pavan, Alan L. Selman:
Distributionally-Hard Languages. COCOON 1999: 184-193 - [c1]Jin-yi Cai, Aduri Pavan, D. Sivakumar:
On the Hardness of Permanent. STACS 1999: 90-99