What is she best known for?
The fields of study she is best known for:
- Algorithm
- Algebra
- Combinatorics
Her primary scientific interests are in Combinatorics, Discrete mathematics, Property testing, Algorithm and Theoretical computer science.
Her Upper and lower bounds research extends to Combinatorics, which is thematically connected.
Her Discrete mathematics research focuses on Word and how it relates to Order, Binary code and Code word.
Her Property testing research is multidisciplinary, incorporating elements of Cluster analysis, Class, Bounded function, Analysis of algorithms and Bipartite graph.
Dana Ron has included themes like Dimension, Stability, Monotonic function and Minification in her Algorithm study.
Her Theoretical computer science research incorporates elements of Semi-supervised learning, Distributed computing, Time complexity, Probabilistic logic and Learnability.
Her most cited work include:
- Property testing and its connection to learning and approximation (944 citations)
- The power of amnesia: learning probabilistic automata with variable memory length (449 citations)
- Algorithmic stability and sanity-check bounds for leave-one-out cross-validation (314 citations)
What are the main themes of her work throughout her whole career to date?
Her main research concerns Combinatorics, Discrete mathematics, Property testing, Upper and lower bounds and Function.
Approximation algorithm, Graph, Vertex, Randomized algorithm and Degree are the subjects of her Combinatorics studies.
Her work on Graph property, Sublinear function, Sublinear time and Line graph as part of general Discrete mathematics research is often related to Oracle, thus linking different fields of science.
Her Property testing research integrates issues from Object, Theoretical computer science, Monotonic function and Bipartite graph.
Her study in Upper and lower bounds is interdisciplinary in nature, drawing from both Binary logarithm, Algorithm, Distribution and Constant.
Her Function study also includes
- Boolean function, which have a strong connection to Polynomial,
- Submodular set function, which have a strong connection to Isomorphism.
She most often published in these fields:
- Combinatorics (60.87%)
- Discrete mathematics (48.70%)
- Property testing (29.57%)
What were the highlights of her more recent work (between 2017-2021)?
- Combinatorics (60.87%)
- Graph (13.04%)
- Discrete mathematics (48.70%)
In recent papers she was focusing on the following fields of study:
The scientist’s investigation covers issues in Combinatorics, Graph, Discrete mathematics, Upper and lower bounds and Property testing.
She has researched Combinatorics in several fields, including Polynomial and Subsequence.
Her Graph study incorporates themes from Efficient algorithm, Algorithm and Bounded function.
Her research integrates issues of Base, Mathematical proof and Relation in her study of Discrete mathematics.
Her research in Upper and lower bounds intersects with topics in Binary logarithm, Distribution and Sublinear function.
Her Property testing research is multidisciplinary, relying on both Distributed algorithm, Planarity testing, Order and Graph partition.
Between 2017 and 2021, her most popular works were:
- On approximating the number of k-cliques in sublinear time (21 citations)
- Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples (11 citations)
- Tolerant junta testing and the connection to submodular optimization and function isomorphism (10 citations)
In her most recent research, the most cited papers focused on:
- Algebra
- Algorithm
- Combinatorics
Combinatorics, Arboricity, Upper and lower bounds, Approximation algorithm and Vertex are her primary areas of study.
Her research is interdisciplinary, bridging the disciplines of Polynomial and Combinatorics.
Her work in Polynomial addresses issues such as Boolean function, which are connected to fields such as Property testing and Connection.
Her work focuses on many connections between Upper and lower bounds and other disciplines, such as Binary logarithm, that overlap with her field of interest in Tree, Distribution and Pointwise.
Her studies deal with areas such as Distributed algorithm, Algorithm, Bounded function and Sublinear function as well as Vertex.
Discrete mathematics covers Dana Ron research in Degeneracy.
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.
