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:
Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries. APPROX-RANDOM 2010: 531-544 - [c49]Dana Ron, Gilad Tsur:
Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown. CIAC 2010: 131-142 - [c48]Gilad Tsur, Dana Ron:
Testing Properties of Sparse Images. FOCS 2010: 468-477 - [c47]Mira Gonen, Dana Ron, Yuval Shavitt:
Counting Stars and Other Small Subgraphs in Sublinear Time. SODA 2010: 99-116 - [p2]Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron:
Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. Property Testing 2010: 253-259 - [p1]Oded Goldreich, Dana Ron:
Algorithmic Aspects of Property Testing in the Dense Graphs Model. Property Testing 2010: 295-305 - [i21]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding Cycles and Trees in Sublinear Time. CoRR abs/1007.4230 (2010) - [i20]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Properties of Collections of Distributions. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j47]Dana Ron:
Algorithmic and Analysis Techniques in Property Testing. Found. Trends Theor. Comput. Sci. 5(2): 73-205 (2009) - [j46]Guy Even, Magnús M. Halldórsson, Lotem Kaplan, Dana Ron:
Scheduling with conflicts: online and offline algorithms. J. Sched. 12(2): 199-224 (2009) - [j45]Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam D. Smith:
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. SIAM J. Comput. 39(3): 813-842 (2009) - [j44]Sharon Marko, Dana Ron:
Approximating the distance to properties in bounded-degree and general sparse graphs. ACM Trans. Algorithms 5(2): 22:1-22:28 (2009) - [c46]Oded Goldreich, Dana Ron:
Algorithmic Aspects of Property Testing in the Dense Graphs Model. APPROX-RANDOM 2009: 520-533 - [c45]Dana Ron, Gilad Tsur:
Testing Computability by Width Two OBDDs. APPROX-RANDOM 2009: 686-699 - [c44]Oded Goldreich, Dana Ron:
On proximity oblivious testing. STOC 2009: 141-150 - [i19]Dana Ron, Mira Gonen, Yuval Shavitt:
Counting Stars and Other Small Subgraphs in Sublinear Time. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j43]Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool:
Finding a dense-core in Jellyfish graphs. Comput. Networks 52(15): 2831-2841 (2008) - [j42]Dana Ron:
Property Testing: A Learning Theory Perspective. Found. Trends Mach. Learn. 1(3): 307-402 (2008) - [j41]Oded Goldreich, Dana Ron:
Approximating average parameters of graphs. Random Struct. Algorithms 32(4): 473-493 (2008) - [j40]Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron:
Testing Triangle-Freeness in General Graphs. SIAM J. Discret. Math. 22(2): 786-819 (2008) - [c43]Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron:
Comparing the strength of query types in property testing: the case of testing k-colorability. SODA 2008: 1213-1222 - [i18]Oded Goldreich, Dana Ron:
Algorithmic Aspects of Property Testing in the Dense Graphs Model. Electron. Colloquium Comput. Complex. TR08 (2008) - [i17]Oded Goldreich, Dana Ron:
On Proximity Oblivious Testing. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j39]Dana Ron, Amir Rosenfeld, Salil P. Vadhan:
The hardness of the Expected Decision Depth problem. Inf. Process. Lett. 101(3): 112-118 (2007) - [j38]Michal Parnas, Dana Ron:
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theor. Comput. Sci. 381(1-3): 183-196 (2007) - [c42]Mira Gonen, Dana Ron:
On the Benefits of Adaptivity in Property Testing of Dense Graphs. APPROX-RANDOM 2007: 525-539 - [c41]Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith:
Sublinear Algorithms for Approximating String Compressibility. APPROX-RANDOM 2007: 609-623 - [c40]Dana Ron:
Property Testing: A Learning Theory Perspective. COLT 2007: 1-2 - [c39]Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam D. Smith:
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. FOCS 2007: 559-569 - [c38]Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool:
Finding a Dense-Core in Jellyfish Graphs. WAW 2007: 29-40 - [i16]Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith:
Sublinear Algorithms for Approximating String Compressibility. CoRR abs/0706.1084 (2007) - 2006
- [j37]Michal Parnas, Dana Ron, Ronitt Rubinfeld:
Tolerant property testing and distance approximation. J. Comput. Syst. Sci. 72(6): 1012-1042 (2006) - [j36]Tali Kaufman, Dana Ron:
Testing Polynomials over General Fields. SIAM J. Comput. 36(3): 779-802 (2006) - [c37]Oded Goldreich, Dana Ron:
Approximating Average Parameters of Graphs. APPROX-RANDOM 2006: 363-374 - [c36]Sharon Marko, Dana Ron:
Distance Approximation in Bounded-Degree and General Sparse Graphs. APPROX-RANDOM 2006: 475-486 - [c35]Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron:
Testing triangle-freeness in general graphs. SODA 2006: 279-288 - 2005
- [j35]Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron:
Testing Reed-Muller codes. IEEE Trans. Inf. Theory 51(11): 4032-4039 (2005) - [j34]Tali Kaufman, Dana Ron:
A characterization of low-weight words that span generalized reed-muller codes. IEEE Trans. Inf. Theory 51(11): 4039-4043 (2005) - [i15]Oded Goldreich, Dana Ron:
Approximating Average Parameters of Graphs. Sublinear Algorithms 2005 - [i14]Oded Goldreich, Dana Ron:
Approximating Average Parameters of Graphs. Electron. Colloquium Comput. Complex. TR05 (2005) - [i13]Michal Parnas, Dana Ron:
On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms. Electron. Colloquium Comput. Complex. TR05 (2005) - [i12]Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, Adam D. Smith:
Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j33]Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky:
Testing juntas. J. Comput. Syst. Sci. 68(4): 753-787 (2004) - [j32]Nina Mishra, Dana Ron, Ram Swaminathan:
A New Conceptual Clustering Framework. Mach. Learn. 56(1-3): 115-151 (2004) - [j31]Tali Kaufman, Michael Krivelevich, Dana Ron:
Tight Bounds for Testing Bipartiteness in General Graphs. SIAM J. Comput. 33(6): 1441-1483 (2004) - [j30]Noga Alon, Seannie Dar, Michal Parnas, Dana Ron:
Testing of Clustering. SIAM Rev. 46(2): 285-308 (2004) - [c34]Tali Kaufman, Dana Ron:
Testing Polynomials over General Fields. FOCS 2004: 413-422 - [e1]Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron:
Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings. Lecture Notes in Computer Science 3122, Springer 2004, ISBN 3-540-22894-2 [contents] - [i11]Michal Parnas, Dana Ron, Ronitt Rubinfeld:
Tolerant Property Testing and Distance Approximation. Electron. Colloquium Comput. Complex. TR04 (2004) - [i10]Oded Goldreich, Dana Ron:
On Estimating the Average Degree of a Graph. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j29]Michal Parnas, Dana Ron:
Testing metric properties. Inf. Comput. 187(2): 155-195 (2003) - [j28]Michal Parnas, Dana Ron, Ronitt Rubinfeld:
Testing membership in parenthesis languages. Random Struct. Algorithms 22(1): 98-138 (2003) - [j27]Michal Parnas, Dana Ron, Ronitt Rubinfeld:
On Testing Convexity and Submodularity. SIAM J. Comput. 32(5): 1158-1184 (2003) - [j26]Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky:
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. SIAM J. Comput. 33(1): 94-136 (2003) - [j25]Noga Alon, Seannie Dar, Michal Parnas, Dana Ron:
Testing of Clustering. SIAM J. Discret. Math. 16(3): 393-417 (2003) - [c33]Nina Mishra, Dana Ron, Ram Swaminathan:
On Finding Large Conjunctive Clusters. COLT 2003: 448-462 - [c32]Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron:
Testing Low-Degree Polynomials over GF(2(. RANDOM-APPROX 2003: 188-199 - [c31]Tali Kaufman, Michael Krivelevich, Dana Ron:
Tight Bounds for Testing Bipartiteness in General Graphs. RANDOM-APPROX 2003: 341-353 - [i9]Meir Feder, Dana Ron, Ami Tavory:
Bounds on Linear Codes for Network Multicast. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j24]Oded Goldreich, Dana Ron:
Property Testing in Bounded Degree Graphs. Algorithmica 32(2): 302-343 (2002) - [j23]Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan:
The Power of a Pebble: Exploring and Mapping Directed Graphs. Inf. Comput. 176(1): 1-21 (2002) - [j22]Michal Parnas, Dana Ron:
Testing the diameter of graphs. Random Struct. Algorithms 20(2): 165-183 (2002) - [j21]Michael A. Bender, Dana Ron:
Testing properties of directed graphs: acyclicity and connectivity. Random Struct. Algorithms 20(2): 184-205 (2002) - [j20]Michal Parnas, Dana Ron, Alex Samorodnitsky:
Testing Basic Boolean Formulae. SIAM J. Discret. Math. 16(1): 20-46 (2002) - [c30]Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky:
Testing Juntas. FOCS 2002: 103-112 - [c29]Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky:
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. FOCS 2002: 691-700 - [c28]Michal Parnas, Dana Ron, Ronitt Rubinfeld:
On Testing Convexity and Submodularity. RANDOM 2002: 11-25 - 2001
- [j19]Ilan Kremer, Noam Nisan, Dana Ron:
Errata for: "On randomized one-round communication complexity". Comput. Complex. 10(4): 314-315 (2001) - [j18]Eric Lehman, Dana Ron:
On Disjoint Chains of Subsets. J. Comb. Theory A 94(2): 399-404 (2001) - [c27]Michal Parnas, Dana Ron, Ronitt Rubinfeld:
Testing Parenthesis Languages. RANDOM-APPROX 2001: 261-272 - [c26]Michal Parnas, Dana Ron, Alex Samorodnitsky:
Proclaiming Dictators and Juntas or Testing Boolean Formulae. RANDOM-APPROX 2001: 273-284 - [c25]Michal Parnas, Dana Ron:
Testing metric properties. STOC 2001: 276-285 - [i8]Michal Parnas, Dana Ron, Alex Samorodnitsky:
Proclaiming Dictators and Juntas or Testing Boolean Formulae. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j17]Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky:
Testing Monotonicity. Comb. 20(3): 301-337 (2000) - [j16]Michael J. Kearns, Dana Ron:
Testing Problems with Sublearning Sample Complexity. J. Comput. Syst. Sci. 61(3): 428-456 (2000) - [j15]Oded Goldreich, Dana Ron, Madhu Sudan:
Chinese remaindering with errors. IEEE Trans. Inf. Theory 46(4): 1330-1338 (2000) - [c24]Noga Alon, Seannie Dar, Michal Parnas, Dana Ron:
Testing of Clustering. FOCS 2000: 240-250 - [c23]Michael A. Bender, Dana Ron:
Testing Acyclicity of Directed Graphs in Sublinear Time. ICALP 2000: 809-820 - [i7]Oded Goldreich, Dana Ron:
On Testing Expansion in Bounded-Degree Graphs. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j14]Ilan Kremer, Noam Nisan, Dana Ron:
On Randomized One-Round Communication Complexity. Comput. Complex. 8(1): 21-49 (1999) - [j13]Oded Goldreich, Dana Ron:
A Sublinear Bipartiteness Tester for Bounded Degree Graphs. Comb. 19(3): 335-373 (1999) - [j12]Michael J. Kearns, Dana Ron:
Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation. Neural Comput. 11(6): 1427-1453 (1999) - [j11]Scott E. Decatur, Oded Goldreich, Dana Ron:
Computational Sample Complexity. SIAM J. Comput. 29(3): 854-879 (1999) - [c22]Michal Parnas, Dana Ron:
Testing the Diameter of Graphs. RANDOM-APPROX 1999: 85-96 - [c21]Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky:
Improved Testing Algorithms for Monotonicity. RANDOM-APPROX 1999: 97-108 - [c20]Oded Goldreich, Dana Ron, Madhu Sudan:
Chinese Remaindering with Errors. STOC 1999: 225-234 - [i6]Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky:
Improved Testing Algorithms for Monotonicity. Electron. Colloquium Comput. Complex. TR99 (1999) - [i5]Oded Goldreich, Dana Ron, Madhu Sudan:
Chinese Remaindering with Errors. IACR Cryptol. ePrint Arch. 1999: 2 (1999) - 1998
- [j10]Oded Goldreich, Shafi Goldwasser, Dana Ron:
Property Testing and its Connection to Learning and Approximation. J. ACM 45(4): 653-750 (1998) - [j9]Dana Ron, Yoram Singer, Naftali Tishby:
On the Learnability and Usage of Acyclic Probabilistic Finite Automata. J. Comput. Syst. Sci. 56(2): 133-152 (1998) - [j8]Dana Ron:
Guest Editor's Introduction. Mach. Learn. 30(1): 5-6 (1998) - [c19]Michael J. Kearns, Dana Ron:
Testing Problems with Sub-Learning Sample Complexity. COLT 1998: 268-279 - [c18]Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron:
Testing Monotonicity. FOCS 1998: 426-435 - [c17]Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan:
The Power of a Pebble: Exploring and Mapping Directed Graphs. STOC 1998: 269-278 - [c16]Oded Goldreich, Dana Ron:
A Sublinear Bipartiteness Tester for Bunded Degree Graphs. STOC 1998: 289-298 - [i4]Oded Goldreich, Dana Ron, Madhu Sudan:
Chinese Remaindering with Errors. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j7]Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie:
Efficient Learning of Typical Finite Automata from Random Walks. Inf. Comput. 138(1): 23-48 (1997) - [j6]Oded Goldreich, Dana Ron:
On Universal Learning Algorithms. Inf. Process. Lett. 63(3): 131-136 (1997) - [j5]Michael J. Kearns, Yishay Mansour, Andrew Y. Ng, Dana Ron:
An Experimental and Theoretical Comparison of Model Selection Methods. Mach. Learn. 27(1): 7-50 (1997) - [j4]Dana Ron, Ronitt Rubinfeld:
Exactly Learning Automata of Small Cover Time. Mach. Learn. 27(1): 69-96 (1997) - [c15]Scott E. Decatur, Oded Goldreich, Dana Ron:
Computational Sample Complexity. COLT 1997: 130-142 - [c14]Michael J. Kearns, Dana Ron:
Algorithmic Stability and Sanity-Check Bounds for Leave-one-Out Cross-Validation. COLT 1997: 152-162 - [c13]Oded Goldreich, Dana Ron:
Property Testing in Bounded Degree Graphs. STOC 1997: 406-415 - [i3]Scott E. Decatur, Oded Goldreich, Dana Ron:
Computational Sample Complexity. Electron. Colloquium Comput. Complex. TR97 (1997) - [i2]Scott E. Decatur, Oded Goldreich, Dana Ron:
A Probabilistic Error-Correcting Scheme. IACR Cryptol. ePrint Arch. 1997: 5 (1997) - 1996
- [j3]Michael Ben-Or, Dana Ron:
Agreement in the Presence of Faults, on Networks of Bounded Degree. Inf. Process. Lett. 57(6): 329-334 (1996) - [j2]Dana Ron, Yoram Singer, Naftali Tishby:
The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length. Mach. Learn. 25(2-3): 117-149 (1996) - [c12]Oded Goldreich, Shafi Goldwasser, Dana Ron:
Property Testing and Its Connection to Learning and Approximation. FOCS 1996: 339-348 - [i1]Oded Goldreich, Shafi Goldwasser, Dana Ron:
Property Testing and its connection to Learning and Approximation. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [b1]Dana Ron:
Automata learning and its applications. University of Jerusalem, Israel, Technical report 95-14, 1995, pp. 1-150 - [j1]Dana Ron, Ronitt Rubinfeld:
Learning Fallible Deterministic Finite Automata. Mach. Learn. 18(2-3): 149-185 (1995) - [c11]Michael J. Kearns, Yishay Mansour, Andrew Y. Ng, Dana Ron:
An Experimental and Theoretical Comparison of Model Selection Methods. COLT 1995: 21-30 - [c10]Dana Ron, Yoram Singer, Naftali Tishby:
On the Learnability and Usage of Acyclic Probabilistic Finite Automata. COLT 1995: 31-40 - [c9]Yoav Freund, Dana Ron:
Learning to Model Sequences Generated by Switching Distributions. COLT 1995: 41-50 - [c8]Dana Ron, Ronitt Rubinfeld:
Exactly Learning Automata with Small Cover Time. COLT 1995: 427-436 - [c7]Yoav Freund, Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire:
Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries. FOCS 1995: 332-341 - [c6]Ilan Kremer, Noam Nisan, Dana Ron:
On randomized one-round communication complexity. STOC 1995: 596-605 - 1994
- [c5]Dana Ron, Yoram Singer, Naftali Tishby:
Learning Probabilistic Automata with Variable Memory Length. COLT 1994: 35-46 - [c4]Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie:
On the learnability of discrete distributions. STOC 1994: 273-282 - 1993
- [c3]Dana Ron, Ronitt Rubinfeld:
Learning Fallible Finite State Automata. COLT 1993: 218-227 - [c2]Dana Ron, Yoram Singer, Naftali Tishby:
The Power of Amnesia. NIPS 1993: 176-183 - [c1]Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie:
Efficient learning of typical finite automata from random walks. STOC 1993: 315-324
Coauthor Index
[j83] [j82] [c83] [i64] [i61] [i60] [j75] [p6] [p5] [i57] [c75] [i52] [j71] [j68] [r3] [r2] [r1] [c64] [j63] [c61] [i35] [c57] [i32] [i28] [i27] [j54] [j53] [p3] [p1] [i21] [c46] [c44] [j41] [i18] [i17] [c37] [i15] [i14] [i10] [j24] [j17] [j15] [i7] [j13] [j11] [c21] [c20] [i6] [i5] [j10] [c18] [c16] [i4] [j6] [c15] [c13] [i3] [i2] [c12] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
