Dana Ron is a senior lecturer in the department of electrical engineering and systems at Tel Aviv University in Israel. Her research interests lie within the theory of computation and, specifically, the design and analysis of sublinear-time algorithms, randomized approximation algorithms, and computational learning theory (COLT).
As part of the research group on randomness and computation, Ron plans to study randomized sublinear-time algorithms for various approximation problems. Of special interest to her are the property-testing algorithms; that is, sublinear-time algorithms that distinguish huge objects having certain properties from objects that are far from having these properties. Her aim is to further extend the applicability of such algorithms to domains such as graph theory, coding theory, pattern recognition, and clustering.
Ron received a BA in computer science and physics and an MSc and a PhD in computer science at Hebrew University, Israel, in 1987, 1989, and 1995, respectively. She is a member of the editorial board of Journal of Machine Learning Research, was guest editor for the Machine Learning special issue of COLT96, and served on the program committee of several conferences, including FOCS, RANDOM, and COLT.