Sofya Raskhodnikova  Home/Search
Context
Related
| mit.edu/~sofya/phd.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~sofya/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Property testers are algorithms that distinguish inputs with a given property from those that are far from satisfying the property. Far means that many characters of the input must be changed before the property arises in it. Property testing was introduced by Rubinfeld and Sudan in the context of linearity testing and first studied in a variety of other contexts by Goldreich, Goldwasser and Ron. The query complexity of a property tester is the number of input characters it reads. This thesis... (Update)
Active bibliography (related documents): More All
1.2: Monotonicity Testing over General Poset Domains.. - Fischer, Lehman.. (2002) (Correct)
0.7: Some 3CNF Properties are Hard to Test - Ben-Sasson, Harsha, Raskhodnikova (2003) (Correct)
0.7: CNF Properties are Hard to Test - Ben-Sasson, Harsha, Raskhodnikova (2002) (Correct)
Similar documents based on text: More All
0.2: Approximate Testing of Visual Properties - Raskhodnikova (Correct)
0.0: Self-certifying File System - Mazieres (2000) (Correct)
0.0: Subword Lexical Modelling for Speech Recognition - Lau (1998) (Correct)
BibTeX entry: (Update)
@misc{ raskhodnikova-property,
author = "Sofya Raskhodnikova",
title = "Property Testing: Theory and Applications",
url = "citeseer.ist.psu.edu/raskhodnikova03property.html" }
Citations (may not include all citations):465 Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
341 Low Density Parity Check Codes (context) - Gallager - 1963
196 Probability: theory and examples (context) - Durrett - 1996
167 Property testing and its connection to learning and approxim.. - Goldreich, Goldwasser et al. - 1998
151 A General Lower Bound on the Number of Examples Needed for L.. (context) - Ehrenfeucht, Haussler et al. - 1989
108 A decomposition theorem for partially ordered sets (context) - Dilworth - 1950
72 Many hard examples for resolution (context) - Chvatal, Szemeredi - 1988
61 The complexity of promise problems with applications to publ.. (context) - Even, Selman et al. - 1984
33 Regular languages are testable with a constant number of que.. - Alon, Krivelevich et al. - 2001
14 Property testing in computational geometry (context) - Czumaj, Sohler et al. - 2000
14 The art of uninformed decisions: A primer to property testin.. - Fischer - 2001
12 On sets of integers which contain no three terms in arithmet.. (context) - Behrend - 1946
11 Testing graphs for colorability properties - Fischer - 2001
10 Monotonicity testing over general poset domains - Fischer, Lehman et al. - 2002
10 Approximating the minimum spanning tree weight in sublinear .. - Chazelle, Rubinfeld et al. - 2001
10 A lower bound for testing 3colorability in bounded-degree gr.. - Bogdanov, Obata et al. - 2002
9 Testing of matrix properties - Fischer, Newman - 2001
8 the strength of comparisons in property testing - Fischer
7 Some 3CNF properties are hard to test (context) - Ben-Sasson, Harsha et al. - 2003
7 Property testing with geometric queries - Czumaj, Sohler - 2001
6 Randomness Conductors and Constant-Degree Lossless Expanders (context) - Capalbo, Reingold et al. - 2002
5 cient testing of large graphs (context) - Alon, Fischer et al. - 2000
5 Fast approximation PCPs for multidimensional bin-packing pro.. (context) - Batu, Rubinfeld et al. - 1999
3 Testing Satisfiability - Alon, Shapira - 2002
3 Functions that have read-twice (context) - Fischer, Newman - 2002
2 A preliminary version appeared (context) - Ergun, Kannan et al. - 1998
1 International Workshop on Randomization and Approximation Te.. (context) - Dodis, Goldreich et al. - 1999
1 cient low degree tests and short PCPs via epsilon-biased set.. (context) - Ben-Sasson, Sudan et al. - 2003
1 A Sublinear Algorithm for Weakly Approximating Edit Distance (context) - Alon, Spencer et al. - 2003
Documents on the same site (http://theory.lcs.mit.edu/~sofya/): More
Lower Bounds for Embeddings of Edit Distance into.. - Andoni, Deza, Gupta, .. (2003) (Correct)
Monotonicity Testing - Raskhodnikova (1999) (Correct)
A Sublinear Algorithm for Weakly Approximating Edit Distance - Batu, Ergün, Kilian, Magen (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