Rubinfeld, Ronitt - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

Advanced Search

Rubinfeld, Ronitt - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

Exactly Learning Automata with Small Cover Time
Sublinear time algorithms Ravi Kumar Ronitt Rubinfeld y
Short Paths in Expander Graphs Jon Kleinberg \Lambda Ronitt Rubinfeld y
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
A Mathematical Theory of SelfChecking, SelfTesting and SelfCorrecting Ronitt Rubinfeld
Random Walks with \Back Buttons" Ronald Fagin Anna R. Karlin y Jon Kleinberg z Prabhakar Raghavan
The Bloomier Filter: An Ecient Data Structure for Static Support Lookup Tables
Learning polynomials with queries: The highly noisy Oded Goldreich y Ronitt Rubinfeld z Madhu Sudan x
On Learning BoundedWidth Branching Programs \Lambda Funda Erg
, , 1--38 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
Sublinear time Algorithms Ronitt Rubinfeld #
The complexity of approximating the entropy Tu gkan Batu y Sanjoy Dasgupta z Ravi Kumar x Ronitt Rubinfeld {
Approximating the Minimum Spanning Tree Weight in Sublinear Time
Testing Monotone HighDimensional Distributions Ronitt Rubinfeld
Testing random variables for independence and identity # Tugkan Batu + Eldar Fischer # Lance Fortnow Ravi Kumar Ronitt Rubinfeld #
A Sublinear Algorithm for Weakly Approximating Edit gkan Batu
On the robustness of functional equations \Lambda Ronitt Rubinfeld y
Designing Checkers for Programs that Run in Parallel Ronitt Rubinfeld \Lambda
Checking Approximate Computations of Polynomials and Functional Equations
Fast Approximate PCPs for Multidimensional BinPacking Problems ?
Learning Distributions from Random Walks \Lambda Funda Ergun S Ravi Kumar
Efficient Learning of Typical Finite Automata from Random Walks Yoav Freund
Testing that distributions are close Tugkan Batu #
Reconstructing Algebraic Functions from Mixed Data Sigal Ar \Lambda Richard J. Lipton y Ronitt Rubinfeld z Madhu Sudan x
To appear: SIAM J. on Computing, manuscript no. 0255151. Robust Characterizations of Polynomials with
NonAbelian Homomorphism Testing, and Distributions Close to their SelfConvolutions
Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries
SpotCheckers Funda Ergun y Sampath Kannan y S Ravi Kumar z
SelfTesting/Correcting with Applications to Numerical Problems
Runtime Verification of Remotely Executed Code using Probabilistically Checkable Proof Systems
On Testing Convexity and Submodularity Michal Parnas
Testing Membership in Parenthesis Languages Michal Parnas