World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
56
Citations
13790
World Ranking
4039
National Ranking
63

Research.com Recognitions

  • 2019 - European Association for Theoretical Computer Science (EATCS) Fellow For her pioneering work in the fields of sub-linear time algorithms and in combinatorial property testing

Overview

Dana Ron is affiliated with Tel Aviv University in Israel. Their research primarily focuses on the field of Computer Science, with a strong emphasis on Computational Theory and Mathematics. They have produced work that intersects with Artificial Intelligence, Statistics and Probability, Computer Networks and Communications, and Computer Graphics and Computer-Aided Design.

The scientist's research topics cover areas such as Complexity and Algorithms in Graphs, Machine Learning and Algorithms, Advanced Graph Theory Research, Optimization and Search Problems, Markov Chains and Monte Carlo Methods, Computational Geometry and Mesh Generation, and Statistical Methods and Inference.

Among their recent publications are several papers published between 2020 and 2023. These include:

  • On Approximating the Number of k-Cliques in Sublinear Time, 2020, SIAM Journal on Computing
  • Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs, 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time, 2020, arXiv (Cornell University)
  • A Lower Bound on the Complexity of Testing Grained Distributions, 2023, Computational Complexity
  • Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting, 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequently, Dana Ron collaborates with other researchers including Talya Eden, Oded Goldreich, Reut Levi, C. Seshadhri, and Asaf Rosin.

Their work has appeared in a variety of publication venues, notably Leibniz-Zentrum für Informatik (Schloss Dagstuhl), arXiv (Cornell University), ACM Transactions on Computation Theory, Society for Industrial and Applied Mathematics eBooks, and SIAM Journal on Computing.

Dana Ron received recognition from the European Association for Theoretical Computer Science (EATCS) as a Fellow in 2019 for contributions to the areas of sub-linear time algorithms and combinatorial property testing.

Best Publications

  • Property testing and its connection to learning and approximation

    Oded Goldreich;Shari Goldwasser;Dana Ron

  • Algorithmic stability and sanity-check bounds for leave-one-out cross-validation

    Michael Kearns;Dana Ron

  • The power of amnesia: learning probabilistic automata with variable memory length

    Dana Ron;Yoram Singer;Naftali Tishby

  • The Power of Amnesia

    Dana Ron;Yoram Singer;Naftali Tishby

  • On testing expansion in bounded-degree graphs

    Oded Goldreich;Dana Ron

  • Property testing in bounded degree graphs

    Oded Goldreich;Dana Ron

  • Chinese remaindering with errors

    O. Goldreich;D. Ron;M. Sudan

  • Property Testing in Bounded Degree Graphs

    Unknown

  • On the learnability of discrete distributions

    Michael Kearns;Yishay Mansour;Dana Ron;Ronitt Rubinfeld

  • Testing monotonicity

    O. Goldreich;S. Goldwassert;E. Lehman;D. Ron

  • On randomized one-round communication complexity

    Ilan Kremer;Noam Nisan;Dana Ron

  • Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks

    Guy Even;Zvi Lotker;Dana Ron;Shakhar Smorodinsky

  • Property Testing

    Dana Ron

  • Tolerant property testing and distance approximation

    Michal Parnas;Dana Ron;Ronitt Rubinfeld

  • An experimental and theoretical comparison of model selection methods

    Michael Kearns;Yishay Mansour;Andrew Y. Ng;Dana Ron

  • The power of a pebble: exploring and mapping directed graphs

    Michael A. Bender;Antonio Fernández;Dana Ron;Amit Sahai

  • A Sublinear Bipartiteness Tester for Bounded Degree Graphs

    Oded Goldreich;Dana Ron

  • Improved Testing Algorithms for Monotonicity.

    Yevgeniy Dodis;Oded Goldreich;Eric Lehman;Sofya Raskhodnikova

  • Property testing: a learning theory perspective

    Dana Ron

  • Algorithmic and Analysis Techniques in Property Testing

    Dana Ron

  • Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms

    Michal Parnas;Dana Ron

Frequent Co-Authors

Oded Goldreich
Oded Goldreich Weizmann Institute of Science
C. Seshadhri
C. Seshadhri University of California, Santa Cruz
Michael Krivelevich
Michael Krivelevich Tel Aviv University
Michael Kearns
Michael Kearns University of Pennsylvania
Noga Alon
Noga Alon Tel Aviv University
Rocco A. Servedio
Rocco A. Servedio Columbia University
Guy Even
Guy Even Tel Aviv University
Adam Smith
Adam Smith Boston University
Madhu Sudan
Madhu Sudan Harvard University

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

Report an issue

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:

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens up diverse educational and career options. For those looking to quickly improve their job prospects, there are certifications for jobs that require less time than a traditional degree but still deliver high earning potential. These certifications can help set you apart in a competitive job market.

If you are interested in advancing your education efficiently, consider the fastest online master's degree programs. These allow you to gain advanced skills in less time, making it possible to move into higher-level roles or change your career path sooner.

For long-term career success, it’s worth exploring the most in demand masters degrees. Specializations in areas like artificial intelligence and data science are highly sought after by employers and can lead to very rewarding roles.

Additionally, 1 year associate degree programs online offer a fast and flexible entry point into the tech sector. These programs can help you build foundational knowledge and launch your IT career quickly, or serve as a stepping stone to further studies.

Best Scientists Citing Dana Ron

Trending Scientists

Recently Published Articles