R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252--271, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Robust PCPs of Proximity, Shorter PCPs and.. - Ben-Sasson.. (2004) Self-citation (Sudan) (Correct)
No context found.
Rubinfeld, R., and Sudan, M. Robust characterizations of polynomials with applications to program testing. SIAM Journal of Computing 25, 2 (Apr.
Robust PCPs of Proximity, Shorter PCPs and.. - Ben-Sasson.. (2004) Self-citation (Sudan) (Correct)
No context found.
Rubinfeld, R., and Sudan, M. Robust characterizations of polynomials with applications to program testing. SIAM Journal of Computing 25, 2 (Apr.
Bounds on 2-Query Codeword Testing - Eli Ben-Sasson Oded (2003) (1 citation) Self-citation (Sudan) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SICOMP, Vol. 25(2), pages 252--271, 1996. 14
Testing Euclidean Minimum Spanning Trees in the Plane + - Artur Czumaj Department (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252--271, 1996.
Testing Hypergraph Coloring - Czumaj, Sohler (2001) (6 citations) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252--271, April 1996. 20
Testing Convex Position - Czumaj, Sohler, Ziegler (2000) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252 -- 271, 1996. 15
Distance-Sensitive Bloom Filters - Kirsch, Mitzenmacher (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
Testing Problems with Sub-Learning Sample Complexity - Kearns, Ron (1998) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252--271, 1996.
Testing Properties of Directed Graphs: Acyclicity and Connectivity - Bender, Ron (2000) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
Approximate Testing of Visual Properties - Raskhodnikova (Correct)
No context found.
R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing 25 (1996) 252-271
Property Testing - Ron (2000) (16 citations) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252--271, 1996.
Some 3CNF Properties are Hard to Test - Ben-Sasson, Harsha, Raskhodnikova (2003) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal of Computing, 25(2):252-271, Apr. 1996.
Testing the Diameter of Graphs - Parnas, Ron (1999) (4 citations) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996. 16
Monotonicity Testing - Raskhodnikova (1999) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996. 42
Accuracy and Sampling Trade-offs for Inferring - Internet Router Graph (Correct)
No context found.
R. Rubinfield and M. Sudan, "Robust Characterization of Polynomials with Applications to Program Testing," SIAM Journal on Computing, vol. 25, no.2, pp--252-271, 1996.
Tight Bounds for Testing Bipartiteness in General Graphs - Kaufman, Krivelevich, Ron (2004) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
Testing Juntas - Eldar Fischer Guy (2002) (4 citations) (Correct)
No context found.
Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252{ 271, 1996.
Property Testing in Bounded Degree Graphs - Oded Goldreich Dept (1997) (34 citations) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
Some Applications of Coding Theory in Computational Complexity - Trevisan (2004) (Correct)
No context found.
Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal of Computing, 25(2):252--271, 1996.
Quantum Property Testing - Buhrman, Fortnow, Newman, Röhrig (2004) (1 citation) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252--271, April 1996.
A Characterization of Easily Testable Induced Subgraphs - Alon, Shapira (2004) (Correct)
No context found.
R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J. on Computing 25 (1996), 252--271.
Techniques for Parallelization - Lecture May And (Correct)
No context found.
R. Rubinfeld, M. Sudan. "Robust characterizations of polynomials with applications to program testing". SIAM journal on Computing, 25(2):252--271, 1996. 9
Three Theorems Regarding Testing Graph Properties - Goldreich, Trevisan (2003) (7 citations) (Correct)
No context found.
R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J Comput 25(2) (1996), 252--271.
Functions That Have Read-Twice Constant Width Branching.. - Fischer, Newman, Sgal (2003) (1 citation) (Correct)
No context found.
R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J. of Computing, 25(2):252-271, 1996. 18
Trading Processor Cycles for Communication - Arnab Paul Rahul (2004) (Correct)
No context found.
R. Rubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. In TR RC1915.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC