Self-testing/correcting with applications to numerical problems M Blum, M Luby, R Rubinfeld Proceedings of the twenty-second annual ACM symposium on Theory of computing ¡K, 1990 | 1181 | 1990 |

Robust characterizations of polynomials with applications to program testing R Rubinfeld, M Sudan SIAM Journal on Computing 25 (2), 252-271, 1996 | 989 | 1996 |

The bloomier filter: an efficient data structure for static support lookup tables B Chazelle, J Kilian, R Rubinfeld, A Tal Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete ¡K, 2004 | 521 | 2004 |

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 ¡K, 1994 | 345 | 1994 |

Testing that distributions are close T Batu, L Fortnow, R Rubinfeld, WD Smith, P White Proceedings 41st Annual Symposium on Foundations of Computer Science, 259-269, 2000 | 343 | 2000 |

Spot-checkers F Ergün, S Kannan, SR Kumar, R Rubinfeld, M Viswanathan Proceedings of the thirtieth annual ACM symposium on Theory of computing ¡K, 1998 | 301 | 1998 |

Self-testing/correcting for polynomials and for approximate functions P Gemmell, R Lipton, R Rubinfeld, M Sudan, A Wigderson STOC 91, 32-42, 1991 | 272 | 1991 |

Monotonicity testing over general poset domains E Fischer, E Lehman, I Newman, S Raskhodnikova, R Rubinfeld, ... Proceedings of the thiry-fourth annual ACM symposium on Theory of computing ¡K, 2002 | 265 | 2002 |

Testing random variables for independence and identity T Batu, E Fischer, L Fortnow, R Kumar, R Rubinfeld, P White Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 442-451, 2001 | 242 | 2001 |

Tolerant property testing and distance approximation M Parnas, D Ron, R Rubinfeld Journal of Computer and System Sciences 72 (6), 1012-1042, 2006 | 229 | 2006 |

Learning polynomials with queries: The highly noisy case O Goldreich, R Rubinfeld, M Sudan SIAM Journal on Discrete Mathematics 13 (4), 535-570, 2000 | 210 | 2000 |

The complexity of approximating entropy T Batu, S Dasgupta, R Kumar, R Rubinfeld Proceedings of the thiry-fourth annual ACM symposium on Theory of computing ¡K, 2002 | 203 | 2002 |

Sublinear time algorithms R Rubinfeld, A Shapira SIAM Journal on Discrete Mathematics 25 (4), 1562-1588, 2011 | 192 | 2011 |

Testing closeness of discrete distributions T Batu, L Fortnow, R Rubinfeld, WD Smith, P White Journal of the ACM (JACM) 60 (1), 1-25, 2013 | 185 | 2013 |

Fast local computation algorithms R Rubinfeld, G Tamir, S Vardi, N Xie arXiv preprint arXiv:1104.1377, 2011 | 152 | 2011 |

Approximating the minimum spanning tree weight in sublinear time B Chazelle, R Rubinfeld, L Trevisan SIAM Journal on computing 34 (6), 1370-1379, 2005 | 151 | 2005 |

Testing k-wise and almost k-wise independence N Alon, A Andoni, T Kaufman, K Matulef, R Rubinfeld, N Xie Proceedings of the thirty-ninth annual ACM symposium on Theory of computing ¡K, 2007 | 137 | 2007 |

Sublinear algorithms for testing monotone and unimodal distributions T Batu, R Kumar, R Rubinfeld Proceedings of the thirty-sixth annual ACM symposium on Theory of computing ¡K, 2004 | 136 | 2004 |

Improved massively parallel computation algorithms for mis, matching, and vertex cover M Ghaffari, T Gouleakis, C Konrad, S Mitrović, R Rubinfeld Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing ¡K, 2018 | 129 | 2018 |

Short paths in expander graphs J Kleinberg, R Rubinfeld Proceedings of 37th Conference on Foundations of Computer Science, 86-95, 1996 | 128 | 1996 |