| Tolerant property testing and distance approximation M Parnas, D Ron, R Rubinfeld Journal of Computer and System Sciences 72 (6), 1012-1042, 2006 | 239 | 2006 |
| 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 | 201 | 2007 |
| Multi-index hashing for information retrieval D Greene, M Parnas, F Yao Proceedings 35th Annual Symposium on Foundations of Computer Science, 722-731, 1994 | 133 | 1994 |
| Testing the diameter of graphs M Parnas, D Ron Random Structures & Algorithms 20 (2), 165-183, 2002 | 131 | 2002 |
| Testing of clustering N Alon, S Dar, M Parnas, D Ron SIAM Journal on Discrete Mathematics 16 (3), 393-417, 2003 | 129 | 2003 |
| Testing basic boolean formulae M Parnas, D Ron, A Samorodnitsky SIAM Journal on Discrete Mathematics 16 (1), 20-46, 2002 | 118 | 2002 |
| Efficient dynamic traitor tracing O Berkman, M Parnas, J Sgall SIAM Journal on Computing 30 (6), 1802-1828, 2001 | 73 | 2001 |
| Fast connected components algorithms for the EREW PRAM DR Karger, N Nisan, M Parnas Proceedings of the fourth annual ACM symposium on Parallel algorithms and …, 1992 | 57 | 1992 |
| On testing convexity and submodularity M Parnas, D Ron, R Rubinfeld SIAM Journal on Computing 32 (5), 1158-1184, 2003 | 40 | 2003 |
| Testing metric properties M Parnas, D Ron Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 39 | 2001 |
| Testing membership in parenthesis languages M Parnas, D Ron, R Rubinfeld Random Structures & Algorithms 22 (1), 98-138, 2003 | 36 | 2003 |
| Testing the diameter of graphs M Parnas, D Ron International Workshop on Randomization and Approximation Techniques in …, 1999 | 36 | 1999 |
| Fast connected components algorithms for the EREW PRAM DR Karger, N Nisan, M Parnas SIAM Journal on Computing 28 (3), 1021-1034, 1998 | 34 | 1998 |
| Neighborhood preserving hashing and approximate queries D Dolev, Y Harari, N Linial, N Nisan, M Parnas SIAM Journal on Discrete Mathematics 15 (1), 73-85, 2001 | 33 | 2001 |
| Proclaiming dictators and juntas or testing boolean formulae M Parnas, D Ron, A Samorodnitsky International Workshop on Randomization and Approximation Techniques in …, 2001 | 31 | 2001 |
| Finding the neighborhood of a query in a dictionary D Dolev, Y Harari, M Parnas [1993] The 2nd Israel Symposium on Theory and Computing Systems, 33-42, 1993 | 26 | 1993 |
| All cycles are edge-magic O Berkman, M Parnas, Y Roditty Ars Combinatoria 59, 145-152, 2001 | 15 | 2001 |
| Learning conjunctions with noise under product distributions Y Mansour, M Parnas Information Processing Letters 68 (4), 189-196, 1998 | 15 | 1998 |
| Testing parenthesis languages M Parnas, D Ron, R Rubinfeld International Workshop on Randomization and Approximation Techniques in …, 2001 | 14 | 2001 |
| Robust Algorithms and Data structures for information retrieval M Parnas Hebrew University of Jerusalem., 1994 | 5 | 1994 |
Dana RonTel Aviv UniversityVerified email at tau.ac.il
