Ronitt Rubinfeld

Q: What Schools Are Affiliated With Ronitt Rubinfeld

Ronitt Rubinfeld is affiliated with the following schools: University of California, Berkeley, University of Michigan, Princeton University, Hebrew University of Jerusalem, Tel Aviv University, Massachusetts Institute of Technology, Cornell University

Ronitt Rubinfeld's AcademicInfluence.com Rankings

Ronitt Rubinfeld

Computer Science

#2173

World Rank

#2261

Historical Rank

#985

USA Rank

Database

#7423

World Rank

#7693

Historical Rank

#909

USA Rank

computer-science Degrees

Download Badge

Computer Science

Ronitt Rubinfeld's Degrees

PhD Computer Science University of California, Berkeley
Masters Computer Science University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Why Is Ronitt Rubinfeld Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ronitt Rubinfeld is a professor of electrical engineering and computer science at the Massachusetts Institute of Technology and at the School of Computer Science at Tel Aviv University. Education Rubinfeld was born in 1964 in Ohio and grew up in Ann Arbor, Michigan. As a child, she attended Huron High School and went on to graduate from the University of Michigan with a BSE in Electrical and Computer Engineering . Following that, she received her PhD from the University of California, Berkeley , under the supervision of Manuel Blum. In the years 1990–1992 she did a post-doctorate at Princeton University in New Jersey and then at the Hebrew University in Jerusalem.

(See a Problem?)

