The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Aduri Pavan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lance Fortnow, Aduri Pavan, Samik Sengupta
    Proving SAT does not have Small Circuits with an Application to the Two. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:347-0 [Conf]
  2. Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
    Properties of NP-Complete Sets. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:184-197 [Conf]
  3. John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
    Partial Bi-immunity and NP-Completeness. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:198-203 [Conf]
  4. Aduri Pavan, Alan L. Selman
    Separation of NP-Completeness Notions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:78-89 [Conf]
  5. Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta
    On Higher Arthur-Merlin Classes. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:18-27 [Conf]
  6. Lance Fortnow, Aduri Pavan, Alan L. Selman
    Distributionally-Hard Languages. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:184-193 [Conf]
  7. Aduri Pavan, N. V. Vinodchandran
    Relations Between Average-Case and Worst-Case Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:422-432 [Conf]
  8. John M. Hitchcock, Aduri Pavan
    Hardness Hypotheses, Derandomization, and Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:336-347 [Conf]
  9. Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
    Some Results on Average-Case Hardness Within the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:188-199 [Conf]
  10. Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
    Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:335-345 [Conf]
  11. John M. Hitchcock, Aduri Pavan
    Comparing Reductions to NP-Complete Sets. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:465-476 [Conf]
  12. Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Autoreducibility, Mitoticity, and Immunity. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:387-398 [Conf]
  13. Harry Buhrman, Lance Fortnow, Aduri Pavan
    Some Results on Derandomization. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:212-222 [Conf]
  14. Jin-yi Cai, Aduri Pavan, D. Sivakumar
    On the Hardness of Permanent. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:90-99 [Conf]
  15. Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Redundancy in Complete Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:444-454 [Conf]
  16. Aduri Pavan, Alan L. Selman
    Bi-Immunity Separates Strong NP-Completeness Notions. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:408-418 [Conf]
  17. Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Mitosis in Computational Complexity. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:61-67 [Conf]
  18. Jay Belanger, Aduri Pavan, Jie Wang
    Reductions Do Not Preserve Fast Convergence Rates in Average Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:4, pp:363-373 [Journal]
  19. Aduri Pavan, Alan L. Selman
    Separation of NP-completeness Notions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:32, pp:- [Journal]
  20. Aduri Pavan, Alan L. Selman
    Bi-Immunity Separates Strong NP-Completeness Notions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:005, pp:- [Journal]
  21. Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
    Properties of NP-Complete Sets [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:019, pp:- [Journal]
  22. John M. Hitchcock, Aduri Pavan, Pramodchandran N. Variyam
    Partial Bi-Immunity and NP-Completeness [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:025, pp:- [Journal]
  23. Aduri Pavan, N. V. Vinodchandran
    Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:053, pp:- [Journal]
  24. Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Autoreducibility, Mitoticity, and Immunity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:011, pp:- [Journal]
  25. Aduri Pavan, N. V. Vinodchandran
    2-Local Random Reductions to 3-Valued Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:062, pp:- [Journal]
  26. Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Redundancy in Complete Sets [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:068, pp:- [Journal]
  27. Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
    Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:105, pp:- [Journal]
  28. Aduri Pavan, Alan L. Selman
    Bi-immunity separates strong NP-completeness notions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:188, n:1, pp:116-126 [Journal]
  29. Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta
    On Higher Arthur-Merlin Classes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:1, pp:3-19 [Journal]
  30. John M. Hitchcock, Aduri Pavan
    Resource-bounded strong dimension versus resource-bounded category. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:3, pp:377-381 [Journal]
  31. Harry Buhrman, Lance Fortnow, Aduri Pavan
    Some Results on Derandomization. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:2, pp:211-227 [Journal]
  32. Lance Fortnow, Aduri Pavan, Alan L. Selman
    Distributionally Hard Languages. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:3, pp:245-261 [Journal]
  33. Aduri Pavan, Alan L. Selman
    Separation of NP-Completeness Notions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:906-918 [Journal]
  34. Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
    Properties of NP-Complete Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:516-542 [Journal]
  35. Aduri Pavan, Alan L. Selman
    Complete distributional problems, hard languages, and resource-bounded measure. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:273-286 [Journal]
  36. John M. Hitchcock, Aduri Pavan
    Comparing reductions to NP-complete sets. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:5, pp:694-706 [Journal]
  37. Aduri Pavan, Fengming Wang
    Robustness of PSPACE-complete sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:3, pp:102-104 [Journal]
  38. Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Autoreducibility, mitoticity, and immunity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:5, pp:735-754 [Journal]
  39. Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran
    Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:167-178 [Journal]

  40. Kolmogorov Complexity in Randomness Extraction. [Citation Graph (, )][DBLP]


  41. Strong Reductions and Isomorphism of Complete Sets. [Citation Graph (, )][DBLP]


  42. Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. [Citation Graph (, )][DBLP]


  43. The Fault Tolerance of NP-Hard Problems. [Citation Graph (, )][DBLP]


  44. 2-Local Random Reductions to 3-Valued Functions. [Citation Graph (, )][DBLP]


  45. Hardness Hypotheses, Derandomization, and Circuit Complexity. [Citation Graph (, )][DBLP]


  46. Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses [Citation Graph (, )][DBLP]


  47. On the Power of Unambiguity in Logspace [Citation Graph (, )][DBLP]


  48. Comparing Reductions to NP-Complete Sets. [Citation Graph (, )][DBLP]


  49. Hardness Hypotheses, Derandomization, and Circuit Complexity. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002