The following pages link to Dana Ron (Q171921):
Displayed 50 items.
- Testing Reed–Muller Codes (Q3546491) (← links)
- A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes (Q3547113) (← links)
- Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown (Q3562998) (← links)
- (Q3579435) (← links)
- Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries (Q3588432) (← links)
- Distance Approximation in Bounded-Degree and General Sparse Graphs (Q3595402) (← links)
- Approximating Average Parameters of Graphs (Q3595407) (← links)
- On the Benefits of Adaptivity in Property Testing of Dense Graphs (Q3603491) (← links)
- (Q3615896) (← links)
- Testing Triangle-Freeness in General Graphs (Q3629476) (← links)
- Testing Computability by Width Two OBDDs (Q3638913) (← links)
- (Q4234109) (← links)
- On Testing Convexity and Submodularity (Q4429680) (← links)
- (Q4440424) (← links)
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks (Q4441902) (← links)
- Testing of Clustering (Q4443096) (← links)
- Chinese remaindering with errors (Q4501745) (← links)
- (Q4527008) (← links)
- (Q4542547) (← links)
- Testing the diameter of graphs (Q4543626) (← links)
- Testing properties of directed graphs: acyclicity and connectivity* (Q4543627) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- Testing Bounded Arboricity (Q4608029) (← links)
- (Q4608031) (← links)
- A Local Algorithm for Constructing Spanners in Minor-Free Graphs (Q4636471) (← links)
- On Learning and Testing Dynamic Environments (Q4640293) (← links)
- Tight Bounds for Testing Bipartiteness in General Graphs (Q4651520) (← links)
- Testing of Clustering (Q4652253) (← links)
- (Q4780800) (← links)
- (Q4780801) (← links)
- Testing Basic Boolean Formulae (Q4785704) (← links)
- (Q4788610) (← links)
- Testing membership in parenthesis languages (Q4798183) (← links)
- Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability (Q4933375) (← links)
- Algorithmic Aspects of Property Testing in the Dense Graphs Model (Q4933381) (← links)
- (Q4941828) (← links)
- (Q4941829) (← links)
- Computational Sample Complexity (Q4943849) (← links)
- Testing Properties of Sparse Images (Q4962151) (← links)
- A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor (Q4962182) (← links)
- Approximating the distance to properties in bounded-degree and general sparse graphs (Q4962788) (← links)
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- On Sample-Based Testers (Q4973851) (← links)
- The Power of an Example (Q4973860) (← links)
- (Q5009551) (← links)
- (Q5090414) (← links)
- (Q5091207) (← links)
- A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy (Q5098765) (← links)
- On the Relation Between the Relative Earth Mover Distance and the Variation Distance (an Exposition) (Q5098774) (← links)
- (Q5111336) (← links)