[1] J., Acharya, H., Das, A., Orlitsky, and A. T., Suresh. A unified maximum likelihood approach for optimal distribution property estimation. ECCC, TR16-186, 2016.

[2] J., Acharya, C., Daskalakis, and G., Kamath. Optimal testing for properties of distributions. arXiv:1507.05952 [cs.DS], 2015.

[3] J., Acharya, A., Orlitsky, and S., Pan. The maximum likelihood probability of uniquesingleton, ternary, and length-7 patterns. In IEEE Symposium on Information Theory, pp. 1135–1139, 2009.Google Scholar

[4] L. M., Adleman. A subexponential algorithm for the discrete logarithm problem with applications to cryptography, In 20th IEEE Symposium on Foundations of Computer Science, pp. 55–60, 1979.Google Scholar

[5] N., Ailon. B., Chazelle, S., Comandur, and D., Liu. Property-preserving data reconstruction. Algorithmica, Vol. 51 (2), pp. 160–182, 2008.Google Scholar

[6] N., Alon. Testing subgraphs of large graphs. Random Structures and Algorithms, Vol. 21, pp. 359–370, 2002.Google Scholar

[7] N., Alon, S., Dar, M., Parnas, and D., Ron. Testing of clustering. SIAM Journal on Discrete Mathematics, Vol. 16 (3), pp. 393–417, 2003.Google Scholar

[8] N., Alon, E., Fischer, M., Krivelevich and M., Szegedy. Efficient testing of large graphs. Combinatorica, Vol. 20, pp. 451–476, 2000.Google Scholar

[9] N., Alon, E., Fischer, I., Newman, and A., Shapira. A combinatorial characterization of the testable graph properties: It's all about regularity. In 38th ACM Symposium on the Theory of Computing, pp. 251–260, 2006.Google Scholar

[10] N., Alon and J., Fox. Easily testable graph properties. Combinatorics, Probability and Computing, Vol. 24 (4), pp. 646–657, 2015.Google Scholar

[11] N., Alon, T., Kaufman, M., Krivelevich, S., Litsyn, and D., Ron. Testing low-degree polynomials over GF(2). In 7th RANDOM. Lecture Notes in Computer Science, Vol. 2764, Springer, pp. 188–199, 2003.Google Scholar

[12] N., Alon, T., Kaufman, M., Krivelevich, and D., Ron. Testing triangle freeness in general graphs. In 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 279–288, 2006.Google Scholar

[13] N., Alon and M., Krivelevich. Testing k-Colorability. SIAM Journal on Discrete Mathematics, Vol. 15 (2), pp. 211–227, 2002.Google Scholar

[14] N., Alon, M., Krivelevich, I., Newman, and M., Szegedy. Regular languages are testable with a constant number of queries. SIAM Journal on Computing, Vol. 30 (6), pp. 1842–1862, 2001.Google Scholar

[15] N., Alon, Y., Matias, and M., Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Science, Vol. 58 (1), pp. 137–147, 1999. Preliminary version in 28th STOC, 1996.Google Scholar

[16] N., Alon, P. D., Seymour, and R., Thomas. A separator theorem for graphs with an excluded minor and its applications. In 22nd ACM Symposium on the Theory of Computing, pp. 293–299, 1990.Google Scholar

[17] N., Alon and A., Shapira. Testing subgraphs in directed graphs. Journal of Computer and System Science, Vol. 69, pp. 354–482, 2004.Google Scholar

[18] N., Alon and A., Shapira. Every monotone graph property is testable. In 37th ACM Symposium on the Theory of Computing, pp. 128–137, 2005.Google Scholar

[19] N., Alon and A., Shapira. A Characterization of the (natural) graph properties testable with one-sided error. In 46th IEEE Symposium on Foundations of Computer Science, pp. 429–438, 2005.Google Scholar

[20] N., Alon and A., Shapira. A characterization of easily testable induced subgraphs. Combinatorics Probability and Computing, Vol. 15, pp. 791–805, 2006.Google Scholar

[21] N., Alon and A., Shapira. A separation theorem in property testing. Combinatorica, Vol. 28 (3), pp. 261–281, 2008.Google Scholar

[22] N., Alon and J. H., Spencer. The Probabilistic Method. John Wiley ' Sons, 1992. Third edition, 2008.Google Scholar

[23] S., Arora. Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, UC Berkeley, 1994.Google Scholar

[24] S., Arora, C., Lund, R., Motwani, M., Sudan and M., Szegedy. Proof verification and intractability of approximation problems. Journal of the ACM, Vol. 45, pp. 501–555, 1998. Preliminary version in 33rd FOCS, 1992.Google Scholar

[25] S., Arora and S., Safra. Probabilistic checkable proofs: A new characterization of NP. Journal of the ACM, Vol. 45, pp. 70–122, 1998. Preliminary version in 33rd FOCS, 1992.Google Scholar

[26] S., Arora and M., Sudan. Improved low-degree testing and its applications. Combinatorica, Vol. 23 (3), pp. 365–426, 2003. Preliminary version in 29th STOC, 1997.Google Scholar

[27] L., Avigad and O., Goldreich. Testing graph blow-up. In Studies in complexity and cryptography, Springer, pp. 156–172, 2011.Google Scholar

[28] L., Babai, L., Fortnow, L., Levin, and M., Szegedy. Checking computations in polylogarithmic time. In 23rd ACM Symposium on the Theory of Computing, pp. 21–31, 1991.Google Scholar

[29] L., Babai, L., Fortnow, and C., Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, Vol. 1, No. 1, pp. 3–40, 1991. Preliminary version in 31st FOCS, 1990.Google Scholar

[30] M., Balcan, E., Blais, A., Blum, and L., Yang. Active property testing. In 53rd IEEE Symposium on Foundations of Computer Science, pp. 21–30, 2012.Google Scholar

[31] B., Barak. How to go beyond the black-box simulation barrier. In 42nd IEEE Symposium on Foundations of Computer Science, pp. 106–115, 2001.Google Scholar

[32] T., Batu, S., Dasgupta, R., Kumar, and R., Rubinfeld. The complexity of approximating the entropy. SIAM Journal on Computing, Vol. 35 (1), pp. 132–150, 2005.Google Scholar

[33] T., Batu, F., Ergun, J., Kilian, A., Magen, S., Raskhodnikova, R., Rubinfeld, and R., Sami. A sublinear algorithm for weakly approximating edit distance. In 35th ACM Symposium on the Theory of Computing, pp. 316–324, 2003.Google Scholar

[34] T., Batu, E., Fischer, L., Fortnow, R., Kumar, R., Rubinfeld, and P., White. Testing random variables for independence and identity. In 42nd IEEE Symposium on Foundations of Computer Science, pp. 442–451, 2001.Google Scholar

