default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDana Ron
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j84]Omer Cohen Sidon, Dana Ron
:
Sample-Based Distance-Approximation for Subsequence-Freeness. Algorithmica 86(8): 2519-2556 (2024)- [c87]Talya Eden, Reut Levi, Dana Ron:
Testing C_k-Freeness in Bounded-Arboricity Graphs. ICALP 2024: 60:1-60:20 - [i67]Talya Eden, Reut Levi, Dana Ron:
Testing Ck-freeness in bounded-arboricity graphs. CoRR abs/2404.18126 (2024) - 2023
- [j83]Oded Goldreich, Dana Ron:
A Lower Bound on the Complexity of Testing Grained Distributions. Comput. Complex. 32(2): 11 (2023) - [j82]Oded Goldreich, Dana Ron:
Testing Distributions of Huge Objects. TheoretiCS 2 (2023) - [c86]Omer Cohen Sidon, Dana Ron:
Sample-Based Distance-Approximation for Subsequence-Freeness. ICALP 2023: 44:1-44:19 - [i66]Omer Cohen Sidon, Dana Ron:
Sample-based distance-approximation for subsequence-freeness. CoRR abs/2305.01358 (2023) - 2022
- [j81]Dana Ron, Asaf Rosin:
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error. ACM Trans. Comput. Theory 14(1): 4:1-4:31 (2022) - [c85]Yonatan Nakar, Dana Ron:
The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity. ACRI 2022: 63-72 - [c84]Talya Eden, Dana Ron, Will Rosenbaum:
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs. ICALP 2022: 56:1-56:19 - [c83]Oded Goldreich, Dana Ron:
Testing Distributions of Huge Objects. ITCS 2022: 78:1-78:19 - [c82]Talya Eden, Saleet Mossel, Dana Ron:
Approximating the Arboricity in Sublinear Time. SODA 2022: 2404-2425 - [i65]Yonatan Nakar, Dana Ron:
The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity. CoRR abs/2205.08972 (2022) - [i64]Oded Goldreich, Dana Ron:
Testing Distributions of Huge Objects. CoRR abs/2212.12802 (2022) - 2021
- [j80]Reut Levi, Moti Medina, Dana Ron:
Property testing of planarity in the CONGEST model. Distributed Comput. 34(1): 15-32 (2021) - [j79]Michal Parnas, Dana Ron, Adi Shraibman:
Property Testing of the Boolean and Binary Rank. Theory Comput. Syst. 65(8): 1193-1210 (2021) - [c81]Yonatan Nakar, Dana Ron:
Testing Dynamic Environments: Back to Basics. ICALP 2021: 98:1-98:20 - [c80]Dana Ron, Asaf Rosin:
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness. SODA 2021: 337-256 - [c79]Nimrod Fiat, Dana Ron:
On Efficient Distance Approximation for Graph Properties. SODA 2021: 1618-1637 - [i63]Yonatan Nakar, Dana Ron:
Testing Dynamic Environments: Back to Basics. CoRR abs/2105.00759 (2021) - [i62]Talya Eden, Saleet Mossel, Dana Ron:
Approximating the Arboricity in Sublinear Time. CoRR abs/2110.15260 (2021) - [i61]Oded Goldreich, Dana Ron:
A Lower Bound on the Complexity of Testing Grained Distributions. Electron. Colloquium Comput. Complex. TR21 (2021) - [i60]Oded Goldreich, Dana Ron:
Testing Distributions of Huge Objects. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j78]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Local Algorithms for Sparse Spanning Graphs. Algorithmica 82(4): 747-786 (2020) - [j77]Talya Eden, Dana Ron, C. Seshadhri:
On Approximating the Number of k-Cliques in Sublinear Time. SIAM J. Comput. 49(4): 747-771 (2020) - [j76]Talya Eden, Reut Levi, Dana Ron:
Testing Bounded Arboricity. ACM Trans. Algorithms 16(2): 18:1-18:22 (2020) - [j75]Oded Goldreich, Dana Ron:
The Subgraph Testing Model. ACM Trans. Comput. Theory 12(4): 28:1-28:32 (2020) - [c78]Dana Ron, Asaf Rosin:
Almost Optimal Distribution-Free Sample-Based Testing of k-Modality. APPROX-RANDOM 2020: 27:1-27:19 - [c77]Talya Eden, Dana Ron, C. Seshadhri:
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs. SODA 2020: 1467-1478 - [p6]Scott E. Decatur, Oded Goldreich, Dana Ron:
A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy. Computational Complexity and Property Testing 2020: 1-8 - [p5]Oded Goldreich, Dana Ron:
On the Relation Between the Relative Earth Mover Distance and the Variation Distance (an Exposition). Computational Complexity and Property Testing 2020: 141-151 - [i59]Nimrod Fiat, Dana Ron:
On Efficient Distance Approximation for Graph Properties. CoRR abs/2001.01452 (2020) - [i58]Talya Eden, Dana Ron, Will Rosenbaum:
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting. CoRR abs/2012.04090 (2020) - [i57]Oded Goldreich, Dana Ron:
One-Sided Error Testing of Monomials and Affine Subspaces. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j74]Talya Eden, Dana Ron, C. Seshadhri:
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. SIAM J. Discret. Math. 33(4): 2267-2285 (2019) - [j73]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): 24:1-24:33 (2019) - [c76]Talya Eden, Dana Ron, Will Rosenbaum:
The Arboricity Captures the Complexity of Sampling Edges. ICALP 2019: 52:1-52:14 - [c75]Oded Goldreich, Dana Ron:
The Subgraph Testing Model. ITCS 2019: 37:1-37:19 - [p4]Dana Ron:
Sublinear-Time Algorithms for Approximating Graph Parameters. Computing and Software Science 2019: 105-122 - [i56]Talya Eden, Dana Ron, Will Rosenbaum:
The Arboricity Captures the Complexity of Sampling Edges. CoRR abs/1902.08086 (2019) - [i55]Michal Parnas, Dana Ron, Adi Shraibman:
Property testing of the Boolean and binary rank. CoRR abs/1908.11632 (2019) - 2018
- [j72]Guy Even, Moti Medina, Dana Ron:
Best of two local models: Centralized local and distributed local algorithms. Inf. Comput. 262: 69-89 (2018) - [c74]Yonatan Nakar, Dana Ron:
On the Testability of Graph Partition Properties. APPROX-RANDOM 2018: 53:1-53:13 - [c73]Reut Levi, Moti Medina, Dana Ron:
Property Testing of Planarity in the CONGEST model. PODC 2018: 347-356 - [c72]Talya Eden, Reut Levi, Dana Ron:
Testing bounded arboricity. SODA 2018: 2081-2092 - [c71]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: 2113-2132 - [c70]Talya Eden, Dana Ron, C. Seshadhri:
On approximating the number of k-cliques in sublinear time. STOC 2018: 722-734 - [c69]Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri:
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. WWW 2018: 449-458 - [i54]Reut Levi, Moti Medina, Dana Ron:
Property Testing of Planarity in the CONGEST model. CoRR abs/1805.10657 (2018) - [i53]Talya Eden, Dana Ron, C. Seshadhri:
Faster sublinear approximations of k-cliques for low arboricity graphs. CoRR abs/1811.04425 (2018) - [i52]Oded Goldreich, Dana Ron:
The Subgraph Testing Model. Electron. Colloquium Comput. Complex. TR18 (2018) - [i51]Yonatan Nakar, Dana Ron:
On the Testability of Graph Partition Properties. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j71]Oded Goldreich, Dana Ron:
On Learning and Testing Dynamic Environments. J. ACM 64(3): 21:1-21:90 (2017) - [j70]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing near spanning trees with few local inspections. Random Struct. Algorithms 50(2): 183-200 (2017) - [j69]Talya Eden, Amit Levi, Dana Ron, C. Seshadhri:
Approximately Counting Triangles in Sublinear Time. SIAM J. Comput. 46(5): 1603-1646 (2017) - [c68]Talya Eden, Dana Ron, C. Seshadhri:
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. ICALP 2017: 7:1-7:13 - [i50]Talya Eden, Dana Ron, C. Seshadhri:
On Approximating the Number of $k$-cliques in Sublinear Time. CoRR abs/1707.04858 (2017) - [i49]Talya Eden, Reut Levi, Dana Ron:
Testing bounded arboricity. CoRR abs/1707.04864 (2017) - [i48]Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri:
Provable and practical approximations for the degree distribution using sublinear graph samples. CoRR abs/1710.08607 (2017) - 2016
- [j68]Oded Goldreich, Dana Ron:
On Sample-Based Testers. ACM Trans. Comput. Theory 8(2): 7:1-7:54 (2016) - [j67]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): 15:1-15:19 (2016) - [c67]Reut Levi, Dana Ron, Ronitt Rubinfeld:
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. APPROX-RANDOM 2016: 38:1-38:15 - [r3]Oded Goldreich, Dana Ron:
Estimating Simple Graph Parameters in Sublinear Time. Encyclopedia of Algorithms 2016: 650-653 - [r2]Oded Goldreich, Dana Ron:
Testing Bipartiteness in the Dense-Graph Model. Encyclopedia of Algorithms 2016: 2212-2216 - [r1]Oded Goldreich, Dana Ron:
Testing Bipartiteness of Graphs in Sublinear Time. Encyclopedia of Algorithms 2016: 2216-2219 - [i47]Talya Eden, Dana Ron, C. Seshadhri:
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. CoRR abs/1604.03661 (2016) - [i46]Reut Levi, Dana Ron, Ronitt Rubinfeld:
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. CoRR abs/1604.07038 (2016) - [i45]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 abs/1607.03938 (2016) - [i44]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. TR16 (2016) - 2015
- [j66]Dana Ron, Rocco A. Servedio:
Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. Algorithmica 72(2): 400-429 (2015) - [j65]Clément L. Canonne, Dana Ron, Rocco A. Servedio:
Testing Probability Distributions using Conditional Samples. SIAM J. Comput. 44(3): 540-616 (2015) - [j64]Reut Levi, Dana Ron:
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. ACM Trans. Algorithms 11(3): 24:1-24:13 (2015) - [c66]Talya Eden, Amit Levi, Dana Ron, C. Seshadhri:
Approximately Counting Triangles in Sublinear Time. FOCS 2015: 614-633 - [c65]Guy Even, Moti Medina, Dana Ron:
Distributed Maximum Matching in Bounded Degree Graphs. ICDCN 2015: 18:1-18:10 - [c64]Oded Goldreich, Dana Ron:
On Sample-Based Testers. ITCS 2015: 337-345 - [i43]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. CoRR abs/1502.00413 (2015) - [i42]Talya Eden, Amit Levi, Dana Ron:
Approximately Counting Triangles in Sublinear Time. CoRR abs/1504.00954 (2015) - [i41]Talya Eden, Amit Levi, Dana Ron:
Approximately Counting Triangles in Sublinear Time. Electron. Colloquium Comput. Complex. TR15 (2015) - [i40]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j63]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding cycles and trees in sublinear time. Random Struct. Algorithms 45(2): 139-184 (2014) - [j62]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Similar Means. SIAM J. Discret. Math. 28(4): 1699-1724 (2014) - [j61]Dana Ron, Gilad Tsur:
Testing Properties of Sparse Images. ACM Trans. Algorithms 10(4): 17:1-17:52 (2014) - [c63]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Local Algorithms for Sparse Spanning Graphs. APPROX-RANDOM 2014: 826-842 - [c62]Guy Even, Moti Medina, Dana Ron:
Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs. ESA 2014: 394-405 - [c61]Oded Goldreich, Dana Ron:
On Learning and Testing Dynamic Environments. FOCS 2014: 336-343 - [c60]Clément L. Canonne, Dana Ron, Rocco A. Servedio:
Testing equivalence between distributions using conditional samples. SODA 2014: 1174-1192 - [i39]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Local Algorithms for Sparse Spanning Graphs. CoRR abs/1402.3609 (2014) - [i38]Guy Even, Moti Medina, Dana Ron:
Best of Two Local Models: Local Centralized and Local Distributed Algorithms. CoRR abs/1402.3796 (2014) - [i37]Dana Ron, Gilad Tsur:
The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. CoRR abs/1404.5568 (2014) - [i36]Guy Even, Moti Medina, Dana Ron:
Distributed Maximum Matching in Bounded Degree Graphs. CoRR abs/1407.7882 (2014) - [i35]Oded Goldreich, Dana Ron:
On Learning and Testing Dynamic Environments. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j60]Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith:
Sublinear Algorithms for Approximating String Compressibility. Algorithmica 65(3): 685-709 (2013) - [j59]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): 89-135 (2013) - [j58]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Properties of Collections of Distributions. Theory Comput. 9: 295-347 (2013) - [j57]Dana Ron, Gilad Tsur:
On Approximating the Number of Relevant Variables in a Function. ACM Trans. Comput. Theory 5(2): 7:1-7:19 (2013) - [c59]Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld:
A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support. DCC 2013: 113-122 - [c58]Reut Levi, Dana Ron:
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. ICALP (1) 2013: 709-720 - [c57]Oded Goldreich, Shafi Goldwasser, Dana Ron:
On the possibilities and limitations of pseudodeterministic algorithms. ITCS 2013: 127-138 - [c56]Dana Ron, Rocco A. Servedio:
Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. SODA 2013: 1319-1336 - [i34]Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld:
A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support. CoRR abs/1301.2495 (2013) - [i33]Reut Levi, Dana Ron:
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. CoRR abs/1302.3417 (2013) - [i32]Oded Goldreich, Dana Ron:
On Sample-Based Testers. Electron. Colloquium Comput. Complex. TR13 (2013) - [i31]Dana Ron, Rocco A. Servedio:
Exponentially improved algorithms and lower bounds for testing signed majorities. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j56]Dana Ron, Gilad Tsur:
Testing computability by width-two OBDDs. Theor. Comput. Sci. 420: 64-79 (2012) - [j55]Dana Ron, Ronitt Rubinfeld, Muli Safra, Alex Samorodnitsky, Omri Weinstein:
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity. ACM Trans. Comput. Theory 4(4): 11:1-11:12 (2012) - [c55]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Similar Means. ICALP (1) 2012: 629-640 - [c54]Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld:
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. SODA 2012: 1123-1131 - [i30]Clément L. Canonne, Dana Ron, Rocco A. Servedio:
Testing probability distributions using conditional samples. CoRR abs/1211.2664 (2012) - [i29]Clément L. Canonne, Dana Ron, Rocco A. Servedio:
Testing probability distributions using conditional samples. Electron. Colloquium Comput. Complex. TR12 (2012) - [i28]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding Cycles and Trees in Sublinear Time. Electron. Colloquium Comput. Complex. TR12 (2012) - [i27]Oded Goldreich, Shafi Goldwasser, Dana Ron:
On the possibilities and limitations of pseudodeterministic algorithms. Electron. Colloquium Comput. Complex. TR12 (2012) - [i26]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Similar Means. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j54]Oded Goldreich, Dana Ron:
Algorithmic Aspects of Property Testing in the Dense Graphs Model. SIAM J. Comput. 40(2): 376-445 (2011) - [j53]Oded Goldreich, Dana Ron:
On Proximity-Oblivious Testing. SIAM J. Comput. 40(2): 534-566 (2011) - [j52]Mira Gonen, Dana Ron, Yuval Shavitt:
Counting Stars and Other Small Subgraphs in Sublinear-Time. SIAM J. Discret. Math. 25(3): 1365-1411 (2011) - [j51]Yaron Orenstein, Dana Ron:
Testing Eulerianity and connectivity in directed sparse graphs. Theor. Comput. Sci. 412(45): 6390-6408 (2011) - [j50]Elya Dolev, Dana Ron:
Distribution-Free Testing for Monomials with a Sublinear Number of Queries. Theory Comput. 7(1): 155-176 (2011) - [c53]Dana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein:
Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity. APPROX-RANDOM 2011: 664-675 - [c52]Dana Ron, Gilad Tsur:
On Approximating the Number of Relevant Variables in a Function. APPROX-RANDOM 2011: 676-687 - [c51]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Properties of Collections of Distributions. ICS 2011: 179-194 - [p3]Oded Goldreich, Dana Ron:
On Testing Expansion in Bounded-Degree Graphs. Studies in Complexity and Cryptography 2011: 68-75 - [i25]Dana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein:
Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity. CoRR abs/1101.5345 (2011) - [i24]Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld:
A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size. CoRR abs/1110.1079 (2011) - [i23]Dana Ron, Gilad Tsur:
Testing Computability by Width-Two OBDDs. Electron. Colloquium Comput. Complex. TR11 (2011) - [i22]Dana Ron, Gilad Tsur:
On Approximating the Number of Relevant Variables in a Function. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j49]Mira Gonen, Dana Ron:
On the Benefits of Adaptivity in Property Testing of Dense Graphs. Algorithmica 58(4): 811-830 (2010) - [j48]Shahar Fattal, Dana Ron:
Approximating the distance to monotonicity in high dimensions. ACM Trans. Algorithms 6(3): 52:1-52:37 (2010) - [c50]Elya Dolev, Dana Ron