Dana Ron

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 63

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

SODA

ICALP

University of Jerusalem, Israel (PHD)

Education History

University of Jerusalem, Israel

PHD

Publications

Talya Eden, Reut Levi, Dana Ron
-freeness in bounded-arboricity graphs. CoRR (2024)
Talya Eden, Reut Levi, Dana Ron
Testing C_k-Freeness in Bounded-Arboricity Graphs. ICALP (2024)
Omer Cohen Sidon, Dana Ron
Sample-Based Distance-Approximation for Subsequence-Freeness. Algorithmica 86 (8) (2024)
Omer Cohen Sidon, Dana Ron
Sample-based distance-approximation for subsequence-freeness. CoRR (2023)
Omer Cohen Sidon, Dana Ron
Sample-Based Distance-Approximation for Subsequence-Freeness. ICALP (2023)
Oded Goldreich, Dana Ron
A Lower Bound on the Complexity of Testing Grained Distributions. Comput. Complex. 32 (2) (2023)
Oded Goldreich, Dana Ron
Testing Distributions of Huge Objects. TheoretiCS 2 (2023)
Oded Goldreich, Dana Ron
Testing Distributions of Huge Objects. CoRR (2022)
Yonatan Nakar, Dana Ron
The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity. ACRI (2022)
Yonatan Nakar, Dana Ron
The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity. CoRR (2022)
Dana Ron, Asaf Rosin
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error. ACM Trans. Comput. Theory 14 (1) (2022)
Talya Eden, Dana Ron, Will Rosenbaum
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs. ICALP (2022)
Talya Eden, Saleet Mossel, Dana Ron
Approximating the Arboricity in Sublinear Time. SODA (2022)
Oded Goldreich, Dana Ron
Testing Distributions of Huge Objects. ITCS (2022)
Reut Levi, Moti Medina, Dana Ron
Property testing of planarity in the CONGEST model. Distributed Comput. 34 (1) (2021)
Yonatan Nakar, Dana Ron
Testing Dynamic Environments: Back to Basics. CoRR (2021)
Michal Parnas, Dana Ron, Adi Shraibman
Property Testing of the Boolean and Binary Rank. Theory Comput. Syst. 65 (8) (2021)
Talya Eden, Saleet Mossel, Dana Ron
Approximating the Arboricity in Sublinear Time. CoRR (2021)
Nimrod Fiat, Dana Ron
On Efficient Distance Approximation for Graph Properties. SODA (2021)
Oded Goldreich, Dana Ron
A Lower Bound on the Complexity of Testing Grained Distributions. Electron. Colloquium Comput. Complex. 28 (2021)
Yonatan Nakar, Dana Ron
Testing Dynamic Environments: Back to Basics. ICALP (2021)
Oded Goldreich, Dana Ron
Testing Distributions of Huge Objects. Electron. Colloquium Comput. Complex. 28 (2021)
Dana Ron, Asaf Rosin
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness. SODA (2021)
Nimrod Fiat, Dana Ron
On Efficient Distance Approximation for Graph Properties. CoRR (2020)
Talya Eden, Dana Ron, Will Rosenbaum
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting. CoRR (2020)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Local Algorithms for Sparse Spanning Graphs. Algorithmica 82 (4) (2020)
Talya Eden, Reut Levi, Dana Ron
Testing Bounded Arboricity. ACM Trans. Algorithms 16 (2) (2020)
Talya Eden, Dana Ron, C. Seshadhri
-cliques in low-arboricity graphs. SODA (2020)
Talya Eden, Dana Ron, C. Seshadhri
On Approximating the Number of k-Cliques in Sublinear Time. SIAM J. Comput. 49 (4) (2020)
Dana Ron, Asaf Rosin
Almost Optimal Distribution-Free Sample-Based Testing of k-Modality. APPROX-RANDOM (2020)
Oded Goldreich, Dana Ron
The Subgraph Testing Model. ACM Trans. Comput. Theory 12 (4) (2020)
Oded Goldreich, Dana Ron
One-Sided Error Testing of Monomials and Affine Subspaces. Electron. Colloquium Comput. Complex. 27 (2020)
Talya Eden, Dana Ron, C. Seshadhri
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. SIAM J. Discret. Math. 33 (4) (2019)
Talya Eden, Dana Ron, Will Rosenbaum
The Arboricity Captures the Complexity of Sampling Edges. CoRR (2019)
Talya Eden, Dana Ron, Will Rosenbaum
The Arboricity Captures the Complexity of Sampling Edges. ICALP (2019)
Michal Parnas, Dana Ron, Adi Shraibman
Property testing of the Boolean and binary rank. CoRR (2019)
Oded Goldreich, Dana Ron
The Subgraph Testing Model. ITCS (2019)
Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. ACM Trans. Comput. Theory 11 (4) (2019)
Talya Eden, Dana Ron, C. Seshadhri
On approximating the number of k-cliques in sublinear time. STOC (2018)
Yonatan Nakar, Dana Ron
On the Testability of Graph Partition Properties. Electron. Colloquium Comput. Complex. 25 (2018)
Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. WWW (2018)
Yonatan Nakar, Dana Ron
On the Testability of Graph Partition Properties. APPROX-RANDOM (2018)
Talya Eden, Dana Ron, C. Seshadhri
Faster sublinear approximations of k-cliques for low arboricity graphs. CoRR (2018)
Guy Even, Moti Medina, Dana Ron
Best of two local models: Centralized local and distributed local algorithms. Inf. Comput. 262 (2018)
Reut Levi, Moti Medina, Dana Ron
Property Testing of Planarity in the CONGEST model. CoRR (2018)
Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. SODA (2018)
Reut Levi, Moti Medina, Dana Ron
Property Testing of Planarity in the CONGEST model. PODC (2018)
Talya Eden, Reut Levi, Dana Ron
Testing bounded arboricity. SODA (2018)
Oded Goldreich, Dana Ron
The Subgraph Testing Model. Electron. Colloquium Comput. Complex. 25 (2018)
Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira
Constructing near spanning trees with few local inspections. Random Struct. Algorithms 50 (2) (2017)
Talya Eden, Dana Ron, C. Seshadhri
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. ICALP (2017)
Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri
Provable and practical approximations for the degree distribution using sublinear graph samples. CoRR (2017)
Talya Eden, Reut Levi, Dana Ron
Testing bounded arboricity. CoRR (2017)
Talya Eden, Dana Ron, C. Seshadhri
On Approximating the Number of $k$-cliques in Sublinear Time. CoRR (2017)
Talya Eden, Amit Levi, Dana Ron, C. Seshadhri
Approximately Counting Triangles in Sublinear Time. SIAM J. Comput. 46 (5) (2017)
Oded Goldreich, Dana Ron
On Learning and Testing Dynamic Environments. J. ACM 64 (3) (2017)
Talya Eden, Dana Ron, C. Seshadhri
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. CoRR (2016)
Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. CoRR (2016)
Reut Levi, Dana Ron, Ronitt Rubinfeld
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. CoRR (2016)
Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. Electron. Colloquium Comput. Complex. 23 (2016)
Dana Ron, Gilad Tsur
The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. ACM Trans. Comput. Theory 8 (4) (2016)
Oded Goldreich, Dana Ron
On Sample-Based Testers. ACM Trans. Comput. Theory 8 (2) (2016)
Reut Levi, Dana Ron, Ronitt Rubinfeld
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. APPROX-RANDOM (2016)
Reut Levi, Dana Ron
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. ACM Trans. Algorithms 11 (3) (2015)
Oded Goldreich, Dana Ron
On Sample-Based Testers. ITCS (2015)
Talya Eden, Amit Levi, Dana Ron
Approximately Counting Triangles in Sublinear Time. CoRR (2015)
Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira
Constructing Near Spanning Trees with Few Local Inspections. CoRR (2015)
Talya Eden, Amit Levi, Dana Ron
Approximately Counting Triangles in Sublinear Time. Electron. Colloquium Comput. Complex. 22 (2015)
Guy Even, Moti Medina, Dana Ron
Distributed Maximum Matching in Bounded Degree Graphs. ICDCN (2015)
Clément L. Canonne, Dana Ron, Rocco A. Servedio
Testing Probability Distributions using Conditional Samples. SIAM J. Comput. 44 (3) (2015)
Talya Eden, Amit Levi, Dana Ron, C. Seshadhri
Approximately Counting Triangles in Sublinear Time. FOCS (2015)
Dana Ron, Rocco A. Servedio
Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. Algorithmica 72 (2) (2015)
Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira
Constructing Near Spanning Trees with Few Local Inspections. Electron. Colloquium Comput. Complex. 22 (2015)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Local Algorithms for Sparse Spanning Graphs. CoRR (2014)
Oded Goldreich, Dana Ron
On Learning and Testing Dynamic Environments. FOCS (2014)
Guy Even, Moti Medina, Dana Ron
Best of Two Local Models: Local Centralized and Local Distributed Algorithms. CoRR (2014)
Dana Ron, Gilad Tsur
The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. CoRR (2014)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Similar Means. SIAM J. Discret. Math. 28 (4) (2014)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Local Algorithms for Sparse Spanning Graphs. APPROX-RANDOM (2014)
Oded Goldreich, Dana Ron
On Learning and Testing Dynamic Environments. Electron. Colloquium Comput. Complex. 21 (2014)
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler
Finding cycles and trees in sublinear time. Random Struct. Algorithms 45 (2) (2014)
Guy Even, Moti Medina, Dana Ron
Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs. ESA (2014)
Dana Ron, Gilad Tsur
Testing Properties of Sparse Images. ACM Trans. Algorithms 10 (4) (2014)
Guy Even, Moti Medina, Dana Ron
Distributed Maximum Matching in Bounded Degree Graphs. CoRR (2014)
Clément L. Canonne, Dana Ron, Rocco A. Servedio
Testing equivalence between distributions using conditional samples. SODA (2014)
Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld
A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support CoRR (2013)
Reut Levi, Dana Ron
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor CoRR (2013)
Reut Levi, Dana Ron
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. ICALP (1) (2013)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Properties of Collections of Distributions. Theory Comput. 9 (2013)
Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron
Comparing the strength of query types in property testing: The case of k-colorability. Comput. Complex. 22 (1) (2013)
Dana Ron, Gilad Tsur
On Approximating the Number of Relevant Variables in a Function. ACM Trans. Comput. Theory 5 (2) (2013)
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith
Sublinear Algorithms for Approximating String Compressibility. Algorithmica 65 (3) (2013)
Dana Ron, Rocco A. Servedio
Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. SODA (2013)
Oded Goldreich, Shafi Goldwasser, Dana Ron
On the possibilities and limitations of pseudodeterministic algorithms. ITCS (2013)
Dana Ron, Rocco A. Servedio
Exponentially improved algorithms and lower bounds for testing signed majorities. Electron. Colloquium Comput. Complex. 20 (2013)
Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld
A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support. DCC (2013)
Oded Goldreich, Dana Ron
On Sample-Based Testers. Electron. Colloquium Comput. Complex. 20 (2013)
Clément L. Canonne, Dana Ron, Rocco A. Servedio
Testing probability distributions using conditional samples. Electron. Colloquium Comput. Complex. 19 (2012)
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler
Finding Cycles and Trees in Sublinear Time. Electron. Colloquium Comput. Complex. 19 (2012)
Dana Ron, Gilad Tsur
Testing computability by width-two OBDDs. Theor. Comput. Sci. 420 (2012)

Dana Ron.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dana Ron