@book{MotwaniR95,
  author    = {Rajeev Motwani and
               Prabhakar Raghavan},
  title     = {Randomized Algorithms},
  publisher = {Cambridge University Press},
  year      = {1995},
  url       = {https://doi.org/10.1017/cbo9780511814075},
  doi       = {10.1017/cbo9780511814075},
  isbn      = {0-521-47465-5},
  timestamp = {Thu, 02 Jan 2020 12:13:44 +0100},
  biburl    = {https://dblp.org/rec/books/cu/MotwaniR95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{EKKRV00,
    Author = {F. Ergun and S. Kannan and S. R. Kumar and R. Rubinfeld and M. Viswanathan},
    Journal = {JCSS},
    Note = {Preliminary version in 30th STOC, 1998},
    Number = 3,
    Pages = {717--751},
    Title = {Spot-Checkers},
    Volume = 60,
    Year = 2000}


@article{GGR98,
    Author = {O. Goldreich and S. Goldwasser and D. Ron},
    Journal = {Journal of the ACM},
    Number = 4,
    Year = 1998,
    Pages = {653-750},
    Title = {Property Testing and its Connection to Learning and Approximation},
    Note = {Preliminary version in 37th FOCS, 1996},
    Volume = 45}

@article{GR02,
  author    = {Oded Goldreich and
               Dana Ron},
  title     = {Property Testing in Bounded Degree Graphs},
  journal   = {Algorithmica},
  volume    = {32},
  number    = {2},
  year      = {2002},
  pages     = {302-343},
  note      = {Preliminary version in 29th STOC, 1997},
  ee        = {http://dx.doi.org/10.1007/s00453-001-0078-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{CRT05,
  author    = {Bernard Chazelle and
               Ronitt Rubinfeld and
               Luca Trevisan},
  title     = {Approximating the Minimum Spanning Tree Weight in Sublinear
               Time},
  journal   = {SIAM J. Comput.},
  volume    = {34},
  number    = {6},
  year      = {2005},
  pages     = {1370-1379},
  ee        = {http://dx.doi.org/10.1137/S0097539702403244},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{RS96,
    Author = {Ronitt Rubinfeld and Madhu Sudan},
    Journal = {SIAM Journal of Computing},
    Number = 2,
    Pages = {252--271},
    Title = {Robust Characterization of Polynomials with Applications to Program Testing},
    Note = {Preliminary version in in 23rd STOC, 1991 and 3rd SODA, 1992},
    Volume = 25,
    Year = 1996}

@inproceedings{DGLRRS99,
  author    = {Yevgeniy Dodis and
               Oded Goldreich and
               Eric Lehman and
               Sofya Raskhodnikova and
               Dana Ron and
               Alex Samorodnitsky},
  title     = {Improved Testing Algorithms for Monotonicity.},
  booktitle = {RANDOM},
  year      = {1999},
  pages     = {97-108}
}

@inproceedings{BGJRW09,
  author    = {Arnab Bhattacharyya and
               Elena Grigorescu and
               Kyomin Jung and
               Sofya Raskhodnikova and
               David P. Woodruff},
  title     = {Transitive-closure spanners},
  booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on
               Discrete Algorithms (SODA)},
  year      = {2009},
  pages     = {932-941},
  ee        = {http://doi.acm.org/10.1145/1496770.1496871},
  crossref  = {DBLP:conf/soda/2009},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Ras03,
  author    = {Sofya Raskhodnikova},
  title     = {Approximate Testing of Visual Properties},
  booktitle = {RANDOM-APPROX},
  year      = {2003},
  pages     = {370-381},
  ee        = {http://dx.doi.org/10.1007/978-3-540-45198-3_31},
  crossref  = {DBLP:conf/random/2003},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{JR11,
  author    = {Madhav Jha and
               Sofya Raskhodnikova},
  title     = {Testing and Reconstruction of Lipschitz Functions with Applications
               to Data Privacy},
  booktitle = {FOCS},
  year      = {2011},
  pages     = {433-442},
  ee        = {http://dx.doi.org/10.1109/FOCS.2011.13},
  crossref  = {DBLP:conf/focs/2011},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{JhaR13,
  author    = {Madhav Jha and
               Sofya Raskhodnikova},
  title     = {Testing and Reconstruction of Lipschitz Functions with Applications
               to Data Privacy},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {700--731},
  year      = {2013},
  url       = {https://doi.org/10.1137/110840741},
  doi       = {10.1137/110840741},
  timestamp = {Sat, 27 May 2017 14:22:59 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JhaR13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DMNS06,
  author    = {Cynthia Dwork and
               Frank McSherry and
               Kobbi Nissim and
               Adam Smith},
  title     = {Calibrating Noise to Sensitivity in Private Data Analysis},
  booktitle = {TCC},
  year      = {2006},
  pages     = {265-284},
  ee        = {http://dx.doi.org/10.1007/11681878_14},
  crossref  = {DBLP:conf/tcc/2006},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{CGLN11,
  author    = {Swarat Chaudhuri and
               Sumit Gulwani and
               Roberto Lublinerman and
               Sara NavidPour},
  title     = {Proving programs robust},
  booktitle = {SIGSOFT FSE},
  year      = {2011},
  pages     = {102-112},
  ee        = {http://doi.acm.org/10.1145/2025113.2025131},
  crossref  = {DBLP:conf/sigsoft/2011},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{McD89,
  author    = {Colin McDiarmid},
  title     = {On the method of bounded differences},
  booktitle = {Surveys in Combinatorics, 1989, J. Siemons ed.,  London Mathematical Society Lecture Note Series 141, Cambridge University Press},
  year      = {1989},
  pages     = {148-188}
}

@Article{GGLRS00,
  author =	"Goldreich and Goldwasser and Lehman and Ron and
		 Samorodnitsky",
  title =	"Testing Monotonicity",
  journal =	"COMBINAT: Combinatorica",
  volume =	"20",
  year = 	"2000",
}

@article{KKNB11,
  author    = {Igor Kleiner and
               Daniel Keren and
               Ilan Newman and
               Oren Ben-Zwi},
  title     = {Applying Property Testing to an Image Partitioning Problem},
  journal   = {IEEE Trans. Pattern Anal. Mach. Intell.},
  volume    = {33},
  number    = {2},
  year      = {2011},
  pages     = {256-265},
  ee        = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2010.165},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{TR10,
  author    = {Gilad Tsur and
               Dana Ron},
  title     = {Testing Properties of Sparse Images},
  booktitle = {FOCS},
  year      = {2010},
  pages     = {468-477},
  ee        = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2010.52},
  crossref  = {DBLP:conf/focs/2010},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{BermanMR19,
  author    = {Piotr Berman and
               Meiram Murzabulatov and
               Sofya Raskhodnikova},
  title     = {The Power and Limitations of Uniform Samples in Testing Properties
               of Figures},
  journal   = {Algorithmica},
  volume    = {81},
  number    = {3},
  pages     = {1247--1266},
  year      = {2019},
  url       = {https://doi.org/10.1007/s00453-018-0467-9},
  doi       = {10.1007/s00453-018-0467-9},
  timestamp = {Fri, 12 Apr 2019 09:24:09 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/BermanMR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@Article{HW07,
  title =	"The Randomized Communication Complexity of Set
		 Disjointness",
  author =	"Johan H{\aa}stad and Avi Wigderson",
  journal =	"Theory of Computing",
  year = 	"2007",
  number =	"1",
  volume =	"3",
  bibdate =	"2009-02-17",
  bibsource =	"DBLP,
		 http://dblp.uni-trier.de/db/journals/toc/toc3.html#HastadW07",
  pages =	"211--219",
  URL =  	"http://dx.doi.org/10.4086/toc.2007.v003a011",
}

@incollection{BMW11,
  author={Brody, Joshua and Matulef, Kevin and Wu, Chenggang},
  title={Lower Bounds for Testing Computability by Small Width {OBDD}s},
  year={2011},
  booktitle={Theory and Applications of Models of Computation},
  volume={6648},
  series={LNCS},
  editor={Ogihara, Mitsunori and Tarui, Jun},
    publisher={Springer},
  pages={320-331}
}

@article{BBM12,
  author    = {Eric Blais and
               Joshua Brody and
               Kevin Matulef},
  title     = {Property Testing Lower Bounds via Communication Complexity},
  journal   = {Comput. Complex.},
  volume    = {21},
  number    = {2},
  pages     = {311--358},
  year      = {2012},
  url       = {https://doi.org/10.1007/s00037-012-0040-x},
  doi       = {10.1007/s00037-012-0040-x},
  timestamp = {Sun, 15 Mar 2020 19:46:53 +0100},
  biburl    = {https://dblp.org/rec/journals/cc/BlaisBM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{BuhrmanGMW13,
  author    = {Harry Buhrman and
               David Garc{\'{\i}}a{-}Soriano and
               Arie Matsliah and
               Ronald de Wolf},
  title     = {The non-adaptive query complexity of testing $k$-parities},
  journal   = {Chic. J. Theor. Comput. Sci.},
  volume    = {2013},
  year      = {2013},
  url       = {http://cjtcs.cs.uchicago.edu/articles/2013/6/contents.html},
  timestamp = {Wed, 22 Jul 2020 22:05:15 +0200},
  biburl    = {https://dblp.org/rec/journals/cjtcs/BuhrmanGMW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}