Dana Ron
Tel Aviv University
H-index: 52
Asia-Israel
Top articles of Dana Ron
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Testing -freeness in bounded-arboricity graphs | arXiv preprint arXiv:2404.18126 | Talya Eden Reut Levi Dana Ron | 2024/4/28 |
Testing distributions of huge objects | TheoretiCS | Oded Goldreich Dana Ron | 2023/12/30 |
A Lower Bound on the Complexity of Testing Grained Distributions | computational complexity | Oded Goldreich Dana Ron | 2023/12 |
Sample-based distance-approximation for subsequence-freeness | arXiv preprint arXiv:2305.01358 | Omer Cohen Sidon Dana Ron | 2023/5/2 |
The structure of configurations in one-dimensional majority cellular automata: from cell stability to configuration periodicity | Yonatan Nakar Dana Ron | 2022/8/13 | |
Optimal distribution-free sample-based testing of subsequence-freeness with one-sided error | ACM Transactions on Computation Theory (TOCT) | Dana Ron Asaf Rosin | 2022/3/24 |
Almost optimal bounds for sublinear-time sampling of k-cliques in bounded arboricity graphs | Talya Eden Dana Ron Will Rosenbaum | 2022 | |
Approximating the Arboricity in Sublinear Time∗ | Talya Eden Saleet Mossel Dana Ron | 2022 | |
Testing dynamic environments: Back to basics | arXiv preprint arXiv:2105.00759 | Yonatan Nakar Dana Ron | 2021/5/3 |
On efficient distance approximation for graph properties | Nimrod Fiat Dana Ron | 2021 | |
Property testing of the boolean and binary rank | Theory of Computing Systems | Michal Parnas Dana Ron Adi Shraibman | 2021/11 |
On the relation between the relative earth mover distance and the variation distance (an exposition) | Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation | Oded Goldreich Dana Ron | 2020 |
Local algorithms for sparse spanning graphs | Algorithmica | Reut Levi Dana Ron Ronitt Rubinfeld | 2020/4 |
Testing bounded arboricity | ACM Transactions on Algorithms (TALG) | Talya Eden Reut Levi Dana Ron | 2020/3/5 |
Almost optimal distribution-free sample-based testing of k-modality | Dana Ron Asaf Rosin | 2020 | |
The subgraph testing model | ACM Transactions on Computation Theory (TOCT) | Oded Goldreich Dana Ron | 2020/11/8 |
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs | Talya Eden Dana Ron C Seshadhri | 2020 | |
One-sided error testing of monomials and affine subspaces | Electron. Colloquium Comput. Complex | Oded Goldreich Dana Ron | 2020/5/3 |
A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy | Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation | Scott Decatur Oded Goldreich Dana Ron | 2020 |
Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation | Itai Benjamini Scott Decatur Maya Leshkowitz Or Meir Dana Ron | 2020/4/3 |
Co-Authors
