| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Xiaoyang Gu, John M. Hitchcock, Aduri Pavan |
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran |
Kolmogorov Complexity in Randomness Extraction. |
TOCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang |
Extracting Kolmogorov complexity with applications to dimension zero-one laws. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Stephen D. Travers |
The fault tolerance of NP-hard problems. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers |
Unions of Disjoint NP-Complete Sets. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran |
On the Power of Unambiguity in Logspace. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Xiaoyang Gu, John M. Hitchcock, Aduri Pavan |
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran |
On the Power of Unambiguity in Logspace |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Xiaoyang Gu, John M. Hitchcock, Aduri Pavan |
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran |
Kolmogorov Complexity in Randomness Extraction. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Stephen D. Travers |
The Fault Tolerance of NP-Hard Problems. |
LATA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran |
Kolmogorov Complexity in Randomness Extraction. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, N. V. Vinodchandran |
2-Local Random Reductions to 3-Valued Functions. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15 |
| 1 | John M. Hitchcock, Aduri Pavan |
Hardness Hypotheses, Derandomization, and Circuit Complexity. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
68Q30, 68Q17, Subject classification. 68Q15 |
| 1 | John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran |
Partial Bi-immunity, Scaled Dimension, and NP-Completeness. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Many-one completeness, Bi-immunity, Scaled dimension, Turing completeness |
| 1 | Aduri Pavan, N. V. Vinodchandran |
Relations between Average-Case and Worst-Case Complexity. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Average-case complexity, Arthur-Merlin games, Worst-case complexity |
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Splitting NP-Complete Sets. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Fengming Wang |
Robustness of PSPACE-complete sets. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran |
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan |
Comparing reductions to NP-complete sets. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Autoreducibility, mitoticity, and immunity. |
J. Comput. Syst. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan C. Harkins, John M. Hitchcock, Aduri Pavan |
Strong Reductions and Isomorphism of Complete Sets. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan |
Hardness Hypotheses, Derandomization, and Circuit Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan |
Comparing Reductions to NP-Complete Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta |
Properties of NP-Complete Sets. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang |
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan |
Comparing Reductions to NP-Complete Sets. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Mitosis in Computational Complexity. |
TAMC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Redundancy in Complete Sets. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran |
Some Results on Average-Case Hardness Within the Polynomial Hierarchy. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan |
Resource-bounded strong dimension versus resource-bounded category. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Redundancy in Complete Sets |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Autoreducibility, Mitoticity, and Immunity |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang |
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, N. V. Vinodchandran |
2-Local Random Reductions to 3-Valued Functions |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Lance Fortnow, Aduri Pavan |
Some Results on Derandomization. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Autoreducibility, Mitoticity, and Immunity. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, N. V. Vinodchandran |
Relations Between Average-Case and Worst-Case Complexity. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta |
Properties of NP-Complete Sets |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan, Pramodchandran N. Variyam |
Partial Bi-Immunity and NP-Completeness |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, N. V. Vinodchandran |
Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta |
On Higher Arthur-Merlin Classes. |
Int. J. Found. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Bi-immunity separates strong NP-completeness notions. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran |
Partial Bi-immunity and NP-Completeness. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta |
Properties of NP-Complete Sets. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan |
Hardness Hypotheses, Derandomization, and Circuit Complexity. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Lance Fortnow, Aduri Pavan |
Some Results on Derandomization. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Aduri Pavan, Samik Sengupta |
Proving SAT does not have Small Circuits with an Application to the Two. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Bi-Immunity Separates Strong NP-Completeness Notions |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Bi-Immunity Separates Strong NP-Completeness Notions. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta |
On Higher Arthur-Merlin Classes. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Separation of NP-completeness Notions |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Aduri Pavan, Alan L. Selman |
Distributionally Hard Languages. |
Theory Comput. Syst. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Separation of NP-Completeness Notions. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Separation of NP-Completeness Notions. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Complete distributional problems, hard languages, and resource-bounded measure. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jay Belanger, Aduri Pavan, Jie Wang |
Reductions Do Not Preserve Fast Convergence Rates in Average Time. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Average polynomial time, Distributional problem, Reductions |
| 1 | Jin-yi Cai, Aduri Pavan, D. Sivakumar |
On the Hardness of Permanent. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Aduri Pavan, Alan L. Selman |
Distributionally-Hard Languages. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")