Property testing and its connection to learning and approximation O Goldreich, S Goldwasser, D Ron Journal of the ACM (JACM) 45 (4), 653-750, 1998 | 1351 | 1998 |
The power of amnesia: Learning probabilistic automata with variable memory length D Ron, Y Singer, N Tishby Machine learning 25, 117-149, 1996 | 740 | 1996 |
Algorithmic stability and sanity-check bounds for leave-one-out cross-validation M Kearns, D Ron Proceedings of the tenth annual conference on Computational learning theory …, 1997 | 684 | 1997 |
Property testing in bounded degree graphs O Goldreich, D Ron Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 524 | 1997 |
On the learnability of discrete distributions M Kearns, Y Mansour, D Ron, R Rubinfeld, RE Schapire, L Sellie Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994 | 353 | 1994 |
On testing expansion in bounded-degree graphs O Goldreich, D Ron Studies in Complexity and Cryptography. Miscellanea on the Interplay between …, 2011 | 344 | 2011 |
The power of a pebble: Exploring and mapping directed graphs MA Bender, A Fernández, D Ron, A Sahai, S Vadhan Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 327 | 1998 |
Testing monotonicity O Goldreich, S Goldwassert, E Lehman, D Ron Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998 | 300 | 1998 |
An experimental and theoretical comparison of model selection methods M Kearns, Y Mansour, AY Ng, D Ron Proceedings of the Eighth Annual Conference on Computational Learning Theory …, 1995 | 281 | 1995 |
Chinese remaindering with errors O Goldreich, D Ron, M Sudan Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 280 | 1999 |
Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks G Even, Z Lotker, D Ron, S Smorodinsky SIAM Journal on Computing 33 (1), 94-136, 2003 | 264 | 2003 |
Property testing D Ron COMBINATORIAL OPTIMIZATION-DORDRECHT- 9 (2), 597-643, 2001 | 257 | 2001 |
On the learnability and usage of acyclic probabilistic finite automata D Ron, Y Singer, N Tishby Proceedings of the eighth annual conference on Computational learning theory …, 1995 | 241 | 1995 |
Tolerant property testing and distance approximation M Parnas, D Ron, R Rubinfeld Journal of Computer and System Sciences 72 (6), 1012-1042, 2006 | 240 | 2006 |
Improved testing algorithms for monotonicity Y Dodis, O Goldreich, E Lehman, S Raskhodnikova, D Ron, ... International Workshop on Randomization and Approximation Techniques in …, 1999 | 222 | 1999 |
Algorithmic and analysis techniques in property testing D Ron Foundations and Trends® in Theoretical Computer Science 5 (2), 73-205, 2010 | 214 | 2010 |
A sublinear bipartiteness tester for bounded degree graphs O Goldreich, D Ron Proceedings of the thirtieth annual ACM Symposium on Theory of Computing …, 1998 | 210 | 1998 |
On randomized one-round communication complexity I Kremer, N Nisan, D Ron Computational Complexity 8, 21-49, 1999 | 205 | 1999 |
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms M Parnas, D Ron Theoretical Computer Science 381 (1-3), 183-196, 2007 | 202 | 2007 |
Testing juntas E Fischer, G Kindler, D Ron, S Safra, A Samorodnitsky Journal of Computer and System Sciences 68 (4), 753-787, 2004 | 175 | 2004 |