The following pages link to Ronitt Rubinfeld (Q315531):
Displaying 50 items.
- A self-tester for linear functions over the integers with an elementary proof of correctness (Q315532) (← links)
- A local decision test for sparse polynomials (Q407596) (← links)
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- The cover time of a regular expander is O(n log n) (Q918708) (← links)
- A competitive 2-server algorithm (Q1182124) (← links)
- Batch checking with applications to linear functions (Q1198028) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- Spot-checkers (Q1577018) (← links)
- Testing shape restrictions of discrete distributions (Q1702847) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Fast approximate PCPs for multidimensional bin-packing problems (Q1767978) (← links)
- Random walks with ``back buttons'' (Q1872455) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Learning fallible deterministic finite automata (Q1900974) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- Learning Polynomials with Queries: The Highly Noisy Case (Q2706184) (← links)
- Checking Approximate Computations of Polynomials and Functional Equations (Q2784470) (← links)
- Selective private function evaluation with applications to private statistics (Q2787694) (← links)
- Sampling Correctors (Q2800556) (← links)
- On the learnability of discrete distributions (Q2817618) (← links)
- Fast approximate PCPs (Q2819532) (← links)
- Testing Similar Means (Q2843288) (← links)
- Local Reconstructors and Tolerant Testers for Connectivity and Diameter (Q2851874) (← links)
- Robust characterizations of <i>k</i> -wise independence over product spaces and related testing results (Q2856576) (← links)
- Maintaining a large matching and a small vertex cover (Q2875173) (← 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)
- Testing Halfspaces (Q3053158) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- (Q3191576) (← links)
- Random walks with “back buttons” (extended abstract) (Q3192018) (← links)
- (Q3212297) (← links)
- Sublinear Time Algorithms (Q3225140) (← links)
- (Q3549649) (← links)
- The complexity of approximating entropy (Q3579192) (← links)
- Monotonicity testing over general poset domains (Q3579209) (← links)
- Sublinear algorithms for testing monotone and unimodal distributions (Q3580983) (← links)
- A sublinear algorithm for weakly approximating edit distance (Q3581249) (← links)
- Testing monotone high-dimensional distributions (Q3581387) (← links)
- Testing Non-uniform k-Wise Independent Distributions over Product Spaces (Q3587408) (← links)
- Testing monotone high‐dimensional distributions (Q3608311) (← links)
- External Sampling (Q3638025) (← links)
- Testing ±1-weight halfspace (Q3638910) (← links)
- On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? (Q4000866) (← links)
- (Q4035721) (← links)
