The following pages link to Ronitt Rubinfeld (Q315531):
Displaying 50 items.
- Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
- (Q4230375) (← links)
- (Q4252714) (← links)
- On the Robustness of Functional Equations (Q4268853) (← links)
- On Testing Convexity and Submodularity (Q4429680) (← links)
- (Q4440424) (← links)
- (Q4471376) (← links)
- (Q4535797) (← links)
- (Q4542544) (← links)
- Sampling Correctors (Q4577769) (← links)
- Testing shape restrictions of discrete distributions (Q4601877) (← links)
- (Q4608053) (← links)
- (Q4633833) (← links)
- A Local Algorithm for Constructing Spanners in Minor-Free Graphs (Q4636471) (← links)
- Reversing trains: A turn of the century sorting problem (Q4729371) (← links)
- Self-testing polynomial functions efficiently and over rational domains (Q4763385) (← links)
- (Q4780800) (← links)
- Testing membership in parenthesis languages (Q4798183) (← links)
- (Q4847919) (← links)
- Robust Characterizations of Polynomials with Applications to Program Testing (Q4877517) (← links)
- Sublinear Algorithms in the External Memory Model (Q4933373) (← links)
- Testing (Subclasses of) Halfspaces (Q4933385) (← links)
- Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) (← links)
- Fractional Set Cover in the Streaming Model. (Q5002615) (← links)
- (Q5090437) (← links)
- Local Computation Algorithms (Q5145171) (← links)
- Improved Local Computation Algorithm for Set Cover via Sparsification (Q5146979) (← links)
- Testing Probability Distributions Underlying Aggregated Data (Q5167749) (← links)
- Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover (Q5197674) (← links)
- Testing Similar Means (Q5246082) (← links)
- Efficient learning of typical finite automata from random walks (Q5248500) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313031) (← links)
- Approximating the Minimum Spanning Tree Weight in Sublinear Time (Q5317201) (← links)
- Testing Closeness of Discrete Distributions (Q5395704) (← links)
- Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions (Q5436976) (← links)
- (Q5491026) (← links)
- (Q5501239) (← links)
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time (Q5700570) (← links)
- The Complexity of Approximating the Entropy (Q5700573) (← links)
- (Q5743463) (← links)
- (Q5743464) (← links)
- Approximating the Noise Sensitivity of a Monotone Boolean Function (Q5875511) (← links)
- (Q5875721) (← links)
- (Q5875722) (← links)
- Sampling Multiple Edges Efficiently (Q6070395) (← links)
- Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time (Q6090913) (← links)
- (Q6126250) (← links)
- Massively parallel algorithms for small subgraph counting (Q6591892) (← links)
- New partitioning techniques and faster algorithms for approximate interval scheduling (Q6614114) (← links)
- New partitioning techniques and faster algorithms for approximate interval scheduling (Q6638045) (← links)
