A. Pavan

Available identifiers

zbMath Open pavan.aduriMaRDI QIDQ208054

List of research outcomes

Publication	Date of Publication	Type
Pseudodeterminism: promises and lowerbounds	2023-12-08	Paper
Perfect zero knowledge: new upperbounds and relativized separations	2021-12-01	Paper
https://portal.mardi4nfdi.de/entity/Q5005164	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4608590	2018-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q5275370	2017-07-13	Paper
https://portal.mardi4nfdi.de/entity/Q2978535	2017-04-25	Paper
https://portal.mardi4nfdi.de/entity/Q2978548	2017-04-25	Paper
A thirty year old conjecture about promise problems	2016-11-30	Paper
Kolmogorov Complexity in Randomness Extraction	2015-09-24	Paper
On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape	2015-09-16	Paper
Unions of Disjoint NP-Complete Sets	2015-09-07	Paper
Strong Reductions and Isomorphism of Complete Sets	2015-02-24	Paper
Length-Increasing Reductions for PSPACE-Completeness	2013-09-20	Paper
A Thirty Year Old Conjecture about Promise Problems	2013-08-12	Paper
On the power of unambiguity in log-space	2012-12-27	Paper
Collapsing and separating completeness notions under average-case and worst-case hypotheses	2012-12-07	Paper
https://portal.mardi4nfdi.de/entity/Q2920128	2012-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q3113769	2012-01-23	Paper
Unions of Disjoint NP-Complete Sets	2011-08-17	Paper
The fault tolerance of NP-hard problems	2011-07-27	Paper
Extracting Kolmogorov complexity with applications to dimension zero-one laws	2011-04-28	Paper
Robustness of PSPACE-complete sets	2010-03-24	Paper
2-local random reductions to 3-valued functions	2010-03-15	Paper
Resource-bounded strong dimension versus resource-bounded category	2009-12-04	Paper
The Fault Tolerance of NP-Hard Problems	2009-04-02	Paper
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws	2009-03-12	Paper
Comparing Reductions to NP-Complete Sets	2009-03-12	Paper
Splitting NP-Complete Sets	2008-10-28	Paper
Hardness hypotheses, derandomization, and circuit complexity	2008-08-20	Paper
Relations between average-case and worst-case complexity	2008-06-06	Paper
Strong Reductions and Isomorphism of Complete Sets	2008-04-24	Paper
Some Results on Average-Case Hardness Within the Polynomial Hierarchy	2008-04-17	Paper
Partial bi-immunity, scaled dimension, and NP-completeness	2008-04-03	Paper
Redundancy in Complete Sets	2008-03-19	Paper
Proving SAT does not have small circuits with an application to the two queries problem	2008-03-11	Paper
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy	2007-10-18	Paper
Autoreducibility, mitoticity, and immunity	2007-05-30	Paper
Comparing reductions to NP-complete sets	2007-05-14	Paper
Properties of NP‐Complete Sets	2007-05-03	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
Fundamentals of Computation Theory	2006-10-20	Paper
ON HIGHER ARTHUR-MERLIN CLASSES	2005-10-19	Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science	2005-08-12	Paper
Some results on derandomization	2005-04-19	Paper
Bi-immunity separates strong NP-completeness notions	2004-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4808618	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4736858	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4418651	2003-08-11	Paper
Distributionally hard languages	2002-09-11	Paper
Separation of NP-Completeness Notions	2002-04-23	Paper
Complete distributional problems, hard languages, and resource-bounded measure	2000-08-21	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: A. Pavan