Ron, Dana - Department of Electrical Engineering-Systems, Tel Aviv University

Advanced Search

Ron, Dana - Department of Electrical Engineering-Systems, Tel Aviv University

Approximating the Distance to Convexity Shahar Fattal
Sublinear Algorithms for Approximating String Compressibility
Bounds on Linear Codes for Network Multicast , Meir Feder, and Dana Ron
On the Benefits of Adaptivity in Property Testing of Dense Graphs School of EE
Scheduling with Conflicts: Online and Offline Algorithms
Learning to model sequences generated by switching distributions Yoav Freund
Testing Computability by Width Two OBDDs School of EE
Property Testing and its connection to Learning and Approximation Oded Goldreich
Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation
Approximating the Distance to Monotonicity in High Dimensions Shahar Fattal
Finding a Dense-Core in Jellyfish graphs Udi Weinsberg
Algorithmic Aspects of Property Testing in the Dense Graphs Model Oded Goldreich
Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries
Testing Computability by Width-Two OBDDs Where the Variable Order is Unknown
Testing Reed Muller Codes Tali Kaufman
Testing Computability by Width-Two OBDDs Property testing is concerned with deciding whether an object (e.g. a graph or a function)
Testing Properties of Collections of Distributions Ronitt Rubinfeld
Testing Properties of Sparse Images School of EE
Algorithmic and Analysis Techniques in Property Testing School of EE
Counting Stars and Other Small Subgraphs in Sublinear Time Department of Mathematics
On Proximity Oblivious Testing Oded Goldreich
Comparing the strength of query types in property testing: The case of testing k-colorability
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
Approximating the Minimum Vertex Cover in Sublinear Time and a Connection to Distributed Algorithms
Testing Triangle-Freeness in General Graphs Tali Kaufman
Approximating Average Parameters of Graphs In Memory of Shimon Even (19352004)
Tight Bounds for Testing Bipartiteness in General Graphs Tali Kaufman
Testing Problems with Sub-Learning Sample Complexity Michael Kearns
Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries
A Sublinear Bipartiteness Tester for Bounded Degree Graphs
Distance Approximation in Bounded-Degree and General Sparse Graphs
Approximating the Influence of Monotone Boolean Functions in n) Query Complexity
On Approximating the Number of Relevant Variables in a Function