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.
