The following pages link to Dana Ron (Q171921):
Displayed 50 items.
- (Q234030) (redirect page) (← links)
- On universal learning algorithms (Q287154) (← links)
- Testing juntas (Q598252) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- The power of amnesia: Learning probabilistic automata with variable memory length (Q676238) (← links)
- A new conceptual clustering framework (Q703081) (← links)
- Testing computability by width-two OBDDs (Q764366) (← links)
- Property testing of the Boolean and binary rank (Q825974) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- The hardness of the expected decision depth problem (Q845910) (← links)
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
- On the learnability and usage of acyclic probabilistic finite automata (Q1271548) (← links)
- On randomized one-round communication complexity (Q1300607) (← links)
- Agreement in the presence of faults, on networks of bounded degree (Q1351635) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- Errata for: ``On randomized one-round communication complexity'' (Q1405739) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Testing metric properties (Q1877548) (← links)
- Learning fallible deterministic finite automata (Q1900974) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- A sublinear bipartiteness tester for bounded degree graphs (Q1964592) (← links)
- Sublinear-time algorithms for approximating graph parameters (Q2075766) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- Finding a dense-core in jellyfish graphs (Q2377899) (← links)
- The Boolean rank of the uniform intersection matrix and a family of its submatrices (Q2419048) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- (Q2754198) (← links)
- On the learnability of discrete distributions (Q2817618) (← links)
- Chinese remaindering with errors (Q2819549) (← links)
- Testing Similar Means (Q2843288) (← links)
- (Q2913798) (← links)
- Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs (Q2921425) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- Approximating the distance to monotonicity in high dimensions (Q2930335) (← links)
- Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (Q2947571) (← links)
- Local Algorithms for Sparse Spanning Graphs (Q2969665) (← links)
- Constructing near spanning trees with few local inspections (Q2977565) (← links)
- On the possibilities and limitations of pseudodeterministic algorithms (Q2986864) (← links)
- On Sample-Based Testers (Q2989048) (← links)
- On Proximity-Oblivious Testing (Q3020015) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- On Testing Expansion in Bounded-Degree Graphs (Q3088177) (← links)
- Property testing and its connection to learning and approximation (Q3158518) (← links)
- (Q3191576) (← links)
- Counting Stars and Other Small Subgraphs in Sublinear-Time (Q3225127) (← links)
- Testing Polynomials over General Fields (Q3446819) (← links)
- Approximating average parameters of graphs (Q3514701) (← links)