Dana Ron, Professor
Affiliations: | EE | Tel Aviv University, Tel Aviv-Yafo, Tel Aviv District, Israel |
Area:
Machine learning, property testingGoogle:
"Dana Ron"Mean distance: 17.18 (cluster 17) | S | N | B | C | P |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Eden T, Levi R, Ron D. (2020) Testing Bounded Arboricity Acm Transactions On Algorithms. 16: 1-22 |
| Eden T, Ron D, Seshadhri C. (2020) On Approximating the Number of $k$-Cliques in Sublinear Time Siam Journal On Computing. 49: 747-771 |
| Levi R, Medina M, Ron D. (2020) Property testing of planarity in the CONGEST model Distributed Computing. 1-18 |
| Eden T, Ron D, Seshadhri C. (2019) Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection Siam Journal On Discrete Mathematics. 33: 2267-2285 |
| Even G, Medina M, Ron D. (2018) Best of two local models: Centralized local and distributed local algorithms Information & Computation. 262: 69-89 |
| Eden T, Levi A, Ron D, et al. (2017) Approximately Counting Triangles in Sublinear Time Siam Journal On Computing. 46: 1603-1646 |
| Ron D, Tsur G. (2016) The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling Acm Transactions On Computation Theory. 8: 15 |
| Goldreich O, Ron D. (2016) On Sample-Based Testers Acm Transactions On Computation Theory. 8: 7 |
| Levi R, Moshkovitz G, Ron D, et al. (2016) Constructing near spanning trees with few local inspections Random Structures and Algorithms |
| Levi R, Ron D. (2015) A quasi-polynomial time partition oracle for graphs with an excluded minor Acm Transactions On Algorithms. 11 |