### 10 papers:

- ICALP-v1-2011-Drucker
- A PCP Characterization of AM (AD), pp. 581–592.
- ICALP-C-2008-KalaiR #interactive
- Interactive PCP (YTK, RR), pp. 536–547.
- STOC-2007-GuruswamiR #integer
- A 3-query PCP over integers (VG, PR), pp. 198–206.
- STOC-2006-Dinur #theorem
- The PCP theorem by gap amplification (ID), pp. 241–250.
- STOC-2004-HolmerinK #equation #linear #verification
- A new PCP outer verifier with applications to homogeneous linear equations and max-bisection (JH, SK), pp. 11–20.
- ICALP-2004-Meer #proving #theorem
- Transparent Long Proofs: A First PCP Theorem for NPR (KM), pp. 959–970.
- STOC-2003-DinurGKR #multi
- A new multilayered PCP and the hardness of hypergraph vertex cover (ID, VG, SK, OR), pp. 595–601.
- STOC-2000-SamorodnitskyT #complexity #query
- A PCP characterization of NP with optimal amortized query complexity (AS, LT), pp. 191–199.
- STOC-1999-DinurFKRS #towards
- PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability (ID, EF, GK, RR, SS), pp. 29–40.
- STOC-1997-RazS
- A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP (RR, SS), pp. 475–484.