| 2025 | ICALP | Let's Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation (Invited Talk). | Dana Ron |
| 2025 | STOC | Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time. | Talya Eden, Reut Levi, Dana Ron, Ronitt Rubinfeld |
| 2024 | ICALP | Testing C_k-Freeness in Bounded-Arboricity Graphs. | Talya Eden, Reut Levi, Dana Ron |
| 2023 | ICALP | Sample-Based Distance-Approximation for Subsequence-Freeness. | Omer Cohen Sidon, Dana Ron |
| 2022 | ICALP | Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs. | Talya Eden, Dana Ron, Will Rosenbaum |
| 2022 | SODA | Approximating the Arboricity in Sublinear Time. | Talya Eden, Saleet Mossel, Dana Ron |
| 2021 | ICALP | Testing Dynamic Environments: Back to Basics. | Yonatan Nakar, Dana Ron |
| 2021 | SODA | On Efficient Distance Approximation for Graph Properties. | Nimrod Fiat, Dana Ron |
| 2021 | SODA | Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness. | Dana Ron, Asaf Rosin |
| 2020 | SODA | Faster sublinear approximation of the number of | Talya Eden, Dana Ron, C. Seshadhri |
| 2019 | ICALP | The Arboricity Captures the Complexity of Sampling Edges. | Talya Eden, Dana Ron, Will Rosenbaum |
| 2018 | PODC | Property Testing of Planarity in the CONGEST model. | Reut Levi, Moti Medina, Dana Ron |
| 2018 | WWW | Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. | Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri |
| 2018 | SODA | Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. | Eric Blais, Clment L. Canonne, Talya Eden, Amit Levi, Dana Ron |
| 2018 | SODA | Testing bounded arboricity. | Talya Eden, Reut Levi, Dana Ron |
| 2018 | STOC | On approximating the number of k-cliques in sublinear time. | Talya Eden, Dana Ron, C. Seshadhri |
| 2017 | ICALP | Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. | Talya Eden, Dana Ron, C. Seshadhri |
| 2015 | FOCS | Approximately Counting Triangles in Sublinear Time. | Talya Eden, Amit Levi, Dana Ron, C. Seshadhri |
| 2015 | ICDCN | Distributed Maximum Matching in Bounded Degree Graphs. | Guy Even, Moti Medina, Dana Ron |
| 2014 | ESA | Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs. | Guy Even, Moti Medina, Dana Ron |
| 2014 | FOCS | On Learning and Testing Dynamic Environments. | Oded Goldreich, Dana Ron |
| 2014 | SODA | Testing equivalence between distributions using conditional samples. | Clment L. Canonne, Dana Ron, Rocco A. Servedio |
| 2013 | DCC | A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support. | Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld |
| 2013 | ICALP | A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. | Reut Levi, Dana Ron |
| 2013 | SODA | Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. | Dana Ron, Rocco A. Servedio |
| 2012 | ICALP | Testing Similar Means. | Reut Levi, Dana Ron, Ronitt Rubinfeld |
| 2012 | SODA | A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. | Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld |
| 2010 | CIAC | Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown. | Dana Ron, Gilad Tsur |
| 2010 | FOCS | Testing Properties of Sparse Images. | Gilad Tsur, Dana Ron |
| 2010 | SODA | Counting Stars and Other Small Subgraphs in Sublinear Time. | Mira Gonen, Dana Ron, Yuval Shavitt |
| 2009 | STOC | On proximity oblivious testing. | Oded Goldreich, Dana Ron |
| 2008 | SODA | Comparing the strength of query types in property testing: the case of testing | Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron |
| 2007 | COLT | Property Testing: A Learning Theory Perspective. | Dana Ron |
| 2007 | FOCS | Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. | Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam D. Smith |
| 2007 | WAW | Finding a Dense-Core in Jellyfish Graphs. | Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool |
| 2006 | SODA | Testing triangle-freeness in general graphs. | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron |
| 2004 | FOCS | Testing Polynomials over General Fields. | Tali Kaufman, Dana Ron |
| 2003 | COLT | On Finding Large Conjunctive Clusters. | Nina Mishra, Dana Ron, Ram Swaminathan |
| 2002 | FOCS | Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. | Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky |
| 2002 | FOCS | Testing Juntas. | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky |
| 2001 | STOC | Testing metric properties. | Michal Parnas, Dana Ron |
| 2000 | FOCS | Testing of Clustering. | Noga Alon, Seannie Dar, Michal Parnas, Dana Ron |
| 2000 | ICALP | Testing Acyclicity of Directed Graphs in Sublinear Time. | Michael A. Bender, Dana Ron |
| 1999 | STOC | Chinese Remaindering with Errors. | Oded Goldreich, Dana Ron, Madhu Sudan |
| 1998 | COLT | Testing Problems with Sub-Learning Sample Complexity. | Michael J. Kearns, Dana Ron |
| 1998 | FOCS | Testing Monotonicity. | Oded Goldreich, Shafi Goldwasser, Eric P. Lehman, Dana Ron |
| 1998 | STOC | The Power of a Pebble: Exploring and Mapping Directed Graphs. | Michael A. Bender, Antonio Fernndez, Dana Ron, Amit Sahai, Salil P. Vadhan |
| 1998 | STOC | A Sublinear Bipartiteness Tester for Bunded Degree Graphs. | Oded Goldreich, Dana Ron |
| 1997 | COLT | Computational Sample Complexity. | Scott E. Decatur, Oded Goldreich, Dana Ron |
| 1997 | COLT | Algorithmic Stability and Sanity-Check Bounds for Leave-one-Out Cross-Validation. | Michael J. Kearns, Dana Ron |
| 1997 | STOC | Property Testing in Bounded Degree Graphs. | Oded Goldreich, Dana Ron |
| 1996 | FOCS | Property Testing and Its Connection to Learning and Approximation. | Oded Goldreich, Shafi Goldwasser, Dana Ron |
| 1995 | COLT | Learning to Model Sequences Generated by Switching Distributions. | Yoav Freund, Dana Ron |
| 1995 | COLT | An Experimental and Theoretical Comparison of Model Selection Methods. | Michael J. Kearns, Yishay Mansour, Andrew Y. Ng, Dana Ron |
| 1995 | COLT | Exactly Learning Automata with Small Cover Time. | Dana Ron, Ronitt Rubinfeld |
| 1995 | COLT | On the Learnability and Usage of Acyclic Probabilistic Finite Automata. | Dana Ron, Yoram Singer, Naftali Tishby |
| 1995 | FOCS | Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries. | Yoav Freund, Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire |
| 1995 | STOC | On randomized one-round communication complexity. | Ilan Kremer, Noam Nisan, Dana Ron |
| 1994 | COLT | Learning Probabilistic Automata with Variable Memory Length. | Dana Ron, Yoram Singer, Naftali Tishby |
| 1994 | STOC | On the learnability of discrete distributions. | Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie |
| 1993 | COLT | Learning Fallible Finite State Automata. | Dana Ron, Ronitt Rubinfeld |
| 1993 | STOC | Efficient learning of typical finite automata from random walks. | Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie |