Property testing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Property testing" in English language version.

refsWebsite

Global rank English rank

2^nd place

11^th place

8^th place

4,464^th place

4,468^th place

4,983^rd place

8,002^nd place

207^th place

136^th place

69^th place

59^th place

arxiv.org

Fox, Jacob (2010). "A new proof of the graph removal lemma". arXiv:1006.1300 [math.CO].

Alon, Noga; Shapira, Asaf (2008). "A characterization of the (natural) graph properties testable with one-sided error" (PDF). SIAM Journal on Computing. 37 (6): 1703–1727. doi:10.1137/06064888X.
Goldreich, Oded (1999). "Combinatorial property testing (A survey)". Randomization Methods in Algorithm Design. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 43. pp. 45–59. doi:10.1090/dimacs/043/04. ISBN 0821870874.
Goldreich, Oded; Goldwasser, Shafi; Ron, Dana (1 July 1998). "Property testing and its connection to learning and approximation". Journal of the ACM. 45 (4): 653–750. doi:10.1145/285055.285060.
Rubinfeld, Ronitt; Shapira, Asaf (2011). "Sublinear Time Algorithms". SIAM Journal on Discrete Mathematics. 25 (4): 1562–1588. CiteSeerX 10.1.1.221.1797. doi:10.1137/100791075. S2CID 1319122.
Alon, N.; Duke, R. A.; Lefmann, H.; Rodl, V.; Yuster, R. (1 January 1994). "The Algorithmic Aspects of the Regularity Lemma". Journal of Algorithms. 16 (1): 80–109. doi:10.1006/jagm.1994.1005.
Alon, Noga; Fischer, Eldar; Krivelevich, Michael; Szegedy, Mario (1 April 2000). "Efficient Testing of Large Graphs". Combinatorica. 20 (4): 451–476. doi:10.1007/s004930070001.
Alon, Noga; Shapira, Asaf (22 May 2005). "Every monotone graph property is testable". Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. pp. 128–137. doi:10.1145/1060590.1060611. ISBN 1581139608. S2CID 14096855.

Rubinfeld, Ronitt; Shapira, Asaf (2011). "Sublinear Time Algorithms". SIAM Journal on Discrete Mathematics. 25 (4): 1562–1588. CiteSeerX 10.1.1.221.1797. doi:10.1137/100791075. S2CID 1319122.

Rubinfeld, Ronitt; Shapira, Asaf (2011). "Sublinear Time Algorithms". SIAM Journal on Discrete Mathematics. 25 (4): 1562–1588. CiteSeerX 10.1.1.221.1797. doi:10.1137/100791075. S2CID 1319122.
Alon, Noga; Shapira, Asaf (22 May 2005). "Every monotone graph property is testable". Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. pp. 128–137. doi:10.1145/1060590.1060611. ISBN 1581139608. S2CID 14096855.

Goldreich, Oded (1999). "Combinatorial property testing (A survey)". Randomization Methods in Algorithm Design. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 43. pp. 45–59. doi:10.1090/dimacs/043/04. ISBN 0821870874.