Ronitt Rubinfeld's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Self-testing/correcting with applications to numerical problems (1990) (964)
Robust Characterizations of Polynomials with Applications to Program Testing (1996) (769)
Introduction to Number Theory (2005) (691)
The Bloomier filter: an efficient data structure for static support lookup tables (2004) (417)
Testing that distributions are close (2000) (303)
On the learnability of discrete distributions (1994) (292)
Testing random variables for independence and identity (2001) (216)
Self-testing/correcting for polynomials and for approximate functions (1991) (210)
Monotonicity testing over general poset domains (2002) (197)
Spot-checkers (1998) (193)
Tolerant property testing and distance approximation (2006) (179)
Sublinear Time Algorithms (2011) (179)
The complexity of approximating the entropy (2002) (178)
Learning polynomials with queries: The highly noisy case (1995) (178)
Approximating the Minimum Spanning Tree Weight in Sublinear Time (2001) (158)
Testing Closeness of Discrete Distributions (2010) (150)
Sublinear algorithms for testing monotone and unimodal distributions (2004) (134)
Fast Local Computation Algorithms (2011) (130)
Testing k-wise and almost k-wise independence (2007) (122)
Testing for Concise Representations (2007) (121)
Maintaining a large matching and a small vertex cover (2010) (110)
Selective private function evaluation with applications to private statistics (2001) (110)
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover (2018) (108)
Short paths in expander graphs (1996) (105)
A sublinear algorithm for weakly approximating edit distance (2003) (99)
Rapid Sampling for Visualizations with Ordering Guarantees (2014) (98)
Space-efficient local computation algorithms (2011) (97)
Testing Halfspaces (2009) (97)
Efficient learning of typical finite automata from random walks (1993) (95)
Taming big probability distributions (2012) (91)
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size (2011) (85)
Reconstructing algebraic functions from mixed data (1992) (79)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2006) (79)
Testing Shape Restrictions of Discrete Distributions (2015) (78)
A mathematical theory of self-checking, self-testing and self-correcting programs (1991) (70)
Regular ArticleSpot-Checkers☆ (2000) (68)
Self-testing polynomial functions efficiently and over rational domains (1992) (66)
Approximating and testing k-histogram distributions in sub-linear time (2012) (63)
Testing monotone high-dimensional distributions (2005) (63)
Random walks with `back buttons' (2001) (62)
Testing Properties of Collections of Distributions (2013) (59)
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time (2005) (57)
Approximation, Randomization and Combinatorial Optimization. (2008) (56)
Fast approximate PCPs for multidimensional bin-packing problems (1999) (55)
On the robustness of functional equations (1994) (54)
I've Seen "Enough": Incrementally Improving Visualizations to Support Rapid Decision Making (2017) (52)
Efficient algorithms for learning to play repeated games against computationally bounded adversaries (1995) (43)
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling (2017) (42)
Sublinear Time Algorithms for Earth Mover’s Distance (2009) (42)
Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions (2008) (38)
Testing Probability Distributions Underlying Aggregated Data (2014) (37)
Local Computation Algorithms for Graphs of Non-constant Degrees (2015) (35)
Fast approximate probabilistically checkable proofs (2004) (34)
On Testing Convexity and Submodularity (2002) (33)
Program Result Checking against Adaptive Programs and in Cryptographic Settings (1989) (33)
A Competitive 2-Server Algorithm (1991) (33)
Robust Characterizations of Polynomials and Their Applications to Program Testing (1993) (30)
Local Reconstructors and Tolerant Testers for Connectivity and Diameter (2012) (29)
Sublinear Algorithms for Approximating String Compressibility (2007) (29)
Local Algorithms for Sparse Spanning Graphs (2014) (29)
Testing monotonicity of distributions over general partial orders (2010) (29)
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (2011) (29)
On learning bounded-width branching programs (1995) (28)
Fast approximate PCPs (1999) (27)
Approximate checking of polynomials and functional equations (1996) (27)
Testing ±1-weight halfspace (2009) (26)
Algorithms column: sublinear time algorithms (2003) (26)
Sublinear-time approximation of Euclidean minimum spanning tree (2003) (25)
Automatic two-fingered grip selection (1986) (24)
Random walks with “back buttons” (extended abstract) (2000) (23)
Differentially Private Identity and Equivalence Testing of Discrete Distributions (2018) (23)
Testing membership in parenthesis languages (2003) (22)
Open Problems in Data Streams, Property Testing, and Related Topics (2011) (21)
Reversing Trains: A Turn of the Century Sorting Problem (1989) (18)
Learning-based Support Estimation in Sublinear Time (2021) (17)
Local Computation Algorithms for Spanners (2019) (17)
Fractional Set Cover in the Streaming Model (2017) (16)
Constructing near spanning trees with few local inspections (2015) (16)
Private Testing of Distributions via Sample Permutations (2019) (15)
A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support (2013) (15)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (2015) (14)
Testing Non-uniform k-Wise Independent Distributions over Product Spaces (2010) (14)
Batch Checking with Applications to Linear Functions (1992) (13)
Robust Functional Equations with Applications to Self-Testing/Correcting (1994) (13)
Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation (2016) (13)
Learning Circuits (2006) (13)
Designing checkers for programs that run in parallel (1996) (12)
Automatic evaluation of two-fingered grips (1987) (12)
On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? (1992) (12)
Differentially Private Identity and Closeness Testing of Discrete Distributions (2017) (12)
Learning and Testing Junta Distributions (2016) (11)
Learning fallible finite state automata (1993) (11)
Online Page Migration with ML Advice (2020) (11)
Sampling Correctors (2015) (11)
Testing Parenthesis Languages (2001) (11)
Testing +/- 1-Weight Halfspaces (2009) (10)
A Local Algorithm for Constructing Spanners in Minor-Free Graphs (2016) (10)
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time (2021) (9)
Learning Fallible Deterministic Finite Automata (2004) (8)
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2006) (8)
Sampling Multiple Edges Efficiently (2020) (8)
The Cover Time of a Regular Expander is O(n log n) (1990) (8)
Exactly learning automata with small cover time (1995) (8)
A local decision test for sparse polynomials (2010) (8)
Improved recommendations via (more) collaboration (2010) (7)
Improved Local Computation Algorithm for Set Cover via Sparsification (2019) (7)
Set Cover in Sub-linear Time (2018) (7)
Checking Approximate Computations of Polynomials and Functional Equations (2002) (7)
Linearity Testing/Testing Hadamard Codes (2008) (6)
Triangle and Four Cycle Counting with Predictions in Graph Streams (2022) (6)
Towards Testing Monotonicity of Distributions Over General Posets (2019) (6)
Testing monotone high‐dimensional distributions (2009) (5)
Parallel Algorithms for Small Subgraph Counting (2020) (5)
Testing Similar Means (2012) (5)
External Sampling (2009) (5)
Robust characterizations of k‐wise independence over product spaces and related testing results (2013) (5)
Can We Locally Compute Sparse Connected Subgraphs? (2017) (5)
Approximating the noise sensitivity of a monotone Boolean function (2019) (4)
Learning fallible Deterministic Finite Automata (1995) (4)
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling (2017) (4)
Robust Chara terizations of Polynomials withAppli ations to Program Testing (1996) (4)
Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size (2005) (4)
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling (2020) (4)
Testing distributional assumptions of learning algorithms (2022) (4)
Property Testing of Abelian Group Operations (2007) (4)
Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (2011) (3)
Sub-linear approximation of euclidean minimum spanning tree (2005) (3)
Local Access to Huge Random Objects Through Partial Sampling (2017) (3)
Rapid sampling for visualizations with ordering guarantees Citation (2014) (3)
A new modular interpolation algorithm for factoring multivariate polynominals (1994) (3)
Approximate Checking of Polynomials and Functional Equations (extended abstract). (1996) (2)
Dynamic Approximate Vertex Cover and Maximum Matching (2010) (2)
Massively Parallel Algorithms for Small Subgraph Counting (2020) (2)
Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear Samples (2020) (2)
Local-Access Generators for Basic Random Graph Models (2017) (2)
Testing (Subclasses of) Halfspaces (2010) (2)
6.842 Randomness and Computation (2008) (2)
Approximating the Minimum Spanning TreeWeight in Sublinear (2001) (2)
Something for (Almost) Nothing: New Advances in Sublinear-Time Algorithms (2016) (2)
Sublinear Algorithms, 17.07. - 22.07.2005 (2006) (2)
Sublinear Time (2022) (2)
Properly learning monotone functions via local correction (2022) (2)
Sublinear Algorithms for Approximating String Compressibility (2012) (1)
Rapid Approximate Aggregation with Distribution-Sensitive Interval Guarantees (2020) (1)
Learning distributions from random walks (1997) (1)
Linearity and Group Homomorphism Testing / Testing Hadamard Codes (2015) (1)
Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time (2015) (1)
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks (2022) (1)
On the Time and Space Complexity of Computation Using Write-Once (1988) (1)
Eecient Learning of Typical Finite Automata from Random Walks Extended Abstract (1996) (1)
Properly learning monotone functions via local reconstruction (2022) (1)
Local Algorithms for Sparse Spanning Graphs (2019) (1)
Testing Closeness of Discrete Distributions Citation (2010) (1)
Amortized Edge Sampling (2020) (1)
Runtime Verification of Remotely Executed Code using Probabilistically Checkable Proof Systems (2006) (1)
Testing Mixtures of Discrete Distributions (2019) (1)
Local Access to Random Walks (2021) (1)
Exactly Learning Automata of Small Cover Time (2004) (1)
Proceedings of the Annual IEEE Conference on Computational Complexity: Preface (2005) (1)
4 Powering of Graphs (2014) (0)
Space-Efficient Local Computation Algorithms Citation (2011) (0)
1 Polynomial Identity Testing (2006) (0)
Exploration Strategies for Model-based Learning 37 Convergence Results for Single-step On-policy Reinforcement-learning Algorithms. Machine Learning Journal Exploration Strategies for Model-based Learning Exploration Strategies for Model-based Learning (2007) (0)
Testing Symmetric Properties of Distributions Jul 0 1 2008 Librarifs Testing Symmetric Properties of Distributions (2009) (0)
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness (2014) (0)
05291 Abstracts Collection Sublinear Algorithms Dagstuhl Seminar (2006) (0)
2 A More General Theorem (2020) (0)
IBM Haifa Leadership Seminar – Abstracts Machine Learning Seminar 2009 June 7 , 2009 Dimensionality Reduction with Contaminated Data : The Very High Dimensional Case (0)
05291 Abstracts Collection -- Sublinear Algorithms (2005) (0)
Induction , II . 1 Good Proofs and Bad Proofs (0)
2 Triangle Counting in a Random Tripartite Graph (2014) (0)
Random Variables , Distributions and Expectation 1 Random Variables (2005) (0)
08341 Executive Summary - Sublinear Algorithms (2008) (0)
{38 () Learning Fallible Deterministic Finite Automata (1995) (0)
D S ] 2 1 Ja n 20 16 Testing Shape Restrictions of Discrete Distributions (2018) (0)
Proofs 1 What is a Proof ? (2005) (0)
Linear Algebra and Random Walks 1 Undirected Connectivity and Randomized Logspace (2022) (0)
Overview 1.1 Last Lecture: Boosting Weak Learners into Strong Learners 2 Yao's Xor Lemma 2.1 Definition of Hard (2008) (0)
Local Computation Algorithms for Graphs of Non-constant Degrees (2016) (0)
Last Time 3 Derandomization via Enumeration (2008) (0)
Interactive Proofs with Space Bounded Provers (1991) (0)
Testing Shape Restrictions of Discrete Distributions (2017) (0)
Session details: 9A (2008) (0)
Sublinear Algorithms in the External Memory Model (2010) (0)
6.5240 Sublinear Time Algorithms (2022) (0)
Lecture 12 : Distribution Testing-Uniformity (2020) (0)
L EARNING-BASED S UPPORT E STIMATION IN S UBLINEAR T IME (2021) (0)
Lecture 12 and 13 : Distribution Testing-Uniformity (2020) (0)
Testing Symmetric Properties of Distributions by Paul Valiant (2009) (0)
08341 Abstracts Collection - Sublinear Algorithms (2008) (0)
State Machines : Invariants and Termination 1 State machines (2005) (0)
2 KEY RESULTS (2007) (0)
25 : 2 Testing Shape Restrictions of Discrete Distributions restricted inference (2016) (0)
2 Pairwise Independent Hash Functions 2.1 Extending the Construction from Last Time (2012) (0)
3 . 2 Boolean Satisfiability Problem (2014) (0)
8 : Approximation Algorithms 1 Approximation Algorithms (0)
52 : 2 Approximating the Noise Sensitivity of a Monotone Boolean Function Funding (2019) (0)
J ul 2 01 9 Testing Mixtures of Discrete Distributions (2019) (0)
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness (2015) (0)
2 Pairwise Independent Hash Functions and Hash Mixing Lemma (2008) (0)
.1 Relations on One Set (0)
Session details: 13A (2008) (0)
Lecture 17 and 18 (2007) (0)
Testing Tail Weight of a Distribution Via Hazard Rate (2020) (0)
6.895 Randomness and Computation 1 Random Walks 1.1 Markov Chains 1.2 Random Walk on a Graph (2008) (0)
Local Computation Algorithms (Invited Talk) (2017) (0)
2 Estimating the average degree of a graph 2 . 1 (2020) (0)
Sublinear Algorithms Dagstuhl Seminar (2008) (0)
Lecture 18 Lecturer (2006) (0)
Preface to SICOMP ' s Special Issueon Randomness and ComplexityOded (2014) (0)
1 Testing “ Triangle Freeness ” for Dense Graphs Definition (2019) (0)
DICTIONS IN GRAPH STREAMS (2022) (0)
A Competitive Server Algorithm (2020) (0)
Approximating the Weight of the Eu lidean Minimum Spanning Tree inSublinear (2008) (0)
Paul Valiant 1 Reducing the randomness of repeated runs (2006) (0)
Approximate Minimum Spanning Tree Weight (2020) (0)
Ju l 2 02 1 Sampling Multiple Edges Efficiently ∗ Talya Eden (2021) (0)

This paper list is powered by the following services:

Other Resources About Ronitt Rubinfeld

What Schools Are Affiliated With Ronitt Rubinfeld?

Ronitt Rubinfeld is affiliated with the following schools:

Ronitt Rubinfeld's Academic­Influence.com Rankings