11 papers:
STOC-2015-DinurHK #composition #fault #query- Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (ID, PH, GK), pp. 267–276.
ICALP-v1-2014-Ben-SassonV #query- Short PCPs with Projection Queries (EBS, EV), pp. 163–173.
- STOC-2009-ImpagliazzoKW
- New direct-product testers and 2-query PCPs (RI, VK, AW), pp. 131–140.
- STOC-2008-FortnowS
- Infeasibility of instance compression and succinct PCPs for NP (LF, RS), pp. 133–142.
- STOC-2006-SamorodnitskyT
- Gowers uniformity, influence of variables, and PCPs (AS, LT), pp. 11–20.
- ICALP-v1-2006-Radhakrishnan #lazy evaluation #random #using
- Gap Amplification in PCPs Using Lazy Random Walks (JR), pp. 96–107.
- STOC-2005-Ben-SassonS #complexity #query
- Simple PCPs with poly-log rate and query complexity (EBS, MS), pp. 266–275.
- STOC-2004-Ben-SassonGHSV #proximity #robust
- Robust pcps of proximity, shorter pcps and applications to coding (EBS, OG, PH, MS, SPV), pp. 1–10.
- STOC-2003-Ben-SassonSVW #testing
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (EBS, MS, SPV, AW), pp. 612–621.
- STOC-1999-ErgunKR #approximate #performance
- Fast Approximate PCPs (FE, RK, RR), pp. 41–50.
- STOC-1998-Trevisan #query #testing
- Recycling Queries in PCPs and in Linearity Tests (Extended Abstract) (LT), pp. 299–308.
