Dana Ron | Academic Influence

Dana Ron's AcademicInfluence.com Rankings

Dana Ron

Computer Science

#947

World Rank

#982

Historical Rank

Database

#7683

World Rank

#7983

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Dana Ron's Degrees

PhD Computer Science Tel Aviv University
Masters Computer Science Tel Aviv University
Bachelors Computer Science Tel Aviv University

Similar Degrees You Can Earn

Why Is Dana Ron Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Dana Ron Goldreich is a computer scientist, a professor of electrical engineering at the Tel Aviv University, Israel. Prof. Ron is one of the pioneers of research in property testing, and a leading researcher in that area.

(See a Problem?)

Dana Ron's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Property testing and its connection to learning and approximation (1996) (1109)
Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation (1997) (547)
The power of amnesia: Learning probabilistic automata with variable memory length (1996) (501)
Property Testing in Bounded Degree Graphs (2002) (332)
On the learnability of discrete distributions (1994) (292)
The power of a pebble: exploring and mapping directed graphs (1998) (247)
Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks (2002) (229)
Testing Monotonicity (1998) (216)
Chinese remaindering with errors (1999) (212)
An Experimental and Theoretical Comparison of Model Selection Methods (1995) (209)
Algorithmic and Analysis Techniques in Property Testing (2010) (187)
On the learnability and usage of acyclic probabilistic finite automata (1995) (182)
Tolerant property testing and distance approximation (2006) (179)
On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms (2007) (174)
Improved Testing Algorithms for Monotonicity (1999) (161)
A Sublinear Bipartiteness Tester for Bounded Degree Graphs (1998) (155)
On Testing Expansion in Bounded-Degree Graphs (2000) (147)
Approximating average parameters of graphs (2006) (139)
Testing the diameter of graphs (1999) (135)
Testing juntas (2002) (134)
The Power of Amnesia (1993) (132)
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem (2007) (132)
Property Testing: A Learning Theory Perspective (2007) (132)
Approximately Counting Triangles in Sublinear Time (2015) (125)
Testing Reed-Muller codes (2005) (125)
Tight Bounds for Testing Bipartiteness in General Graphs (2004) (119)
Learning probabilistic automata with variable memory length (1994) (119)
Testing Low-Degree Polynomials over GF(2( (2003) (112)
Property Testing in Bounded Degree Graphs (1997) (105)
Testing of clustering (2000) (103)
Testing Basic Boolean Formulae (2002) (99)
Efficient learning of typical finite automata from random walks (1993) (95)
Testing polynomials over general fields (2004) (94)
Counting stars and other small subgraphs in sublinear time (2010) (85)
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size (2011) (85)
On proximity oblivious testing (2009) (79)
Scheduling with conflicts: online and offline algorithms (2009) (74)
A New Conceptual Clustering Framework (2004) (69)
Testing triangle-freeness in general graphs (2006) (69)
Bounds on Linear Codes for Network Multicast (2003) (68)
On approximating the number of k-cliques in sublinear time (2017) (66)
Testing probability distributions using conditional samples (2012) (60)
Testing Properties of Collections of Distributions (2013) (59)
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor (2013) (59)
Finding cycles and trees in sublinear time (2010) (50)
Approximating the distance to properties in bounded-degree and general sparse graphs (2009) (50)
Testing Problems with Sublearning Sample Complexity (2000) (47)
The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length (2005) (43)
Efficient algorithms for learning to play repeated games against computationally bounded adversaries (1995) (43)
Computational sample complexity (1997) (41)
Distance Approximation in Bounded-Degree and General Sparse Graphs (2006) (35)
Algorithmic Aspects of Property Testing in the Dense Graphs Model (2009) (35)
On Finding Large Conjunctive Clusters (2003) (34)
On Sample-Based Testers (2016) (33)
On Testing Convexity and Submodularity (2002) (33)
On Disjoint Chains of Subsets (2001) (33)
Testing metric properties (2001) (32)
Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs (2014) (31)
Distributed Maximum Matching in Bounded Degree Graphs (2014) (31)
Approximating the distance to monotonicity in high dimensions (2010) (31)
Sublinear Algorithms for Approximating String Compressibility (2007) (29)
Local Algorithms for Sparse Spanning Graphs (2014) (29)
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (2011) (29)
Testing equivalence between distributions using conditional samples (2014) (28)
On the possibilities and limitations of pseudodeterministic algorithms (2013) (27)
Testing properties of directed graphs: acyclicity and connectivity * (2002) (27)
Best of Two Local Models: Local Centralized and Local Distributed Algorithms (2014) (27)
Testing problems with sub-learning sample complexity (1998) (26)
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples (2017) (25)
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs (2020) (25)
Automata learning and its applications (1995) (23)
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection (2016) (22)
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism (2016) (22)
Testing membership in parenthesis languages (2003) (22)
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (2016) (22)
Testing Bounded Arboricity (2017) (21)
On the Benefits of Adaptivity in Property Testing of Dense Graphs (2010) (21)
The Arboricity Captures the Complexity of Sampling Edges (2019) (21)
Proclaiming Dictators and Juntas or Testing Boolean Formulae (2001) (21)
Open Problems in Data Streams, Property Testing, and Related Topics (2011) (21)
Testing Acyclicity of Directed Graphs in Sublinear Time (2000) (20)
Testing properties of directed graphs: acyclicity and connectivity (2002) (19)
Testing Computability by Width-Two OBDDs (2009) (18)
Comparing the strength of query types in property testing: the case of testing k-colorability (2008) (18)
Learning to model sequences generated by switching distributions (1995) (18)
Testing Properties of Sparse Images (2010) (17)
Distribution-Free Testing for Monomials with a Sublinear Number of Queries (2011) (17)
The Power of an Example (2014) (16)
Constructing near spanning trees with few local inspections (2015) (16)
A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support (2013) (15)
Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities (2013) (15)
Property Testing (2008) (14)
A Markov model for the acquisition of morphological structure (2003) (13)
Testing Parenthesis Languages (2001) (11)
On Estimating the Average Degree of a Graph (2004) (11)
Learning fallible finite state automata (1993) (11)
Finding a Dense-Core in Jellyfish Graphs (2007) (10)
Testing Eulerianity and connectivity in directed sparse graphs (2011) (10)
A Local Algorithm for Constructing Spanners in Minor-Free Graphs (2016) (10)
Property testing of planarity in the CONGEST model (2018) (10)
On Approximating the Number of Relevant Variables in a Function (2011) (9)
Exactly learning automata with small cover time (1995) (8)
Best of two local models: Centralized local and distributed local algorithms (2018) (8)
Learning Fallible Deterministic Finite Automata (2004) (8)
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting (2020) (8)
On the Benefits of Adaptivity in Property Testing of Dense Graphs (2007) (7)
Sublinear-Time Algorithms for Approximating Graph Parameters (2019) (6)
Faster sublinear approximations of k-cliques for low arboricity graphs (2018) (6)
On the Testability of Graph Partition Properties (2018) (6)
On Sample-Based Testers (2015) (6)
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness (2021) (6)
On Universal Learning Algorithms (1997) (5)
Testing Similar Means (2012) (5)
Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown (2010) (5)
Testing juntas [combinatorial property testing] (2002) (5)
Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size (2005) (4)
Learning fallible Deterministic Finite Automata (1995) (4)
Comparing the strength of query types in property testing: The case of k-colorability (2013) (4)
On Learning and Testing Dynamic Environments (2014) (4)
Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries (2010) (4)
The Boolean rank of the uniform intersection matrix and a family of its submatrices (2019) (3)
Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (2011) (3)
Almost Optimal Distribution-Free Sample-Based Testing of k-Modality (2020) (3)
A Probabilistic Error-Correcting Scheme (1997) (3)
A Lower Bound on the Complexity of Testing Grained Distributions (2021) (3)
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs (2022) (2)
Conflict-Free Colorings of Unit Disks Guy Even (2002) (2)
The hardness of the Expected Decision Depth problem (2007) (2)
On the Relation Between the Relative Earth Mover Distance and the Variation Distance (an Exposition) (2020) (2)
On Efficient Distance Approximation for Graph Properties (2020) (2)
Property testing of planarity in the CONGEST model (2020) (1)
Eecient Learning of Typical Finite Automata from Random Walks Extended Abstract (1996) (1)
Local Algorithms for Sparse Spanning Graphs (2019) (1)
Scheduling with conflicts: approximation algorithms and online algorithms (コンピュテーション) (2007) (1)
One-Sided Error Testing of Monomials and Affine Subspaces (2020) (1)
Estimating Simple Graph Parameters in Sublinear Time (2016) (1)
Sublinear Algorithms for Approximating String Compressibility (2012) (1)
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error (2022) (1)
Exactly Learning Automata of Small Cover Time (2004) (1)
Testing Distributions of Huge Objects (2022) (1)
Approximating the Arboricity in Sublinear Time (2021) (1)
The Subgraph Testing Model (2020) (1)
Property Testing of the Boolean and Binary Rank (2019) (1)
Monotonicity Testing Jul 1 5* (2013) (0)
Sample-based distance-approximation for subsequence-freeness (2023) (0)
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 (2007) (0)
Comparing the strength of query types in property testing: The case of k-colorability (2012) (0)
A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy (2020) (0)
Computational Complexity: a Conceptual Perspective Organization and Chapter Summaries (0)
MPSG. A unified view of Markov chains and decision trees (0)
Preface to SICOMP ' s Special Issueon Randomness and ComplexityOded (2014) (0)
Testing Property of graphs: Introduction and a few examples (2008) (0)
In memory of the second author's loving father, Yaakov (Yasha) Rosenfeld (2006) (0)
A Markovian Lattice Model for the Acquisition of Morphological Structure (2003) (0)
Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities (2013) (0)
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 (2007) (0)
Testing Dynamic Environments: Back to Basics (2021) (0)
Testing Bipartiteness in the Dense-Graph Model (2016) (0)
The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity (2022) (0)
On Finding Large Conjun tive (2007) (0)
Testing Bipartiteness of Graphs in Sublinear Time (2016) (0)
D S ] 1 1 N ov 2 01 8 Faster sublinear approximations of k-cliques for low arboricity graphs Talya Eden (2018) (0)
Testing equivalence between distributions using conditional samples ∗ ( Extended Abstract ) (0)
Approximating Average Parameters of Graphs In Memory of Shimon Even (1935{2004) (2006) (0)
A characterization of low-weight words that span generalized reed-muller codes (2005) (0)
N ov 2 01 4 Best of Two Local Models : Centralized local and Distributed local Algorithms Guy Even (2014) (0)

This paper list is powered by the following services:

Other Resources About Dana Ron

en.wikipedia.org

What Schools Are Affiliated With Dana Ron?

Dana Ron is affiliated with the following schools:

Image Attributions

Image Source for Dana Ron