D. Ron

发表

Algorithmic stability and sanity-check bounds for leave-one-out cross-validation

M. Kearns, D. Ron, 1999 .

Testing the diameter of graphs

D. Ron, Michal Parnas, 2002 .

Learning probabilistic automata with variable memory length

Dana Ron, Yoram Singer, Naftali Tishby, 1994, COLT '94.

The Power of Amnesia

Dana Ron, Yoram Singer, Naftali Tishby, 1993, NIPS.

The power of amnesia: Learning probabilistic automata with variable memory length

Dana Ron, Yoram Singer, Naftali Tishby, 1996, Machine Learning.

Property Testing

Dana Ron, D. Ron, D. Ron, 2000 .

Efficient algorithms for learning to play repeated games against computationally bounded adversaries

Ronitt Rubinfeld, Dana Ron, Yishay Mansour, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation

Dana Ron, Michael Kearns, M. Kearns, 1997, Neural Computation.

Algorithmic Stability and Sanity-Check Bounds for Leave-one-Out Cross-Validation

Dana Ron, Michael Kearns, M. Kearns, 1997, COLT.

An experimental and theoretical comparison of model selection methods

Dana Ron, Yishay Mansour, Andrew Y. Ng, 1995, COLT '95.

Learning Fallible Deterministic Finite Automata

D. Ron, R. Rubinfeld, 2004, Machine Learning.

Property Testing in Bounded Degree Graphs

Dana Ron, Oded Goldreich, Oded Goldreich, 2002, STOC '97.

Testing membership in parenthesis languages

D. Ron, Michal Parnas, R. Rubinfeld, 2003, Random Struct. Algorithms.

Testing triangle-freeness in general graphs

N. Alon, D. Ron, M. Krivelevich, 2006, SODA 2006.

An Experimental and Theoretical Comparison of Model Selection Methods

Dana Ron, Yishay Mansour, Andrew Y. Ng, 1995, COLT '95.

Property testing and its connection to learning and approximation

Dana Ron, Oded Goldreich, Shafi Goldwasser, 1998, JACM.

On Testing Expansion in Bounded-Degree Graphs

Dana Ron, Oded Goldreich, Oded Goldreich, 2000, Studies in Complexity and Cryptography.

Learning to model sequences generated by switching distributions

Dana Ron, Yoav Freund, Y. Freund, 1995, COLT '95.

On the learnability and usage of acyclic probabilistic finite automata

Dana Ron, Yoram Singer, Naftali Tishby, 1995, COLT '95.

Testing of clustering

Noga Alon, Dana Ron, Michal Parnas, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Testing of Clustering

N. Alon, D. Ron, Michal Parnas, 2003, SIAM J. Discret. Math..

Approximating average parameters of graphs

Oded Goldreich, D. Ron, 2008 .

Tolerant property testing and distance approximation

Ronitt Rubinfeld, Dana Ron, Michal Parnas, 2006, J. Comput. Syst. Sci..

Open Problems in Data Streams, Property Testing, and Related Topics

David P. Woodruff, T. S. Jayram, Michael W. Mahoney, 2011 .

Computational sample complexity

Dana Ron, Oded Goldreich, Scott E. Decatur, 1997, COLT '97.

A Sublinear Bipartiteness Tester for Bounded Degree Graphs

Dana Ron, Oded Goldreich, Oded Goldreich, 1999, Comb..

Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks

Dana Ron, Shakhar Smorodinsky, Guy Even, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

A New Conceptual Clustering Framework

Dana Ron, Nina Mishra, Ram Swaminathan, 2004, Machine Learning.

On Finding Large Conjun tive

D. Ron, R. Swaminathan, ClustersNina Mishra, 2007 .

D S ] 1 1 N ov 2 01 8 Faster sublinear approximations of k-cliques for low arboricity graphs Talya Eden

D. Ron, C. Seshadhri, 2018 .

N ov 2 01 4 Best of Two Local Models : Centralized local and Distributed local Algorithms Guy Even

D. Ron, Moti Medina, 2014 .

Testing equivalence between distributions using conditional samples ∗ ( Extended Abstract )

D. Ron, R. Servedio, C. Canonne, 2022 .

Eecient Learning of Typical Finite Automata from Random Walks Extended Abstract

Y. Freund, M. Kearns, D. Ron, 1996 .

Conflict-Free Colorings of Unit Disks Guy Even

April, D. Ron, Zvi Lotker, 2002 .

Testing Bipartiteness in the Dense-Graph Model

Dana Ron, Oded Goldreich, Oded Goldreich, 2016, Encyclopedia of Algorithms.

