Get started
Author

Ronitt Rubinfeld

Robust Characterizations of Polynomials with Applications to Program Testing
1996 · Ronitt Rubinfeld, Madhu Sudan · SIAM Journal on Computing · 792
Self-testing/correcting with applications to numerical problems
1993 · Manuel Blum, Michael Luby, et al. · Journal of Computer and System Sciences · 710
The Bloomier filter: an efficient data structure for static support lookup tables
2004 · Bernard Chazelle, Joe Kilian, et al. · 327
Self-testing/correcting with applications to numerical problems
1990 · M. Blum, M. Luby, et al. · ACM Symposium on Theory of Computing (STOC) · 303
PDF
On the learnability of discrete distributions
1994 · Michael Kearns, Yishay Mansour, et al. · ACM Symposium on Theory of Computing (STOC) · 273
PDF
Testing that distributions are close
2002 · T. Batu, L. Fortnow, et al. · Annual Symposium on Foundations of Computer Science · 247
Tolerant property testing and distance approximation
2006 · Michal Parnas, Dana Ron, et al. · Journal of Computer and System Sciences · 193
Monotonicity testing over general poset domains
2002 · Eldar Fischer, Eric Lehman, et al. · 183
Testing random variables for independence and identity
2001 · T. Batu, E. Fischer, et al. · Annual Symposium on Foundations of Computer Science · 182
Self-testing/correcting for polynomials and for approximate functions
1991 · Peter Gemmell, Richard Lipton, et al. · ACM Symposium on Theory of Computing (STOC) · 181
Learning Polynomials with Queries: The Highly Noisy Case
2000 · O. Goldreich, R. Rubinfeld, et al. · Annual Symposium on Foundations of Computer Science · 167
Testing Closeness of Discrete Distributions
2013 · Tuğkan Batu, Lance Fortnow, et al. · Journal of the ACM · 132
Approximating the Minimum Spanning Tree Weight in Sublinear Time
2005 · Bernard Chazelle, Ronitt Rubinfeld, et al. · SIAM Journal on Computing · 127
Spot-Checkers
2000 · Funda Ergün, Sampath Kannan, et al. · Journal of Computer and System Sciences · 120
Short paths in expander graphs
2002 · J. Kleinberg, R. Rubinfeld · 110
Testing for Concise Representations
2007 · Ilias Diakonikolas, Homin K. Lee, et al. · Annual Symposium on Foundations of Computer Science · 104
Sublinear Time Algorithms
2011 · Ronitt Rubinfeld, Asaf Shapira · SIAM Journal on Discrete Mathematics · 102
Rapid sampling for visualizations with ordering guarantees
2015 · Albert Kim, Eric Blais, et al. · Proceedings of the VLDB Endowment · 100
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
2018 · Mohsen Ghaffari, Themis Gouleakis, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 99
PDF
Maintaining a large matching and a small vertex cover
2010 · Krzysztof Onak, Ronitt Rubinfeld · ACM Symposium on Theory of Computing (STOC) · 98
Testing k-wise and almost k-wise independence
2007 · Noga Alon, Alexandr Andoni, et al. · ACM Symposium on Theory of Computing (STOC) · 96
Sublinear algorithms for testing monotone and unimodal distributions
2004 · Tugkan Batu, Ravi Kumar, et al. · ACM Symposium on Theory of Computing (STOC) · 96
The Complexity of Approximating the Entropy
2005 · Tugkan Batu, Sanjoy Dasgupta, et al. · SIAM Journal on Computing · 95
Selective private function evaluation with applications to private statistics
2001 · Ran Canetti, Yuval Ishai, et al. · 92
A sublinear algorithm for weakly approximating edit distance
2003 · Tugkan Batu, Funda Ergün, et al. · ACM Symposium on Theory of Computing (STOC) · 78
Works count: 285
Citation count: 7,384
H-index: 40
I10-index: 94
Year
Topic
Type