[35] T., Batu, L., Fortnow, R., Rubinfeld, W. D., Smith, P., White. Testing that distributions are close. In 41st IEEE Symposium on Foundations of Computer Science, pp. 259–269, 2000.Google Scholar

[36] M., Bellare, D., Coppersmith, J., Hastad, M.A., Kiwi, and M., Sudan. Linearity testing in characteristic two. IEEE Transactions on Information Theory, Vol. 42 (6), pp. 1781–1795, 1996.Google Scholar

[37] M., Bellare, O., Goldreich and M., Sudan. Free bits, PCPs and non-approximability –towards tight results. SIAM Journal on Computing, Vol. 27, No. 3, pp. 804–915, 1998. Extended abstract in 36th FOCS, 1995.Google Scholar

[38] M., Bellare, S., Goldwasser, C., Lund and A., Russell. Efficient probabilistically checkable proofs and applications to approximation. In 25th ACM Symposium on the Theory of Computing, pp. 294–304, 1993.Google Scholar

[39] A., Belovs and E., Blais. A polynomial lower bound for testing monotonicity. In 48th ACM Symposium on the Theory of Computing, pp. 1012–1032, 2016.Google Scholar

[40] M., Bender and D., Ron. Testing acyclicity of directed graphs in sublinear time. Random Structures and Algorithms, pp. 184–205, 2002.Google Scholar

[41] I., Benjamini, O., Schramm, and A., Shapira. Every minor-closed property of sparse graphs is testable. In 40th ACM Symposium on the Theory of Computing, pp. 393–402, 2008.Google Scholar

[42] I., Ben-Eliezer, T., Kaufman, M., Krivelevich, and D., Ron. Comparing the strength of query types in property testing: The case of testing k-Colorability. In 19th ACM-SIAM Symposium on Discrete Algorithms, pp. 1213–1222, 2008.Google Scholar

[43] M., Ben-Or, S., Goldwasser, J., Kilian and A., Wigderson. Multi-prover interactive proofs: How to remove intractability. In 20th ACM Symposium on the Theory of Computing, pp. 113–131, 1988.Google Scholar

[44] E., Ben-Sasson, O., Goldreich, P., Harsha, M., Sudan, and S., Vadhan. Robust PCPs of proximity, shorter PCPs, and applications to coding. SIAM Journal on Computing, Vol. 36 (4), pp. 889–974, 2006. Extended abstract in 36th STOC, 2004.Google Scholar

[45] E., Ben-Sasson, O., Goldreich, P., Harsha, M., Sudan and S., Vadhan. Short PCPs verifiable in polylogarithmic time. In 20th IEEE Conference on Computational Complexity, pp. 120–134, 2005.Google Scholar

[46] E., Ben-Sasson, O., Goldreich and M., Sudan. Bounds on 2-query codeword testing. In 7th RANDOM, Lecture Notes in Computer Science, Vol. 2764, Springer, pp. 216–227, 2003.Google Scholar

[47] E., Ben-Sasson, P., Harsha, and S., Raskhodnikova. 3CNF properties are hard to test. SIAM Journal on Computing, Vol. 35 (1), pp. 1–21, 2005.Google Scholar

[48] E., Ben-Sasson and M., Sudan. Short PCPs with polylog query complexity. SIAM Journal on Computing, Vol. 38 (2), pp. 551–607, 2008. Preliminary version in 37th STOC, 2005.Google Scholar

[49] E., Ben-Sasson, M., Sudan, S., Vadhan, and A., Wigderson. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In 35th ACM Symposium on the Theory of Computing, June 2003, pp. 612–621.Google Scholar

[50] P., Berman, S., Raskhodnikova, and G., Yaroslavtsev. Lp-testing. In 46th ACM Symposium on the Theory of Computing, pp. 164–173, 2014.Google Scholar

[51] A., Bhattacharyya, S., Kopparty, G., Schoenebeck, M., Sudan, and D., Zuckerman. Optimal testing of Reed–Muller codes. In IEEE Symposium on Foundations of Computer Science, pp. 488–497, 2010.Google Scholar

[52] E., Blais. Testing juntas almost optimally. In ACM Symposium on the Theory of Computing, pp. 151–158, 2009.Google Scholar

[53] E., Blais. Testing juntas: A brief survey. In [134].

[54] E., Blais, J., Brody, and K., Matulef. Property testing lower bounds via communication complexity. Computational Complexity, Vol. 21 (2), pp. 311–358, 2012. Extended abstract in 26th CCC, 2011.Google Scholar

