See this document in CiteSeerX!

Self-Testing/Correcting with Applications to Numerical Problems (1990)  (Make Corrections)  (94 citations)
Manuel Blum, Michael Luby, Ronitt Rubinfeld
Journal of Computer and System Sciences



  Home/Search   Context   Related

 
View or download:
cornell.edu/Info/People/ronitt...blr.ps
cornell.edu/Info/People/ronitt...blr.ps
nec.com/homepages/ronitt/paper...blr.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cornell.edu/Info/People/...papers (more)
From:  cornell.edu/Info/People/...papers
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Suppose someone gives us an extremely fast program P that we can call as a black box to compute a function f . Should we trust that P works correctly? A self-testing/correcting pair allows us to: (1) estimate the probability that P (x) 6= f(x) when x is randomly chosen; (2) on any input x, compute f(x) correctly as long as P is not too faulty on average. Furthermore, both (1) and (2) take time only slightly more than Computer Science Division, U.C. Berkeley, Berkeley, California 94720,... (Update)

Cited by:   More
Testing Hypergraph Coloring - Czumaj, Sohler (2001)   (Correct)
Checking Geometric Programs or Verification of Geometric.. - Kurt Mehlhorn Stefan (1996)   (Correct)
Highly Resilient Correctors for Polynomials - Peter Gemmell Madhu (1992)   (Correct)

Similar documents (at the sentence level):
28.0%:   Self-Testing/Correcting with Applications to Numerical.. - Blum, Luby, Rubinfeld (1990)   (Correct)

Similar documents based on text:   More   All
0.7:   Robust Characterizations of Polynomials with Applications to .. - Rubinfeld, Sudan (1996)   (Correct)
0.6:   Ranyi, A., (1970), Probability Theory, North-Holland.. - Rosser Schoenfeld.. (1991)   (Correct)
0.5:   Self-Testing Without The Generator Bottleneck - Ergün, Kumar, Sivakumar   (Correct)

Related documents from co-citation:   More   All
39:   Robust characterization of polynomials with applications to program testing - Rubinfeld, Sudan - 1996
38:   Non-deterministic exponential time has twoprover interactive protocols - Babai, Fortnow et al. - 1991
37:   Self testingcorrecting polynomial and approximate function - Rubinfeld, Wigderson et al. - 1991

BibTeX entry:   (Update)

M. Blum, M. Luby and R. Rubinfeld, Self-testing/correcting with applications to numerical problems. JCSS, 47:549-595, 1994. http://citeseer.ist.psu.edu/article/blum90selftestingcorrecting.html   More

@article{ blum93selftestingcorrecting,
    author = "Manuel Blum and Michael Luby and Ronitt Rubinfeld",
    title = "Self-Testing/Correcting with Applications to Numerical Problems",
    journal = "{Journal of Computer and System Sciences}",
    volume = "47",
    number = "3",
    pages = "549--595",
    year = "1993",
    url = "citeseer.ist.psu.edu/article/blum90selftestingcorrecting.html" }
Citations not processed or no citations identified.



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://simon.cs.cornell.edu/Info/People/ronitt/papers.html):   More
Property Testing of Abelian Group Operations - Ravi Kumar   (Correct)
Exactly Learning Automata with Small Cover Time - Dana Ron (1995)   (Correct)
On the Robustness of Functional Equations - Rubinfeld (1994)   (Correct)

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