- Home
- Best Scientists - Computer Science
- Ronitt Rubinfeld

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
42
Citations
7,991
148
World Ranking
5242
National Ranking
2572

2020 - Fellow of the American Academy of Arts and Sciences

2014 - ACM Fellow For contributions to delegated computation, sublinear time algorithms and property testing.

1996 - Fellow of Alfred P. Sloan Foundation

- Algorithm
- Statistics
- Algebra

His primary scientific interests are in Discrete mathematics, Combinatorics, Property testing, Time complexity and Function. His research links Polynomial with Discrete mathematics. His study in the field of Binary logarithm also crosses realms of Independent samples.

Property testing is a subfield of Algorithm that he investigates. His Time complexity research includes elements of Probability distribution, Statistical distance and Expander graph. His studies deal with areas such as Determinant, Simple, Theoretical computer science and Boolean function as well as Function.

- Robust Characterizations of Polynomials withApplications to Program Testing (688 citations)
- The Bloomier filter: an efficient data structure for static support lookup tables (342 citations)
- Self-testing/correcting with applications to numerical problems (269 citations)

The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Algorithm, Distribution and Theoretical computer science. Many of his research projects under Discrete mathematics are closely connected to Domain with Domain, tying the diverse disciplines of science together. His work on Combinatorics is being expanded to include thematically relevant topics such as Function.

His Algorithm research incorporates themes from Set and Maximal independent set. His Distribution research is multidisciplinary, incorporating elements of Probability distribution, Sample, Sublinear function and Lossless compression. The study incorporates disciplines such as Coding theory and Finite field in addition to Polynomial.

- Discrete mathematics (49.31%)
- Combinatorics (48.39%)
- Algorithm (20.74%)

- Combinatorics (48.39%)
- Algorithm (20.74%)
- Domain (9.22%)

Ronitt Rubinfeld spends much of his time researching Combinatorics, Algorithm, Domain, Sublinear function and Distribution. Ronitt Rubinfeld conducts interdisciplinary study in the fields of Combinatorics and Omega through his works. His Algorithm research incorporates elements of State, Spanning tree, Spanning subgraph and Maximal independent set.

In Sublinear function, Ronitt Rubinfeld works on issues like Element, which are connected to Lemma, Statistical distance and Probability distribution. His study in Computation is interdisciplinary in nature, drawing from both Value and Set. Ronitt Rubinfeld has included themes like Contrast, Competitive analysis, Advice, Theory of computation and Online algorithm in his Discrete mathematics study.

- Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover (70 citations)
- Testing Shape Restrictions of Discrete Distributions (16 citations)
- Testing Shape Restrictions of Discrete Distributions (16 citations)

- Algorithm
- Statistics
- Algebra

Ronitt Rubinfeld mainly investigates Algorithm, Theory of computation, Discrete mathematics, Graph theory and Graph. His Algorithm research is multidisciplinary, relying on both Sublinear function, Set and Maximal independent set. His studies examine the connections between Maximal independent set and genetics, as well as such issues in State, with regards to Graph.

Graph is a subfield of Combinatorics that Ronitt Rubinfeld explores. His Discrete mathematics research is multidisciplinary, incorporating perspectives in Poisson distribution, General algorithm and Binomial. His Graph theory study integrates concerns from other disciplines, such as Spanning tree and Spanning subgraph.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Robust Characterizations of Polynomials withApplications to Program Testing

Ronitt Rubinfeld;Madhu Sudan.

SIAM Journal on Computing **(1996)**

932 Citations

The Bloomier filter: an efficient data structure for static support lookup tables

Bernard Chazelle;Joe Kilian;Ronitt Rubinfeld;Ayellet Tal.

symposium on discrete algorithms **(2004)**

494 Citations

Self-testing/correcting with applications to numerical problems

M. Blum;M. Luby;R. Rubinfeld.

symposium on the theory of computing **(1990)**

414 Citations

Testing that distributions are close

T. Batu;L. Fortnow;R. Rubinfeld;W.D. Smith.

foundations of computer science **(2000)**

313 Citations

On the learnability of discrete distributions

Michael Kearns;Yishay Mansour;Dana Ron;Ronitt Rubinfeld.

symposium on the theory of computing **(1994)**

309 Citations

Testing random variables for independence and identity

T. Batu;E. Fischer;L. Fortnow;R. Kumar.

international conference on cluster computing **(2001)**

292 Citations

Learning Polynomials with Queries: The Highly Noisy Case

Oded Goldreich;Ronitt Rubinfeld;Madhu Sudan.

SIAM Journal on Discrete Mathematics **(2000)**

276 Citations

Self-testing/correcting for polynomials and for approximate functions

Peter Gemmell;Richard Lipton;Ronitt Rubinfeld;Madhu Sudan.

symposium on the theory of computing **(1991)**

251 Citations

Monotonicity testing over general poset domains

Eldar Fischer;Eric Lehman;Ilan Newman;Sofya Raskhodnikova.

symposium on the theory of computing **(2002)**

248 Citations

Tolerant property testing and distance approximation

Michal Parnas;Dana Ron;Ronitt Rubinfeld.

Journal of Computer and System Sciences **(2006)**

231 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Tel Aviv University

Harvard University

MIT

Google (United States)

Columbia University

University of Wisconsin–Madison

Illinois Institute of Technology

University of Warwick

University of Cologne

BitRipple

Columbia University

Yale University

Georgia Institute of Technology

Kanazawa University

Technical University of Munich

Spanish National Research Council

Kansas State University

Royal Holloway University of London

Aberystwyth University

Stanford University

University of Surrey

Johns Hopkins University

Emory University

Brown University

University of Arizona

Netherlands Institute for Social Research

Something went wrong. Please try again later.