45

Combinatorial Property Testing (a survey)
– Oded Goldreich
 1998

78

Property Testing
– Dana Ron
 2000


Probabilistic Proof Systems: A Primer
– Oded Goldreich
 2008

55

Testing Monotonicity
– Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky
 1999

25

Algorithmic and Analysis Techniques in Property Testing
– Dana Ron

14

The approximability of NPhard problems
– Sanjeev Arora
 1998

13

Testing Acyclicity of Directed Graphs in Sublinear Time
– Michael A. Bender, Dana Ron
 2000

120

Property Testing in Bounded Degree Graphs
– Oded Goldreich, Dana Ron
 1997

14

A Taxonomy of Proof Systems
– Oded Goldreich
 1997

5

Probabilistic Proof Systems  A Survey
– Oded Goldreich
 1996

16

A Combinatorial Consistency Lemma with application to proving the PCP Theorem
– Oded Goldreich, Shmuel Safra
 1997

69

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
– Madhu Sudan
 1992

2

On the Role of Algebra in the Efficient Verification of Proofs
– Madhu Sudan
 1994

47

Some Improvements to Total Degree Tests
– Katalin Friedl, Madhu Sudan
 1995

52

Some Applications of Coding Theory in Computational Complexity
– Luca Trevisan
 2004

7

Exact and approximate testing/correcting of algebraic functions: A survey
– Marcos Kiwi, Frédéric Magniez, Miklos Santha
 2001

719

Proof verification and hardness of approximation problems
– Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
 1992

117

Improved NonApproximability Results
– Mihir Bellare, Madhu Sudan
 1994

10

Testing Properties of Directed Graphs: Acyclicity and Connectivity
– Michael A. Bender, Dana Ron
 2002
