Travelled to:1 × Italy
1 × Spain
1 × United Kingdom
Collaborated with:J.M.Hitchcock N.V.Vinodchandran C.Glaßer S.D.Travers M.B.Cohen A.Hughes N.Russell A.L.Selman L.Fortnow F.Wang
Talks about:problem (2) kolmogorov (1) conjectur (1) algorithm (1) extract (1) complex (1) complet (1) thirti (1) reduct (1) promis (1)
Person: Aduri Pavan
DBLP: Pavan:Aduri
Contributed to:
2012
20092006
2016Wrote 5 papers:
- ICALP-v1-2012-HughesPRS #problem
- A Thirty Year Old Conjecture about Promise Problems (AH, AP, NR, ALS), pp. 473–484.
- LATA-2009-GlasserPT #fault tolerance #np-hard #problem
- The Fault Tolerance of NP-Hard Problems (CG, AP, SDT), pp. 374–385.
- ICALP-v1-2006-FortnowHPVW #complexity
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws (LF, JMH, AP, NVV, FW), pp. 335–345.
- ICALP-v1-2006-HitchcockP #reduction #set
- Comparing Reductions to NP-Complete Sets (JMH, AP), pp. 465–476.
- FSE-2016-CohenPV #algorithm #lens #testing
- Budgeted testing through an algorithmic lens (MBC, AP, NVV), pp. 948–951.