D-Index & Metrics Best Publications
Ronitt Rubinfeld

Ronitt Rubinfeld

D-Index & Metrics

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 35 Citations 6,870 111 World Ranking 5761 National Ranking 2792

Research.com Recognitions

Awards & Achievements

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

Overview

What is he best known for?

The fields of study he is best known for:

  • 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.

His most cited work include:

  • 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)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

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

What were the highlights of his more recent work (between 2017-2021)?

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

In recent papers he was focusing on the following fields of study:

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.

Between 2017 and 2021, his most popular works were:

  • 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)

In his most recent research, the most cited papers focused on:

  • 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.

Best Publications

Self-testing/correcting with applications to numerical problems

M. Blum;M. Luby;R. Rubinfeld.
symposium on the theory of computing (1990)

1087 Citations

Robust Characterizations of Polynomials withApplications to Program Testing

Ronitt Rubinfeld;Madhu Sudan.
SIAM Journal on Computing (1996)

893 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)

438 Citations

On the learnability of discrete distributions

Michael Kearns;Yishay Mansour;Dana Ron;Ronitt Rubinfeld.
symposium on the theory of computing (1994)

302 Citations

Testing that distributions are close

T. Batu;L. Fortnow;R. Rubinfeld;W.D. Smith.
foundations of computer science (2000)

286 Citations

Testing random variables for independence and identity

T. Batu;E. Fischer;L. Fortnow;R. Kumar.
international conference on cluster computing (2001)

275 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)

237 Citations

Monotonicity testing over general poset domains

Eldar Fischer;Eric Lehman;Ilan Newman;Sofya Raskhodnikova.
symposium on the theory of computing (2002)

236 Citations

Learning Polynomials with Queries: The Highly Noisy Case

Oded Goldreich;Ronitt Rubinfeld;Madhu Sudan.
SIAM Journal on Discrete Mathematics (2000)

202 Citations

The Complexity of Approximating the Entropy

Tuugkan Batu;Sanjoy Dasgupta;Ravi Kumar;Ronitt Rubinfeld.
SIAM Journal on Computing (2005)

181 Citations

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

Contact us

Best Scientists Citing Ronitt Rubinfeld

Dana Ron

Dana Ron

Tel Aviv University

Publications: 100

Oded Goldreich

Oded Goldreich

Weizmann Institute of Science

Publications: 89

Rocco A. Servedio

Rocco A. Servedio

Columbia University

Publications: 82

Madhu Sudan

Madhu Sudan

Harvard University

Publications: 79

Ilias Diakonikolas

Ilias Diakonikolas

University of Wisconsin–Madison

Publications: 77

Noga Alon

Noga Alon

Tel Aviv University

Publications: 47

Christian Sohler

Christian Sohler

University of Cologne

Publications: 41

Artur Czumaj

Artur Czumaj

University of Warwick

Publications: 33

C. Seshadhri

C. Seshadhri

University of California, Santa Cruz

Publications: 32

Constantinos Daskalakis

Constantinos Daskalakis

MIT

Publications: 27

Daniel M. Kane

Daniel M. Kane

University of California, San Diego

Publications: 27

Michael Mitzenmacher

Michael Mitzenmacher

Harvard University

Publications: 25

Venkatesan Guruswami

Venkatesan Guruswami

Carnegie Mellon University

Publications: 24

Michael Krivelevich

Michael Krivelevich

Tel Aviv University

Publications: 23

Xi Chen

Xi Chen

Columbia University

Publications: 22

Subhash Khot

Subhash Khot

New York University

Publications: 22

Trending Scientists

Daniel Bienstock

Daniel Bienstock

Columbia University

Zhong Shao

Zhong Shao

Yale University

Joseph W. Perry

Joseph W. Perry

Georgia Institute of Technology

Katsuhiro Maeda

Katsuhiro Maeda

Kanazawa University

Ruedi Fries

Ruedi Fries

Technical University of Munich

Lluís Brotons

Lluís Brotons

Spanish National Research Council

Finlay MacRitchie

Finlay MacRitchie

Kansas State University

Vincent A. A. Jansen

Vincent A. A. Jansen

Royal Holloway University of London

Michael J. Hambrey

Michael J. Hambrey

Aberystwyth University

Gail A. Mahood

Gail A. Mahood

Stanford University

Matthias Ketzel

Matthias Ketzel

University of Surrey

Daniel E. Ford

Daniel E. Ford

Johns Hopkins University

Sagar Lonial

Sagar Lonial

Emory University

Ziya L. Gokaslan

Ziya L. Gokaslan

Brown University

Paul L. Enright

Paul L. Enright

University of Arizona

Marcel Coenders

Marcel Coenders

Netherlands Institute for Social Research

Something went wrong. Please try again later.