A Markovian Lattice Model for the Acquisition of Morphological Structure

Y. Singer, D. Ron, L. Kontorovich, 2003 .

Approximating Average Parameters of Graphs In Memory of Shimon Even (1935{2004)

Oded Goldreich, D. Ron, 2006 .

On the learnability and usage of acyclic probabilistic finite automata

Dana Ron, Yoram Singer, Naftali Tishby, 1995, COLT '95.

MPSG. A unified view of Markov chains and decision trees

José Luis Triviño-Rodriguez, D. Ron, R. Morales-Bueno, 2022 .

Testing Monotonicity

Oded Goldreich, S. Goldwasser, D. Ron, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Faster sublinear approximation of the number of k-cliques in low-arboricity graphs

Dana Ron, Seshadhri Comandur, Talya Eden, 2020, SODA.

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs

D. Ron, Will Rosenbaum, T. Eden, 2022, ICALP.

Estimating Simple Graph Parameters in Sublinear Time

Dana Ron, Oded Goldreich, Oded Goldreich, 2016, Encyclopedia of Algorithms.

On Approximating the Number of Relevant Variables in a Function

Dana Ron, Gilad Tsur, D. Ron, 2011, TOCT.

A Lower Bound on the Complexity of Testing Grained Distributions

Dana Ron, Oded Goldreich, D. Ron, 2021, Electron. Colloquium Comput. Complex..

On Estimating the Average Degree of a Graph

Dana Ron, Oded Goldreich, Oded Goldreich, 2004, Electron. Colloquium Comput. Complex..

Counting stars and other small subgraphs in sublinear time

Dana Ron, Yuval Shavitt, Mira Gonen, 2010, SODA '10.

Testing the diameter of graphs

Dana Ron, Michal Parnas, D. Ron, 1999, RANDOM-APPROX.

Testing Bipartiteness of Graphs in Sublinear Time

Oded Goldreich, D. Ron, 2016, Encyclopedia of Algorithms.

Testing Property of graphs: Introduction and a few examples

Oded Goldreich, D. Ron, Yaron Orenstein, 2008 .

Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities

Rocco A. Servedio, Dana Ron, D. Ron, 2013, Algorithmica.

Scheduling with conflicts: online and offline algorithms

Dana Ron, Magnús M. Halldórsson, Guy Even, 2009, J. Sched..

Scheduling with conflicts: approximation algorithms and online algorithms (コンピュテーション)

Dana Ron, Magnús M. Halldórsson, Guy Even, 2007 .

Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness

Dana Ron, Asaf Rosin, D. Ron, 2021, SODA.

Testing Bipartiteness of Graphs in Sublinear Time

Dana Ron, Oded Goldreich, Oded Goldreich, 2016, Encyclopedia of Algorithms.

The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length

Y. Singer, D. Ron, Naftali Tishby, 2005, Machine-mediated learning.

Property testing of planarity in the CONGEST model

D. Ron, Reut Levi, Moti Medina, 2020, Distributed Computing.

The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity

D. Ron, Yonatan Nakar, 2022, ACRI.

Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities

D. Ron, R. Servedio, 2013, Algorithmica.

Exactly Learning Automata of Small Cover Time

Ronitt Rubinfeld, Dana Ron, D. Ron, 2004, Machine Learning.

Exactly learning automata with small cover time

Ronitt Rubinfeld, Dana Ron, D. Ron, 1995, COLT '95.

On Finding Large Conjunctive Clusters

Dana Ron, Nina Mishra, Ram Swaminathan, 2003, COLT.

Exploration Strategies for Model-based Learning 37 Convergence Results for Single-step On-policy Reinforcement-learning Algorithms. Machine Learning Journal Exploration Strategies for Model-based Learning Exploration Strategies for Model-based Learning

Y. Mansour, Y. Freund, R. Schapire, 2007 .

On the learnability of discrete distributions

Ronitt Rubinfeld, Dana Ron, Linda Sellie, 1994, STOC '94.

Property Testing: A Learning Theory Perspective

Dana Ron, D. Ron, 2007, COLT.

Chinese remaindering with errors

Dana Ron, Oded Goldreich, Madhu Sudan, 1999, STOC '99.

Testing problems with sub-learning sample complexity

Dana Ron, Michael Kearns, M. Kearns, 1998, COLT' 98.

The Subgraph Testing Model

Dana Ron, Oded Goldreich, Oded Goldreich, 2020, Electron. Colloquium Comput. Complex..

Property testing and its connection to learning and approximation

Dana Ron, Oded Goldreich, Shafi Goldwasser, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

Learning fallible Deterministic Finite Automata

Ronitt Rubinfeld, Dana Ron, D. Ron, 1995, Machine Learning.

Automata learning and its applications

Dana Ron, D. Ron, 1995, Technical report.

Learning fallible finite state automata

Ronitt Rubinfeld, Dana Ron, D. Ron, 1993, COLT '93.

Efficient learning of typical finite automata from random walks

Ronitt Rubinfeld, Dana Ron, Linda Sellie, 1993, STOC.

Testing Eulerianity and connectivity in directed sparse graphs

Dana Ron, Yaron Orenstein, D. Ron, 2011, Theor. Comput. Sci..

Testing Properties of Collections of Distributions

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2013, Theory Comput..

The power of a pebble: exploring and mapping directed graphs

Michael A. Bender, Amit Sahai, Dana Ron, 1998, STOC '98.

Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem

Dana Ron, Sofya Raskhodnikova, Adam D. Smith, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity

Ronitt Rubinfeld, Dana Ron, Alex Samorodnitsky, 2011, APPROX-RANDOM.

Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity

Ronitt Rubinfeld, Dana Ron, Omri Weinstein, 2011, APPROX-RANDOM.

Testing juntas

Guy Kindler, Dana Ron, Alex Samorodnitsky, 2002, J. Comput. Syst. Sci..

Testing juntas [combinatorial property testing]

Guy Kindler, Dana Ron, Alex Samorodnitsky, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Testing Parenthesis Languages

Ronitt Rubinfeld, Dana Ron, Michal Parnas, 2001, RANDOM-APPROX.

Sublinear Algorithms for Approximating String Compressibility

Ronitt Rubinfeld, Dana Ron, Sofya Raskhodnikova, 2007, Algorithmica.

On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms

Dana Ron, Michal Parnas, D. Ron, 2007, Electron. Colloquium Comput. Complex..

Property Testing of the Boolean and Binary Rank pdf

Dana Ron, Adi Shraibman, Michal Parnas, 2019, Theory of Computing Systems.

Approximately Counting Triangles in Sublinear Time

Dana Ron, Amit Levi, Talya Eden, 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

Local Algorithms for Sparse Spanning Graphs

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2014, Algorithmica.

A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor

Dana Ron, Reut Levi, D. Ron, 2013, ICALP.

A Sublinear Bipartiteness Tester for Bounded Degree Graphs

Dana Ron, Oded Goldreich, Oded Goldreich, 1998, STOC '98.

Algorithmic and Analysis Techniques in Property Testing

Dana Ron, D. Ron, 2010, Found. Trends Theor. Comput. Sci..

Property Testing in Bounded Degree Graphs

Dana Ron, Oded Goldreich, Oded Goldreich, 1997, STOC.

On approximating the number of k-cliques in sublinear time

Dana Ron, Seshadhri Comandur, Talya Eden, 2017, STOC.

Comparing the strength of query types in property testing: The case of k-colorability

D. Ron, M. Krivelevich, T. Kaufman, 2013, computational complexity.

Comparing the strength of query types in property testing: the case of testing k-colorability

Dana Ron, Michael Krivelevich, Tali Kaufman, 2008, SODA '08.

A Local Algorithm for Constructing Spanners in Minor-Free Graphs

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2016, APPROX-RANDOM.

Constructing near spanning trees with few local inspections pdf

Ronitt Rubinfeld, Dana Ron, Asaf Shapira, 2015, Random Struct. Algorithms.

Testing triangle-freeness in general graphs

Noga Alon, Dana Ron, Michael Krivelevich, 2006, SODA '06.

Finding cycles and trees in sublinear time

Dana Ron, Oded Goldreich, Artur Czumaj, 2010, Random Struct. Algorithms.

Property testing of planarity in the CONGEST model

Dana Ron, Moti Medina, Reut Levi, 2018, Distributed Computing.

Best of two local models: Centralized local and distributed local algorithms

Dana Ron, Moti Medina, Guy Even, 2018, Inf. Comput..

Testing Similar Means

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2012, Electron. Colloquium Comput. Complex..

Faster sublinear approximations of k-cliques for low arboricity graphs pdf

Dana Ron, Seshadhri Comandur, Talya Eden, 2018, SODA 2020.

Counting stars and other small subgraphs in sublinear time

Dana Ron, Yuval Shavitt, Mira Gonen, 2010, SODA '10.

A Markov model for the acquisition of morphological structure

Dana Ron, Yoram Singer, Leonid Kontorovich, 2003 .

On Testing Convexity and Submodularity

MICHAL PARNAS, DANA RON, RONITT RUBINFELD, 2002, SIAM J. Comput..

The Arboricity Captures the Complexity of Sampling Edges pdf

Dana Ron, Will Rosenbaum, Talya Eden, 2019, ICALP.

The Power of an Example pdf

Dana Ron, Gilad Tsur, D. Ron, 2014, ACM Trans. Comput. Theory.

On proximity oblivious testing

Dana Ron, Oded Goldreich, Oded Goldreich, 2009, STOC '09.

The hardness of the Expected Decision Depth problem

Amir Rosenfeld, Dana Ron, Salil P. Vadhan, 2007, Inf. Process. Lett..

On the Benefits of Adaptivity in Property Testing of Dense Graphs

Dana Ron, Mira Gonen, D. Ron, 2010, Algorithmica.

Testing Computability by Width-Two OBDDs

Dana Ron, Gilad Tsur, D. Ron, 2009, Electron. Colloquium Comput. Complex..

Algorithmic Aspects of Property Testing in the Dense Graphs Model

Dana Ron, Oded Goldreich, Oded Goldreich, 2009, Electron. Colloquium Comput. Complex..

Testing metric properties

Dana Ron, Michal Parnas, D. Ron, 2001, STOC '01.

Property Testing: A Learning Theory Perspective

D. Ron, 2007, COLT.

Testing Distributions of Huge Objects

Dana Ron, Oded Goldreich, D. Ron, 2022, Electron. Colloquium Comput. Complex..

Testing properties of directed graphs: acyclicity and connectivity

D. Ron, M. A. Bender, 2002 .

Tight Bounds for Testing Bipartiteness in General Graphs

Dana Ron, Michael Krivelevich, Tali Kaufman, 2004, RANDOM-APPROX.

Testing Problems with Sublearning Sample Complexity

Dana Ron, Michael Kearns, M. Kearns, 2000, J. Comput. Syst. Sci..

Testing the diameter of graphs

Dana Ron, Michal Parnas, D. Ron, 1999, RANDOM-APPROX.

Improved Testing Algorithms for Monotonicity

Dana Ron, Alex Samorodnitsky, Sofya Raskhodnikova, 1999, Electron. Colloquium Comput. Complex..

Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples

D. Ron, Seshadhri Comandur, Ali Pinar, 2017, WWW.

Testing Bounded Arboricity

Dana Ron, Reut Levi, Talya Eden, 2017, SODA.

A pr 2 01 6 Sublinear Time Estimation of Degree Distribution Moments : The Arboricity Connection ( Full Version ) Talya Eden pdf

Dana Ron, Seshadhri Comandur, Talya Eden, 2016 .

Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection

Dana Ron, Seshadhri Comandur, Talya Eden, 2016, ICALP.

Finding a Dense-Core in Jellyfish Graphs

Dana Ron, Avishai Wool, Mira Gonen, 2007, WAW.

Testing Reed-Muller codes

Noga Alon, Dana Ron, Simon Litsyn, 2005, IEEE Transactions on Information Theory.

Testing polynomials over general fields

Dana Ron, Tali Kaufman, D. Ron, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Approximating the Arboricity in Sublinear Time pdf

Dana Ron, Talya Eden, Saleet Mossel, 2021, SODA.

On Sample-Based Testers

Dana Ron, Oded Goldreich, Oded Goldreich, 2016, TOCT.

On Sample-Based Testers

Oded Goldreich, D. Ron, 2015, ITCS.

Testing Low-Degree Polynomials over GF(2(

Noga Alon, Dana Ron, Simon Litsyn, 2003, RANDOM-APPROX.

Testing Basic Boolean Formulae

Dana Ron, Alex Samorodnitsky, Michal Parnas, 2002, SIAM J. Discret. Math..

On the possibilities and limitations of pseudodeterministic algorithms

Dana Ron, Oded Goldreich, Shafi Goldwasser, 2013, ITCS '13.

A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size

Krzysztof Onak, Ronitt Rubinfeld, Dana Ron, 2011, SODA.

Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection

D. Ron, C. Seshadhri, T. Eden, 2016, SIAM J. Discret. Math..

The Boolean rank of the uniform intersection matrix and a family of its submatrices

D. Ron, Michal Parnas, A. Shraibman, 2019, Linear Algebra and its Applications.

On Learning and Testing Dynamic Environments

Dana Ron, Oded Goldreich, Oded Goldreich, 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

On the Benefits of Adaptivity in Property Testing of Dense Graphs

Dana Ron, Mira Gonen, D. Ron, 2007, APPROX-RANDOM.