[55] E., Blais, C., Canonne, T., Gur. Alice and Bob show distribution testing lower bounds (They don't talk to each other anymore). ECCC, TR016-168, 2016.

[56] A., Bhattacharyya and Y., Yoshida. Property testing. Forthcoming.

[57] E., Blais and Y., Yoshida. A characterization of constant-sample testable properties. ECCC, TR016-201, 2016.

[58] M., Blum and S., Kannan. Designing programs that check their work. In 21st ACM Symposium on the Theory of Computing, pp. 86–97, 1989.Google Scholar

[59] M., Blum, M., Luby and R., Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Science, Vol. 47, No. 3, pp. 549–595, 1993. Extended abstract 22nd STOC, 1990.

[60] A., Bogdanov and F., Li. A better tester for bipartiteness? arXiv:1011.0531 [cs.DS], 2010.

[61] A., Bogdanov, K., Obata, and L., Trevisan. A lower bound for testing 3-Colorability in bounded-degree graphs. In 43rd IEEE Symposium on Foundations of Computer Science, pp. 93–102, 2002.Google Scholar

[62] A., Bogdanov and L., Trevisan. Lower bounds for testing bipartiteness in dense graphs. In 19th IEEE Conference on Computational Complexity, pp. 75–81, 2004.Google Scholar

[63] B., Bollobas, P., Erdos, M., Simonovits, and E., Szemeredi. Extremal graphs without large forbidden subgraphs. Annals of Discrete Mathematics, Vol. 3, pp. 29–41, 1978.Google Scholar

[64] C., Borgs, J., Chayes, L., Lovász, V.T., Sós, B., Szegedy, and K., Vesztergombi. Graph limits and parameter testing. In 38th ACM Symposium on the Theory of Computing, pp. 261–270, 2006.Google Scholar

[65] J., Briet, S., Chakraborty, D., Garcia-Soriano, and A., Matsliah. Monotonicity testing and shortest-path routing on the cube. Combinatorica, Vol. 32 (1), pp. 35–53, 2012.Google Scholar

[66] R., Canetti, G., Even and O., Goldreich. Lower bounds for sampling algorithms for estimating the average. Information Processing Letters, Vol. 53, pp. 17–25, 1995.Google Scholar

[67] R., Canetti, O., Goldreich, S., and Halevi. The random oracle methodology, revisited. In 30th ACM Symposium on the Theory of Computing, May 1998, pp. 209–218.

[68] C. L., Canonne. A survey on distribution testing: your data is big. But is it blue? ECCC, TR015-063, 2015.

[69] C.L., Canonne, T., Gouleakis, and R., Rubinfeld. Sampling Correctors. In 7th Innovations in Theoretical Computer Science, pp. 93–102, 2016.Google Scholar

[70] C.L., Canonne, D., Ron, and R., Servedio. Testing probability distributions using conditional samples. SIAM Journal on Computing, Vol. 44 (3), pp. 540–616, 2015.Google Scholar

[71] D., Chakrabarty and C., Seshadhri. A o(n) monotonicity tester for Boolean functions over the hypercube. In 45th ACM Symposium on the Theory of Computing, pp. 411–418, 2013.Google Scholar

[72] D., Chakrabarty and C., Seshadhri. Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids. In 45th ACM Symposium on the Theory of Computing, pp. 419–428, 2013.Google Scholar

[73] S., Chan, I., Diakonikolas, P., Valiant, and G., Valiant. Optimal algorithms for testing closeness of discrete distributions. In 25th ACM-SIAM Symposium on Discrete Algorithms, pp. 1193–1203, 2014.Google Scholar

[74] B., Chazelle, R., Rubinfeld, and L., Trevisan. Approximating the minimum spanning tree weight in sublinear time. In 19th International Colloquium on Automata, Languages and Programming, pp. 190–200, 2001.Google Scholar

[75] X., Chen, A. De, R.A. Servedio, and L., Tan. Boolean function monotonicity testing requires (almost) n1/2 non-adaptive queries. In 47th ACM Symposium on the Theory of Computing, pp. 519–528, 2015.Google Scholar

[76] X., Chen, R.A., Servedio, and L., Tan. New algorithms and lower bounds for monotonicity testing. In 55th IEEE Symposium on Foundations of Computer Science, pp. 286–295, 2014.Google Scholar

[77] D., Cheng, R., Kannan, S., Vempala, and G., Wang. A divide-and-merge methodology for clustering. In 24th Symposium on Principles of Database Systems, pp. 196–205, 2005.Google Scholar

[78] B., Chor and O., Goldreich. On the power of two–point based sampling. Journal of Complexity, Vol 5, pp. 96–106, 1989.Google Scholar

[79] B., Chor, O., Goldreich, E., Kushilevitz and M., Sudan. Private information retrieval. Journal of the ACM, Vol. 45, No. 6, pp. 965–982, 1998.Google Scholar

[80] G., Cormode and S., Muthukrishnan. Combinatorial algorithms for compressed sensing. In 40th Annual Conference on Information Sciences and Systems, pp. 198–201, 2006.Google Scholar

[81] A., Czumaj, O., Goldreich, D., Ron, C., Seshadhri, A., Shapira, and C., Sohler. Finding cycles and trees in sublinear time. Random Structures and Algorithms, Vol. 45 (2), pp. 139–184, 2014.Google Scholar

[82] A., Czumaj, M., Monemizadeh, K., Onak, and C., Sohler. Planar graphs: Random walks and bipartiteness testing. In 52nd IEEE Symposium on Foundations of Computer Science, pp. 423–432, 2011.Google Scholar

[83] A., Czumaj, P., Peng, and C., Sohler. Relating two property testing models for bounded degree directed graphs. In 48th ACM Symposium on the Theory of Computing, pp. 1033–1045, 2016.Google Scholar

[84] C., Daskalakis, I., Diakonikolas, and R. A., Servedio. Learning k-modal distributions via testing. Theory of Computing, Vol. 10, pp. 535–570, 2014.Google Scholar

[85] R., David, I., Dinur, E., Goldenberg, G., Kindler, and I., Shinkar. Direct sum testing. In 6th Innovations in Theoretical Computer Science, pp. 327–336, 2015.Google Scholar

[86] R. A., DeMillo.and R. J., Lipton. A probabilistic remark on algebraic program testing. Information Processing Letters, Vol. 7 (4), pp. 193–195, June 1978.

[87] L., Devroye. The equivalence of weak, strong and complete convergence in L1 for kernel density estimates. Annals of Statistics, Vol. 11 (3), pp. 896–904, 1983.Google Scholar

[88] I., Diakonikolas, T., Gouleakis, J., Peebles, and E., Price. Collision-based testers are optimal for uniformity and closeness. ECCC, TR16-178, 2016.

[89] I., Diakonikolas and D., Kane. A new approach for testing properties of discrete distributions. In 57th IEEE Symposium on Foundations of Computer Science, pp. 685–694, 2016.Google Scholar

[90] I., Diakonikolas, D., Kane, V., Nikishkin. Testing identity of structured distributions. In 26th ACM-SIAM Symposium on Discrete Algorithms, pp. 1841–1854, 2015.Google Scholar

[91] I., Diakonikolas, H.K., Lee, K., Matulef, K., Onak, R., Rubinfeld, R.A., Servedio, and A., Wan. Testing for concise representations. In 48th IEEE Symposium on Foundations of Computer Science, pp. 549–557, 2007.Google Scholar

[92] I., Dinur. The PCP Theorem by gap amplification. Journal of the ACM, Vol. 54 (3), Art. 12, 2007. Extended abstract in 38th STOC, 2006.Google Scholar

[93] I., Dinur and P., Harsha. Composition of low-error 2-query PCPs using decodable PCPs. SIAM Journal on Computing, Vol. 42 (6), pp. 2452–2486, 2013. Extended abstract in 50th FOCS, 2009.Google Scholar

[94] I., Dinur and O., Reingold. Assignment-testers: Towards a combinatorial proof of the PCPTheorem. SIAM Journal on Computing, Vol. 36 (4), pp. 975–1024, 2006. Extended abstract in 45th FOCS, 2004.Google Scholar

[95] I., Dinur and S., Safra. The importance of being biased. In 34th ACM Symposium on the Theory of Computing, pp. 33–42, 2002.Google Scholar

[96] Y., Dodis, O., Goldreich, E., Lehman, S., Raskhodnikova, D., Ron, and A., Samorodnitsky. Improved testing algorithms for monotonicity. ECCC, TR99-017, 1999. Extended abstract in 3rd RANDOM, 1999.

[97] E., Dolev and D., Ron. Distribution-free testing for monomials with a sublinear number of queries. Theory of Computing, Vol. 7 (1), pp. 155–176, 2011.Google Scholar

[98] P., Drineas, A., Frieze, R., Kannan, S., Vempala, V., Vinay. Clustering in large graphs and matrices. In 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 291–299, 1999.Google Scholar

[99] T., Eden, D., Ron, and C., Seshadhri. Sublinear time estimation of degree distribution moments: The arboricity connection. arXiv:1604.03661 [cs.DS], 2016.

[100] K., Efremenko. 3-query locally decodable codes of subexponential length. In 41st ACM Symposium on the Theory of Computing, pp. 39–44, 2009.Google Scholar

[101] F., Ergun, S., Kannan, R., Kumar, R., Rubinfeld, and M., Viswanathan. Spot Checkers. Journal of Computer and System Science, Vol. 60, pp. 717–751, 2000. Extended abstract in 30th STOC, 1998.Google Scholar

[102] F., Ergün, R., Kumar, and R., Rubinfeld. Fast approximate PCPs. In 31st ACM Symposium on the Theory of Computing, pp. 41–50, 1999.Google Scholar

[103] G., Even, M., Medina, and D., Ron. Best of two local models: Local centralized and local distributed algorithms. CoRR abs/1402.3796, 2014.

[104] S., Even. Graph Algorithms. Computer Science Press, 1979. Second edition (edited by G., Even), Cambridge University Press, 2011.Google Scholar

[105] S., Even, A.L., Selman, and Y., Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control, Vol. 61, pp. 159–173, 1984.Google Scholar

[106] U., Feige. On sums of independent random variables with unbounded variance, and estimating the average degree in a graph. SIAM Journal on Computing, Vol. 35 (4), pp. 964–984, 2006.Google Scholar

[107] U., Feige, S., Goldwasser, L., Lovász, S., Safra, and M., Szegedy. Approximating clique is almost NP-complete. Journal of the ACM, Vol. 43, pp. 268–292, 1996. Preliminary version in 32nd FOCS, 1991.Google Scholar

[108] E., Fischer. On the strength of comparisons in property testing. Information and Computation, Vol. 189 (1), pp. 107–116, 2004.Google Scholar

[109] E., Fischer and L., Fortnow. Tolerant versus intolerant testing for Boolean properties. Theory of Computing, Vol. 2 (9), pp. 173–183, 2006.Google Scholar

[110] E., Fischer, Y., Goldhirsh, and O., Lachish. Partial tests, universal tests and decomposability. In 5th Innovations in Theoretical Computer Science, pp. 483–500, 2014. Full version posted on ECCC, TR13-082, 2013.Google Scholar

[111] E., Fischer, G., Kindler, D., Ron, S., Safra and A., Samorodnitsky. Testing juntas. Journal of Computer and System Science, Vol. 68 (4), pp. 753–787, 2004. Extended abstract in 44th FOCS, 2002.Google Scholar

[112] E., Fischer, O., Lachish, and Y., Vasudev. Trading query complexity for sample-based testing and multi-testing scalability. In 56th IEEE Symposium on Foundations of Computer Science, pp. 1163–1182, 2015.Google Scholar

[113] E., Fischer, E., Lehman, I., Newman, S., Raskhodnikova, R., Rubinfeld, and A., Samorodnitsky. Monotonicity testing over general poset domains. In 34th ACM Symposium on the Theory of Computing, pp. 474–483, 2002.Google Scholar

[114] E., Fischer and A., Matsliah. Testing graph isomorphism. In 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 299–308, 2006.Google Scholar

[115] E., Fischer, A., Matsliah, and A., Shapira. Approximate hypergraph partitioning and applications. In 48th IEEE Symposium on Foundations of Computer Science, pp. 579–589, 2007.Google Scholar

[116] E., Fischer and I., Newman. Testing versus estimation of graph properties. In 37th ACM Symposium on the Theory of Computing, pp. 138–146, 2005.Google Scholar

[117] G. D., Forney. Concatenated Codes. MIT Press, 1966.Google Scholar

[118] L., Fortnow, J., Rompel, and M., Sipser. On the power of multi-prover interactive protocols. Theoretical Computer Science, Vol. 134 (2), pp. 545–557, 1994. Extended abstract in 3rd IEEE Symp. on Structural Complexity, 1988.Google Scholar

[119] J., Fox. A new proof of the graph removal lemma. Annals of Mathematics, Vol. 174 (1), pp. 561–579, 2011.Google Scholar

[120] K., Friedl and M., Sudan. Some improvements to total degree tests. In 3rd Israel Symposium on Theory of Computing and Systems, pp. 190–198, 1995. Revision posted on CoRR, 1307.3975, 2013.Google Scholar

[121] A., Frieze and R., Kannan. The regularity lemma and approximation schemes for dense problems. In 37th IEEE Symposium on Foundations of Computer Science, pp. 12–20, 1996.Google Scholar

[122] A., Frieze and R., Kannan. Quick approximation to matrices and applications. Combinatorica, Vol. 19 (2), pp. 175–220, 1999.Google Scholar

[123] A., Frieze, R., Kannan, and S., Vempala. Fast Monte-Carlo algorithms for finding low-rank approximations. Journal of the ACM, Vol. 51 (6), pp. 1025–1041, 2004. Extended abstract in 39th FOCS, 1998.Google Scholar

[124] P., Gemmell, R.J., Lipton, R., Rubinfeld, M., Sudan. and A.Wigderson. Self-testing/correcting for polynomials and for approximate functions. In 23rd Symposium on the Theory of Computing, pp. 32–42, 1991.Google Scholar

[125] L., Gishboliner and A., Shapira. Removal Lemmas with Polynomial Bounds. arXiv: 1611.10315 [math.CO], 2016.

[126] D., Glasner and R. A., Servedio. Distribution-free testing lower bound for basic Boolean functions. Theory of Computing, Vol. 5 (1), pp. 191–216, 2009.Google Scholar

[127] O., Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics, Vol. 17, Springer, 1998.

[128] O., Goldreich. Foundation of cryptography –Basic tools. Cambridge University Press, 2001.Google Scholar

[129] O., Goldreich. On Promise Problems: In memory of Shimon Even (1935–2004). ECCC, TR05-018, 2005. See also in Theoretical Computer Science: Essays in memory of Shimon Even, Lecture Notes in Computer Science, Festschrift, Vol. 3895, Springer, 2006.

[130] O., Goldreich. Short locally testable codes and proofs (survey). ECCC Technical Report TR05-014, 2005.

[131] O., Goldreich. Computational Complexity: A Conceptual Perspective. Cambridge University Press, 2008.Google Scholar

[132] O., Goldreich. Short locally testable codes and proofs: A survey in two parts. In [134].

[133] O., Goldreich. Introduction to testing graph properties. In [134].

[134] O., Goldreich (ed.). Property Testing: Current Research and Surveys. Lecture Notes in Computer Science, Vol. 6390, Springer, 2010.

[135] O., Goldreich. On multiple input problems in property testing. In 18th RANDOM, pp. 704–720, 2014.Google Scholar

[136] O., Goldreich. On the communication complexity methodology for proving lower bounds on the query complexity of property testing. ECCC, TR13-073, 2013.

[137] O., Goldreich. The uniform distribution is complete with respect to testing identity to a fixed distribution. ECCC, TR16-015, 2016.

[138] O., Goldreich. Reducing testing affine subspaces to testing linearity. ECCC, TR16-080, 2016.

[139] O., Goldreich, S., Goldwasser, E., Lehman, D., Ron, and A., Samorodnitsky. Testing monotonicity. Combinatorica, Vol. 20 (3), pp. 301–337, 2000. Extended abstract in 39th FOCS, 1998.Google Scholar

[140] O., Goldreich, S., Goldwasser, and D., Ron. Property testing and its connection to learning and approximation. Journal of the ACM, pp. 653–750, 1998. Extended abstract in 37th FOCS, 1996.Google Scholar

[141] O., Goldreich, T., Gur, and I., Komargodski. Strong locally testable codes with relaxed local decoders. In 30th IEEE Conference on Computational Complexity, pp. 1–41, 2015.Google Scholar

[142] O., Goldreich, T., Gur, and R., Rothblum. Proofs of proximity for context-free languages and read-once branching programs. In 42nd International Colloquium on Automata, Languages and Programming, pp. 666–677, 2015.Google Scholar

[143] O., Goldreich and T., Kaufman. Proximity oblivious testing and the role of invariances. In 15th RANDOM, pp. 579–592, 2011.Google Scholar

[144] O., Goldreich, M., Krivelevich, I., Newman, and E., Rozenberg. Hierarchy theorems for property testing. Computational Complexity, Vol. 21 (1), pp. 129–192, 2012.Google Scholar

[145] O., Goldreich and L. A., Levin. A hard-core predicate for all one-way functions. In 21st ACM Symposium on the Theory of Computing, pp. 25–32, 1989.Google Scholar

[146] O., Goldreich, S., Micali and A., Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, Vol. 38, No. 3, pp. 691–729, 1991. Preliminary version in 27th FOCS, 1986.

[147] O., Goldreich and D., Ron. Property testing in bounded degree graphs. Algorithmica, pp. 302–343, 2002. Extended abstract in 29th STOC, 1997.Google Scholar

[148] O., Goldreich and D., Ron. A sublinear bipartite tester for bounded degree graphs. Combinatorica, Vol. 19 (3), pp. 335–373, 1999. Extended abstract in 30th STOC, 1998.Google Scholar

[149] O., Goldreich and D., Ron. On testing expansion in bounded-degree graphs. ECCC, TR00-020, 2000.

[150] O., Goldreich and D., Ron. Approximating average parameters of graphs. Random Structures and Algorithms, Vol. 32 (3), pp. 473–493, 2008.Google Scholar

[151] O., Goldreich and D., Ron. Algorithmic aspects of property testing in the dense graphs model. SIAM Journal on Computing, Vol. 40, No. 2, pp. 376–445, 2011.

[152] O., Goldreich and D., Ron. On proximity oblivious testing. SIAM Journal on Computing, Vol. 40, No. 2, pp. 534–566, 2011. Extended abstract in 41st STOC, 2009.

[153] O., Goldreich and D., Ron. On sample-based testers. In 6th Innovations in Theoretical Computer Science, pp. 337–345, 2015.Google Scholar

[154] O., Goldreich and D., Ron. On the relation between the relative earth mover distance and the variation distance (an exposition). Available from http://www.wisdom.weizmann.ac.il/∼oded/p_remd.html

[155] O., Goldreich and O., Sheffet. On the randomness complexity of property testing. Computational Complexity, Vol. 19 (1), pp. 99–133, 2010.Google Scholar

[156] O., Goldreich and I., Shinkar. Two-sided error proximity oblivious testing. ECCC, TR12-021, 2012. (See Revision 4, 2014.)

[157] O., Goldreich and M., Sudan. Locally testable codes and PCPs of almost-linear length. Journal of the ACM, Vol. 53 (4), pp. 558–655, 2006. Extended abstract in 43rd FOCS, 2002.Google Scholar

[158] O., Goldreich and L., Trevisan. Three theorems regarding testing graph properties. Random Structures and Algorithms, Vol. 23 (1), pp. 23–57, August 2003.Google Scholar

[159] O., Goldreich, S., Vadhan, and A., Wigderson. On interactive proofs with a laconic prover. Computational Complexity, Vol. 11 (1–2), pp. 1–53, 2002.Google Scholar

[160] S., Goldwasser and S., Micali. Probabilistic encryption. Journal of Computer and System Science, Vol. 28, No. 2, pp. 270–299, 1984. Preliminary version in 14th STOC, 1982.Google Scholar

[161] S., Goldwasser, S., Micali and C., Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, Vol. 18, pp. 186–208, 1989. Preliminary version in 17th STOC, 1985. Earlier versions date to 1982.Google Scholar

[162] M., Gonen and D., Ron. On the benefit of adaptivity in property testing of dense graphs. Algorithmica (special issue for RANDOM and APPROX 2007), Vol. 58 (4), pp. 811–830, 2010.

[163] M., Gonen, D., Ron, U., Weinsberg, and A., Wool. Finding a dense-core in Jellyfish graphs. Computer Networks, Vol. 52 (15), pp. 2831–2841, 2008. Preliminary version in 5th International Workshop on Algorithms and Models for the Web-Graph.Google Scholar

[164] T., Gowers. Lower bounds of tower type for Szemeredi's uniformity lemma. GAFA, Vol. 7, pp. 322–337, 1997.Google Scholar

[165] A., Guo, E., Haramaty, and M., Sudan. Robust testing of lifted codes with applications to low-degree testing. ECCC, TR15-043, 2015.

[166] T., Gur and R., Rothblum. Non-interactive proofs of proximity. ECCC, TR13-078, 2013.

[167] S., Halevy and E., Kushilevitz. Distribution-free property testing. In 7th RANDOM, pp. 341–353, 2003.Google Scholar

[168] E., Haramaty, A., Shpilka, and M., Sudan. Optimal testing of multivariate polynomials over small prime fields. SIAM Journal on Computing, Vol. 42 (2), pp. 536–562, 2013. Preliminary version in 52nd FOCS, 2011.Google Scholar

[169] A., Hassidim, J., Kelner, H., Nguyen, and K., Onak. Local graph partitions for approximation and testing. In 50th IEEE Symposium on Foundations of Computer Science, pp. 22–31, 2009.Google Scholar

[170] J., Hastad. Clique is hard to approximate within n. Acta Mathematica, Vol. 182, pp. 105–142, 1999. Preliminary versions in 28th STOC (1996) and 37th FOCS (1996).

[171] J., Hastad. Getting optimal in-approximability results. Journal of the ACM, Vol. 48, pp. 798–859, 2001. Extended abstract in 29th STOC, 1997.Google Scholar

[172] D., Hochbaum (ed.). Approximation Algorithms for NP-Hard Problems. PWS, 1996.

[173] M., Jha and S., Raskhodnikova. Testing and reconstruction of Lipschitz functions with applications to data privacy. SIAM Journal on Computing, Vol. 42 (2), pp. 700–731, 2013. Extended abstract in 52nd FOCS, 2011.Google Scholar

[174] C. S., Jutla, A. C., Patthak, A., Rudra, and D., Zuckerman. Testing low-degree polynomials over prime fields. Random Structures and Algorithms, Vol. 35 (2), pp. 163–193, 2009. Preliminary version in 45th FOCS, 2004.Google Scholar

[175] S., Kale and C., Seshadhri. Testing expansion in bounded degree graphs. In 35th International Colloquium on Automata, Languages and Programming, pp. 527–538, 2008. (Preliminary version appeared as TR07-076, ECCC, 2007.)Google Scholar

[176] B., Kalyanasundaram and G., Schintger. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics, Vol. 5 (4), pp. 545–557, 1992.Google Scholar

[177] R., Kannan, S., Vempala, and A., Vetta. On clusterings: Good, bad and spectral. Journal of the ACM, Vol. 51 (3), pp. 497–515, 2004. Preliminary version in 41st FOCS, 2000.Google Scholar

[178] D., Karger. Global min-cuts in RNC and other ramifications of a simple mincut algorithm. In 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 21–30, 1993.Google Scholar

[179] J., Katz and L., Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In 32nd ACM Symposium on the Theory of Computing, pp. 80–86, 2000.Google Scholar

[180] T., Kaufman, M., Krivelevich, and D., Ron. Tight bounds for testing bipartiteness in general graphs. SIAM Journal on Computing, Vol. 33 (6), pp. 1441–1483, 2004.Google Scholar

[181] T., Kaufman, S., Litsyn, and N., Xie. Breaking the epsilon-soundness bound of the linearity test over GF(2). SIAM Journal on Computing, Vol. 39 (5), pp. 1988–2003, 2010.Google Scholar

[182] T., Kaufman and D., Ron. Testing polynomials over general fields. SIAM Journal on Computing, 35 (3):779–802, 2006. Preliminary version in 45th FOCS, 2004.

[183] T., Kaufman and M., Sudan. Algebraic property testing: The role of invariance. In 40th ACM Symposium on the Theory of Computing, pp. 4-3–412, 2008.

[184] M. J., Kearns and U. V., Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.Google Scholar

[185] I., Kerenidis and R., de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. Journal of Computer and System Science, Vol. 69 (3), pp. 395–420, 2004. Preliminary version in 35th STOC, 2003.Google Scholar

[186] S., Khot. On the power of unique 2-prover 1-round games. In 34th ACM Symposium on the Theory of Computing, pp. 767–775, 2002.Google Scholar

[187] S., Khot, G., Kindler, E., Mossel, and R., O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM Journal on Computing, Vol. 37 (1), pp. 319–357, 2007. Extended abstract in 44th FOCS, 2004.Google Scholar

[188] S., Khot, D., Minzer, and S., Safra. On monotonicity testing and Boolean Isoperimetric type theorems. ECCC, TR15-011, 2015.

[189] S., Khot and O., Regev. Vertex cover might be hard to approximate to within 2-epsilon. Journal of Computer and System Science, Vol. 74 (3), pp. 335–349, 2008. Extended abstract in 18th CCC, 2003.Google Scholar

[190] J., Kilian. A note on efficient zero-knowledge proofs and arguments. In 24th ACM Symposium on the Theory of Computing, pp. 723–732, 1992.Google Scholar

[191] S., Kopparty, O., Meir, N., Ron-Zewi, and S., Saraf. High rate locally-correctable and locallytestable codes with sub-polynomial query complexity ECCC, TR15-068, 2015.

[192] S., Kopparty, O., Meir, N., Ron-Zewi, and S., Saraf. High-rate locally-testable codes with quasi-polylogarithmic query complexity. ECCC, TR15-110, 2015.

[193] S., Korman, D., Reichman, and G., Tsur. Tight approximation of image matching. CoRR, abs/1111.1713, 2011.

[194] S., Korman, D., Reichman, G., Tsur, and S., Avidan. FAsT-Match: Fast affine template matching. International Journal of Computer Vision, Vol. 121 (1), pp. 111–125, 2017.Google Scholar

[195] E., Kushilevitz and N., Nisan. Communication Complexity. Cambridge University Press, 1997.Google Scholar

[196] D., Lapidot and A., Shamir. Fully parallelized multi prover protocols for NEXP-time. In 32nd IEEE Symposium on Foundations of Computer Science, pp. 13–18, 1991.Google Scholar

[197] R., Levi and D., Ron. A quasi-polynomial time partition oracle for graphs with an excluded minor. ACM Transactions on Algorithms, Vol. 11 (3), pp. 24:1–24:13, 2015.Google Scholar

[198] R., Levi, D., Ron, and R., Rubinfeld. Local algorithms for sparse spanning graphs. In 18th RANDOM, LIPIcs, Vol. 28, Schloss Dagstuhl –Leibniz-Zentrum fuer Informatik, pp. 826–842, 2014.

[199] L. A., Levin. One-way functions and pseudorandom generators. In 17th ACM Symposium on the Theory of Computing, pp. 363–365, 1985.Google Scholar

[200] L., Lovász and N., Young. Lecture notes on evasiveness of graph properties. Technical Report TR–317–91, Princeton University, Computer Science Department, 1991.Google Scholar

[201] A., Lubotzky, R., Phillips, and P., Sarnak. Ramanujan graphs. Combinatorica, Vol. 8, pp. 261–277, 1988.Google Scholar

[202] C., Lund, L., Fortnow, H., Karloff, and N., Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, Vol. 39, No. 4, pp. 859–868, 1992. Extended abstract in 31st FOCS, 1990.Google Scholar

[203] S., Marko and D., Ron. Distance approximation in bounded-degree and general sparse graphs. Transactions on Algorithms, Vol. 5 (2), Art. 22, 2009.Google Scholar

[204] O., Meir. Combinatorial construction of locally testable codes. SIAM Journal on Computing, Vol. 39 (2), pp. 491–544, 2009. Extended abstract in 40th STOC, 2008.Google Scholar

[205] O., Meir. Combinatorial PCPs with efficient verifiers. In 50th IEEE Symposium on Foundations of Computer Science, pp. 463–471, 2009.Google Scholar

[206] R., Merkle. Secrecy, authentication, and public key systems. PhD dissertation, Department of Electrical Engineering, Stanford University 1979.

[207] S., Micali. Computationally sound proofs. SIAM Journal on Computing, Vol. 30 (4), pp. 1253–1298, 2000. Preliminary version in 35th FOCS, 1994.Google Scholar

[208] M., Mihail. Conductance and convergence of Markov chains –A combinatorial treatment of expanders. In 30th IEEE Symposium on Foundations of Computer Science, pp. 526–531, 1989.Google Scholar

[209] N., Mishra, D., Ron, and R., Swaminathan. A new conceptual clustering framework. Machine Learning, Vol. 56 (1–3), pp. 115–151, 2004.Google Scholar

[210] D., Moshkovitz and R., Raz. Two-query PCP with subconstant error. Journal of the ACM, Vol. 57 (5), 2010. Extended abstract in 49th FOCS, 2008.Google Scholar

[211] E., Mossel, R., O'Donnell, and K., Oleszkiewicz. Noise stability of functions with low influences: Invariance and optimality. In 46th IEEE Symposium on Foundations of Computer Science, pp. 21–30, 2005.Google Scholar

[212] R., Motwani and P., Raghavan. Randomized Algorithms. Cambridge University Press, 1995.Google Scholar

[213] S., Muthukrishnan. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science, Vol. 1 (2), pp. 117–236, 2005.Google Scholar

[214] A., Nachmias and A., Shapira. Testing the expansion of a graph. TR07-118, ECCC, 2007.

[215] I., Newman. Testing membership in languages that have small width branching programs. SIAM Journal on Computing, Vol. 31 (5), pp. 1557–1570, 2002.Google Scholar

[216] I., Newman. Property testing of massively parametrized problems –A Survey. In [134].

[217] I., Newman and C., Sohler. Every property of hyperfinite graphs is testable. SIAM Journal on Computing, Vol. 42 (3), pp. 1095–1112, 2013.Google Scholar

[218] K., Onak. New sublinear methods in the struggle against classical problems. PhD thesis, Massachusetts Institute of Technology, 2010.

[219] A., Orlitsky, N., Santhanam, K., Viswanathan, and J., Zhang. On modeling profiles instead of values. In 20th Uncertainity in Artificial Intelligence, pp. 426–435, 2004.Google Scholar

[220] A., Orlitsky, N., Santhanam, and J., Zhang. Always Good Turing: Asymptotically optimal probability estimation. Science, Vol. 302, Nr. 5644, pp. 427–431, 2003.Google Scholar

[221] L., Paninski. A coincidence-based test for uniformity given very sparsely-sampled discrete data. IEEE Transactions on Information Theory, Vol. 54, pp. 4750–4755, 2008.Google Scholar

[222] M., Parnas and D., Ron. Testing the diameter of graphs. Random Structures and Algorithms, Vol. 20 (2), pp. 165–183, 2002.Google Scholar

[223] M., Parnas and D., Ron. Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theoretical Computer Science, Vol. 381 (1–3), pp. 183–196, 2007.Google Scholar

[224] M., Parnas, D., Ron, and R., Rubinfeld. On testing convexity and submodularity. SIAM Journal on Computing, Vol. 32 (5), pp. 1158–1184, 2003.Google Scholar

[225] M., Parnas, D., Ron, and R., Rubinfeld. Tolerant property testing and distance approximation. Journal of Computer and System Science, Vol. 72 (6), pp. 1012–1042, 2006.Google Scholar

[226] M., Parnas, D., Ron, and A., Samorodnitsky. Testing basic Boolean formulae. SIAM Journal on Discrete Mathematics and Algebra, Vol. 16 (1), pp. 20–46, 2002.Google Scholar

[227] L., Pitt and L. G., Valiant. Computational limitations on learning from examples. Journal of the ACM, Vol. 35 (4), pp. 965–984, 1988.Google Scholar

[228] A., Polishchuk and D. A., Spielman. Nearly-linear size holographic proofs. In 26th ACM Symposium on the Theory of Computing, 1994, pp. 194–203.Google Scholar

[229] J., Pollard. Monte Carlo methods for index computations (mod p). Mathematics of Computation, Vol 32, pp. 918–924, 1978.Google Scholar

[230] S., Raskhodnikova. Approximate testing of visual properties. In 7th RANDOM, Lecture Notes in Computer Science, Vol. 2764, pp. 370–381, Springer, 2003.Google Scholar

[231] S., Raskhodnikova. Transitive closure spanners: A survey. In [134].

[232] S., Raskhodnikova, D., Ron, A., Shpilka, and A., Smith. Strong lower bounds for approximating distribution support size and the distinct elements problem. SIAM Journal on Computing, Vol. 39 (3), pp. 813–842, 2009. Extended abstract in 48th FOCS, 2007.Google Scholar

[233] S., Raskhodnikova and A., Smith. A note on adaptivity in testing properties of bounded degree graphs. ECCC, TR06-089, 2006.

[234] R., Raz. A parallel repetition theorem. SIAM Journal on Computing, Vol. 27 (3), pp. 763–803, 1998. Extended abstract in 27th STOC, 1995.

[235] R., Raz and S., Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In 29th ACM Symposium on the Theory of Computing, pp. 475–484, 1997.Google Scholar

[236] O., Reingold, G., Rothblum, R., Rothblum. Constant-round interactive proofs for delegating computation. In 48th ACM Symposium on the Theory of Computing, pp. 49–62, 2016.Google Scholar

[237] N., Robertson and P. D., Seymour. Graph minors. I. Excluding a forest. Journal of Combinatorial Theory, Series B, Vol. 35 (1), pp. 39–61, 1983.Google Scholar

[238] N., Robertson and P. D., Seymour. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B, Vol. 63 (1), pp. 65–110, 1995.Google Scholar

[239] N., Robertson and P. D., Seymour. Graph Minors. XX.Wagner's conjecture. Journal of Combinatorial Theory, Series B, Vol. 92 (1), pp. 325–357, 2004.Google Scholar

[240] V., Rodl and R., Duke. On graphs with small subgraphs of large chromatic number. Graphs and Combinatorics, Vol. 1, pp. 91–96, 1985.Google Scholar

[241] D., Ron. Property testing: A learning theory perspective. Foundations and Trends in Machine Learning, Vol. 1 (3), pp. 307–402, 2008.Google Scholar

[242] D., Ron. Algorithmic and analysis techniques in property testing. Foundations and Trends in Theoretical Computer Science, Vol. 5, pp. 73–205, 2010.Google Scholar

[243] D., Ron and G., Tsur. Testing properties of sparse images. ACM Transactions on Algorithms, Vol. 10 (4), pp. 17:1–17:52, 2014. Extended abstract in 51st FOCS, 2010.

[244] G., Rothblum, S., Vadhan, and A., Wigderson. Interactive proofs of proximity: Delegating computation in sublinear time. In 45th ACM Symposium on the Theory of Computing, pp. 793–802, 2013.Google Scholar

[245] R., Rubinfeld and M., Sudan. Self-testing polynomial functions efficiently and over rational domains. In 3rd ACM-SIAM Symposium on Discrete Algorithms, pp. 23–32, 1992.Google Scholar

[246] R., Rubinfeld and M., Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, Vol. 25 (2), pp. 252–271, 1996. Unifies and extends part of the results contained in [124] and [245].Google Scholar

[247] R., Rubinfeld, G., Tamir, S., Vardi, and M., Xie. Fast local computation algorithms. In 2nd Innovations in (Theoretical) Computer Science, pp. 223–238, 2011.Google Scholar

[248] M., Saks and C., Seshadhri. Local monotonicity reconstruction. SIAM Journal on Computing, Vol. 39 (7), pp. 2897–2926, 2010.Google Scholar

[249] A., Samorodnitsky and L., Trevisan. A PCP characterization of NP with optimal amortized query complexity. In 32nd ACM Symposium on the Theory of Computing, pp. 191–199, 2000.Google Scholar

[250] J. T., Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, Vol. 27 (4), pp. 701–717, October 1980.Google Scholar

[251] R., Servedio. Testing by implicit learning: A brief survey. In [134].

[252] C., Seshadhri, J., Vondrak. Is submodularity testable. Algorithmica, Vol. 69 (1), pp. 1–25, 2014. Extended abstract in 2nd Innovations in (Theoretical) Computer Science, 2011.Google Scholar

[253] A., Shamir. IP = PSPACE. Journal of the ACM, Vol. 39, No. 4, pp. 869–877, 1992. Preliminary version in 31st FOCS, 1990.

[254] A., Shpilka and A., Wigderson. Derandomizing homomorphism testing in general groups. SIAM Journal on Computing, Vol. 36 (4), pp. 1215–1230, 2006.Google Scholar

[255] D., Spielman. Computationally efficient error-correcting codes and holographic proofs. PhD thesis, Massachusetts Institute of Technology, June 1995.

[256] M., Sudan. Efficient checking of polynomials and proofs and the hardness of approximation problems. PhD thesis, Computer Science Division, University of California at Berkeley, 1992. Also appears as Lecture Notes in Computer Science, Vol. 1001, Springer, 1996.

[257] M., Sudan. Invariances in property testing. In [134].

[258] E., Szeméredi. Regular partitions of graphs. In Proceedings Colloque International CNRS, pp. 399–401, 1978.Google Scholar

[259] R., Tell. On being far from far and on dual problems in property testing. ECCC, TR15-072, 2015. (Revision 1, Aug. 2015.)

[260] R., Tell. A note on tolerant testing with one-sided error. ECCC, TR16-032, 2016.

[261] G. J., Valiant. Algorithmic approaches to statistical questions. PhD thesis, University of California at Berkeley, 2012.Google Scholar

[262] L. G., Valiant. A theory of the learnable. Communications of the ACM, Vl. 27 (11), pp. 1134–1142, 1984.Google Scholar

[263] G., Valiant and P., Valiant. Estimating the unseen: An n/log(n)-sample estimator for entropy and support size, shown optimal via new CLTs. In 43rd ACM Symposium on the Theory of Computing, pp. 685–694, 2011. Full version in ECCC, TR10-179 and TR10-180, 2010.Google Scholar

[264] G., Valiant and P., Valiant. Instance-by-instance optimal identity testing. ECCC, TR13-111, 2013.

[265] G., Valiant and P., Valiant. Instance optimal learning of discrete distribution. In 48th ACM Symposium on the Theory of Computing, pp. 142–155, 2016.Google Scholar

[266] P., Valiant. Testing symmetric properties of distributions, PhD thesis, Massachusetts Institute of Technology, 2012.

[267] M., Viderman. Strong LTCs with inverse poly-log rate and constant soundness. In 54th IEEE Symposium on Foundations of Computer Science, pp. 330–339, 2013.Google Scholar

[268] M., Viderman. Explicit strong LTCs with inverse poly-log rate and constant soundness. ECCC, TR15-020, 2015.

[269] J., von Neumann. Various techniques used in connection with random digits. Applied Math Series, Vol. 12, pp. 36–38, 1951. Reprinted in von Neumann's Collected Works, Vol. 5, pp. 768–770, Pergamon, 1963.

[270] D. P., Woodruff. Sketching as a tool for numerical linear algebra. Foundations and Trends in Theoretical Computer Science, Vol. 10 (1–2), pp. 1–157, 2014.

[271] Y., Wu and P., Yang. Chebyshev polynomials, moment matching, and optimal estimation of the unseen. arXiv:1504.01227 [math.ST], 2015.

[272] A. C. C., Yao. Probabilistic complexity: Towards a unified measure of complexity. In 18th IEEE Symposium on Foundations of Computer Science, pp. 222–227, 1977.Google Scholar

[273] A.C.C., Yao. Lower bounds by probabilistic arguments. In 24th IEEE Symposium on Foundations of Computer Science, pp. 420–428, 1983.

[274] S., Yekhanin. Towards 3-query locally decodable codes of subexponential length. In 39th ACM Symposium on the Theory of Computing, pp. 266–274, 2007.Google Scholar

[275] Y., Yoshida and H., Ito. Property testing on k-vertex-connectivity of graphs. Algorithmica, Vol. 62 (3), pp. 701–712, 2012.Google Scholar

[276] R. E., Zippel. Probabilistic algorithms for sparse polynomials. In EUROSAM ‘79: International Symposium on Symbolic and Algebraic Manipulation, E. Ng (Ed.), Lecture Notes in Computer Science, Vol. 72, Springer, pp. 216–226, 1979.