Ronitt Rubinfeld

发表

Approximating the Minimum Spanning Tree Weight in Sublinear Time

Ronitt Rubinfeld, Luca Trevisan, 2001, ICALP.

Learning fallible finite state automata

Ronitt Rubinfeld, Dana Ron, D. Ron, 1993, COLT '93.

08341 Executive Summary - Sublinear Algorithms

Ronitt Rubinfeld, Artur Czumaj, S. Muthukrishnan, 2008, Sublinear Algorithms.

05291 Abstracts Collection -- Sublinear Algorithms

Ronitt Rubinfeld, Artur Czumaj, S. Muthukrishnan, 2005, Sublinear Algorithms.

Learning polynomials with queries: The highly noisy case

Ronitt Rubinfeld, Oded Goldreich, Madhu Sudan, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

Sampling Correctors

Ronitt Rubinfeld, Clément L. Canonne, Themis Gouleakis, 2015, Information Technology Convergence and Services.

Batch Checking with Applications to Linear Functions

Ronitt Rubinfeld, 1992, Inf. Process. Lett..

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings

Klaus Jansen, Ronitt Rubinfeld, Ashish Goel, 2008, APPROX-RANDOM.

Local Computation Algorithms (Invited Talk)

Ronitt Rubinfeld, 2017, ICALP.

Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity

Ronitt Rubinfeld, Dana Ron, Alex Samorodnitsky, 2011, APPROX-RANDOM.

Testing Similar Means

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2014, SIAM J. Discret. Math..

Testing (Subclasses of) Halfspaces

Rocco A. Servedio, Ronitt Rubinfeld, Ryan O'Donnell, 2010, Property Testing.

Linearity Testing/Testing Hadamard Codes

Ronitt Rubinfeld, Sofya Raskhodnikova, R. Rubinfeld, 2008, Encyclopedia of Algorithms.

On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?

Sandy Irani, Moni Naor, Ronitt Rubinfeld, 1992, Mathematical systems theory.

Sublinear Time Algorithms

Ronitt Rubinfeld, Asaf Shapira, R. Rubinfeld, 2011, SIAM J. Discret. Math..

Linearity Testing/Testing Hadamard Codes

Ronitt Rubinfeld, R. Rubinfeld, 2008, Encyclopedia of Algorithms.

Exactly learning automata with small cover time

Ronitt Rubinfeld, Dana Ron, D. Ron, 1995, COLT '95.

Testing Probability Distributions Underlying Aggregated Data

Ronitt Rubinfeld, Clément L. Canonne, 2014, ICALP.

Local Computation Algorithms for Graphs of Non-Constant Degrees

Ronitt Rubinfeld, Reut Levi, Anak Yodpinyanee, 2015, SPAA.

Sampling Correctors

Ronitt Rubinfeld, Clément L. Canonne, Themis Gouleakis, 2015, ITCS.

Learning distributions from random walks

Ronitt Rubinfeld, Funda Ergün, Ravi Kumar, 1997, COLT '97.

Robust characterizations of k-wise independence over product spaces and related testing results

Ronitt Rubinfeld, Ning Xie, 2013, Random Struct. Algorithms.

Testing Similar Means

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2012, Electron. Colloquium Comput. Complex..

Self-Testing/Correcting with Applications to Numerical Problems

Manuel Blum, Ronitt Rubinfeld, Michael Luby, 1993, J. Comput. Syst. Sci..

A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2013, 2013 Data Compression Conference.

Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time

Ronitt Rubinfeld, Lance Fortnow, Funda Ergün, 2005, SIAM J. Comput..

Improved Local Computation Algorithm for Set Cover via Sparsification pdf

Ronitt Rubinfeld, Slobodan Mitrovic, Christoph Grunau, 2019, SODA.

Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity

Ronitt Rubinfeld, Dana Ron, Omri Weinstein, 2011, APPROX-RANDOM.

Testing Parenthesis Languages

Ronitt Rubinfeld, Dana Ron, Michal Parnas, 2001, RANDOM-APPROX.

Proceedings of the Annual IEEE Conference on Computational Complexity: Preface

Peter Bro Miltersen, Ronitt Rubinfeld, Luca Trevisan, 2005 .

Fast Approximate PCPs for Multidimensional Bin-Packing Problems

Ronitt Rubinfeld, Tugkan Batu, Patrick White, 1999, RANDOM-APPROX.

Something for (Almost) Nothing: New Advances in Sublinear-Time Algorithms

Ronitt Rubinfeld, Eric Blais, R. Rubinfeld, 2016, Handbook of Big Data.

Approximating the noise sensitivity of a monotone Boolean function

Ronitt Rubinfeld, Arsen Vasilyan, 2019, APPROX-RANDOM.

Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear Samples

Ronitt Rubinfeld, Arsen Vasilyan, 2020, ITCS.

Rapid Sampling for Visualizations with Ordering Guarantees

Ronitt Rubinfeld, Piotr Indyk, Aditya G. Parameswaran, 2014, Proc. VLDB Endow..

Learning and Testing Junta Distributions

Ronitt Rubinfeld, Eric Blais, Maryam Aliakbarpour, 2016, COLT.

Selective private function evaluation with applications to private statistics

Yuval Ishai, Ronitt Rubinfeld, Ran Canetti, 2001, PODC '01.

Sublinear Algorithms for Approximating String Compressibility

Ronitt Rubinfeld, Dana Ron, Sofya Raskhodnikova, 2007, Algorithmica.

Testing Closeness of Discrete Distributions pdf

Ronitt Rubinfeld, Lance Fortnow, Tugkan Batu, 2010, JACM.

Tolerant property testing and distance approximation

Ronitt Rubinfeld, Dana Ron, Michal Parnas, 2006, J. Comput. Syst. Sci..

Testing random variables for independence and identity

Ronitt Rubinfeld, Lance Fortnow, Ravi Kumar, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness

Ronitt Rubinfeld, Sheela Devadas, 2015, Theory of Computing Systems.

Fast approximate PCPs for multidimensional bin-packing problems

Ronitt Rubinfeld, Tugkan Batu, Patrick White, 2005, Inf. Comput..

Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size

Ronitt Rubinfeld, Dana Ron, Sofya Raskhodnikova, 2005, Electron. Colloquium Comput. Complex..

Approximation, Randomization and Combinatorial Optimization.

Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld, 2008 .

A local decision test for sparse polynomials

Kyomin Jung, Ronitt Rubinfeld, Elena Grigorescu, 2010, Inf. Process. Lett..

Testing ±1-weight halfspace

Ryan O'Donnell, Rocco A. Servedio, Ronitt Rubinfeld, 2009, APPROX-RANDOM.

Automatic two-fingered grip selection

Rajiv S. Desai, Ronitt Rubinfeld, Richard A. Volz, 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

Random walks with “back buttons” (extended abstract)

Anna R. Karlin, Ronitt Rubinfeld, Ronald Fagin, 2000, STOC '00.

Robust Characterizations of Polynomials with Applications to Program Testing

Ronitt Rubinfeld, Madhu Sudan, M. Sudan, 1996, SIAM J. Comput..

Efficient algorithms for learning to play repeated games against computationally bounded adversaries

Ronitt Rubinfeld, Dana Ron, Yishay Mansour, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

Testing Mixtures of Discrete Distributions pdf

Ronitt Rubinfeld, Ravi Kumar, Maryam Aliakbarpour, 2019, COLT.

Checking Approximate Computations of Polynomials and Functional Equations

Ronitt Rubinfeld, Funda Ergün, Ravi Kumar, 2002, SIAM J. Comput..

Reversing Trains: A Turn of the Century Sorting Problem

Nancy M. Amato, Sandy Irani, Manuel Blum, 1989, J. Algorithms.

Fractional Set Cover in the Streaming Model

Ronitt Rubinfeld, Piotr Indyk, Sepideh Mahabadi, 2017, APPROX-RANDOM.

Testing Non-uniform k-Wise Independent Distributions over Product Spaces

Ronitt Rubinfeld, Ning Xie, 2010, ICALP.

On the robustness of functional equations

Ronitt Rubinfeld, R. Rubinfeld, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

Session details: 9A

Ronitt Rubinfeld, 2008, STOC '08.

Local Algorithms for Sparse Spanning Graphs pdf

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2014, APPROX-RANDOM.

Local Algorithms for Sparse Spanning Graphs

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2014, Algorithmica.

Efficient Learning of Typical Finite Automata from Random Walks

Ronitt Rubinfeld, Dana Ron, Linda Sellie, 1997, Inf. Comput..

Designing checkers for programs that run in parallel

Ronitt Rubinfeld, R. Rubinfeld, 1996, Algorithmica.

Program Result Checking against Adaptive Programs and in Cryptographic Settings

Manuel Blum, Ronitt Rubinfeld, Michael Luby, 1989, Distributed Computing And Cryptography.

Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions

Ronitt Rubinfeld, Michael Ben-Or, Don Coppersmith, 2008, Random Struct. Algorithms.

Short paths in expander graphs

Ronitt Rubinfeld, Jon M. Kleinberg, J. Kleinberg, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

Session details: 13A

Ronitt Rubinfeld, R. Rubinfeld, 2008, Symposium on the Theory of Computing.

Self-testing/correcting for polynomials and for approximate functions

Ronitt Rubinfeld, Richard J. Lipton, Avi Wigderson, 1991, STOC '91.

Approximate checking of polynomials and functional equations

Ronitt Rubinfeld, Funda Ergün, Ravi Kumar, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

I've Seen "Enough": Incrementally Improving Visualizations to Support Rapid Decision Making

Ronitt Rubinfeld, Karrie Karahalios, Aditya G. Parameswaran, 2017, Proc. VLDB Endow..

Fast approximate probabilistically checkable proofs

Ronitt Rubinfeld, Funda Ergün, Ravi Kumar, 2004, Inf. Comput..

Maintaining a large matching and a small vertex cover

Krzysztof Onak, Ronitt Rubinfeld, R. Rubinfeld, 2010, STOC '10.

Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time

Ronitt Rubinfeld, Piotr Indyk, Reut Levi, 2015, PODS.

Online Page Migration with ML Advice pdf

Ronitt Rubinfeld, Piotr Indyk, Frederik Mallmann-Trenn, 2020, AISTATS.

Improved recommendations via (more) collaboration

Haim Kaplan, Ronitt Rubinfeld, Tova Milo, 2010, WebDB '10.

On Testing Convexity and Submodularity

Ronitt Rubinfeld, Dana Ron, Michal Parnas, 2002, RANDOM.

A new modular interpolation algorithm for factoring multivariate polynominals

Ronitt Rubinfeld, Richard Zippel, R. Rubinfeld, 1994, ANTS.

The complexity of approximating the entropy

Ronitt Rubinfeld, Sanjoy Dasgupta, Ravi Kumar, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Ronitt Rubinfeld, Mohsen Ghaffari, Themis Gouleakis, 2018, PODC.

Testing monotonicity of distributions over general partial orders

Ronitt Rubinfeld, Eldar Fischer, Paul Valiant, 2011, ICS.

Dynamic Approximate Vertex Cover and Maximum Matching

Krzysztof Onak, Ronitt Rubinfeld, 2010, Property Testing.

External Sampling

Alexandr Andoni, Krzysztof Onak, Ronitt Rubinfeld, 2009, ICALP.

A Competitive 2-Server Algorithm

Sandy Irani, Ronitt Rubinfeld, 1991, Inf. Process. Lett..

Constructing near spanning trees with few local inspections pdf

Ronitt Rubinfeld, Dana Ron, Asaf Shapira, 2015, Random Struct. Algorithms.

A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size

Krzysztof Onak, Ronitt Rubinfeld, Dana Ron, 2011, SODA.

Spot-checkers

Ronitt Rubinfeld, Sampath Kannan, Funda Ergün, 1998, STOC '98.

Space-efficient local computation algorithms pdf

Noga Alon, Ronitt Rubinfeld, Shai Vardi, 2011, SODA.

Testing Shape Restrictions of Discrete Distributions

Ronitt Rubinfeld, Ilias Diakonikolas, Clément L. Canonne, 2015, Theory of Computing Systems.

On the learnability of discrete distributions

Ronitt Rubinfeld, Dana Ron, Linda Sellie, 1994, STOC '94.

Local Reconstructors and Tolerant Testers for Connectivity and Diameter

Ronitt Rubinfeld, Alan Guo, Andrea Campagna, 2012, APPROX-RANDOM.

Taming big probability distributions

Ronitt Rubinfeld, 2012, XRDS.

Fast Local Computation Algorithms

Ronitt Rubinfeld, Shai Vardi, Ning Xie, 2011, ICS.

Random walks with `back buttons'

Anna R. Karlin, Ronitt Rubinfeld, Ronald Fagin, 2001, STOC 2000.

Monotonicity testing over general poset domains

Ronitt Rubinfeld, Alex Samorodnitsky, Sofya Raskhodnikova, 2002, STOC '02.

Local Computation Algorithms

Ronitt Rubinfeld, 2019, PODC.

Interactive Proofs with Space Bounded Provers

Ronitt Rubinfeld, Joe Kilian, 1991, CRYPTO.

Testing Properties of Collections of Distributions

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2013, Theory Comput..

Sublinear algorithms for testing monotone and unimodal distributions

Ronitt Rubinfeld, Ravi Kumar, Tugkan Batu, 2004, STOC '04.

Sublinear Algorithms in the External Memory Model

Alexandr Andoni, Krzysztof Onak, Ronitt Rubinfeld, 2010, Property Testing.

Private Testing of Distributions via Sample Permutations

Ronitt Rubinfeld, Daniel M. Kane, Ilias Diakonikolas, 2019, NeurIPS.

Testing Halfspaces

Rocco A. Servedio, Ronitt Rubinfeld, Ryan O'Donnell, 2007, SIAM J. Comput..

Testing Tail Weight of a Distribution Via Hazard Rate pdf

Ronitt Rubinfeld, Maryam Aliakbarpour, Amartya Shankha Biswas, 2020, ArXiv.

Sublinear-time approximation of Euclidean minimum spanning tree

Ronitt Rubinfeld, Lance Fortnow, Funda Ergün, 2003, SODA '03.

On learning bounded-width branching programs

Ronitt Rubinfeld, Funda Ergün, Ravi Kumar, 1995, COLT '95.

Testing for Concise Representations

Rocco A. Servedio, Krzysztof Onak, Ronitt Rubinfeld, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Approximating the Minimum Spanning Tree Weight in Sublinear Time

Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan, 2001, ICALP.

Differentially Private Identity and Closeness Testing of Discrete Distributions pdf

Ronitt Rubinfeld, Ilias Diakonikolas, Maryam Aliakbarpour, 2017, ArXiv.

Amortized Edge Sampling pdf

Ronitt Rubinfeld, Talya Eden, Saleet Mossel, 2020, ArXiv.

Local-Access Generators for Basic Random Graph Models pdf

Ronitt Rubinfeld, Anak Yodpinyanee, Amartya Shankha Biswas, 2017, ArXiv.

Testing k-wise and almost k-wise independence

Noga Alon, Alexandr Andoni, Ronitt Rubinfeld, 2007, STOC '07.

Can We Locally Compute Sparse Connected Subgraphs?

Ronitt Rubinfeld, 2017, CSR.

Self-testing polynomial functions efficiently and over rational domains

Ronitt Rubinfeld, Madhu Sudan, M. Sudan, 1992, SODA '92.

Towards Testing Monotonicity of Distributions Over General Posets

Ronitt Rubinfeld, John Peebles, Themis Gouleakis, 2019, COLT.

A sublinear algorithm for weakly approximating edit distance

Ronitt Rubinfeld, Joe Kilian, Funda Ergün, 2003, STOC '03.

Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation pdf

Ronitt Rubinfeld, John Peebles, Themis Gouleakis, 2016, ArXiv.

08341 Abstracts Collection - Sublinear Algorithms

Ronitt Rubinfeld, Artur Czumaj, S. Muthukrishnan, 2008, Sublinear Algorithms.

Robust Functional Equations with Applications to Self-Testing/Correcting

Ronitt Rubinfeld, R. Rubinfeld, 1994 .

Sublinear Algorithms for Approximating String Compressibility

Ronitt Rubinfeld, Dana Ron, Sofya Raskhodnikova, 2007, APPROX-RANDOM.

Sublinear Algorithms, 17.07. - 22.07.2005

Ronitt Rubinfeld, Artur Czumaj, Christian Sohler, 2006, Sublinear Algorithms.

The complexity of approximating entropy

Ronitt Rubinfeld, Sanjoy Dasgupta, Ravi Kumar, 2002, STOC '02.

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling pdf

Ronitt Rubinfeld, Spencer Compton, Slobodan Mitrovi'c, 2020, ArXiv.

Set Cover in Sub-linear Time pdf

Ronitt Rubinfeld, Piotr Indyk, Sepideh Mahabadi, 2018, SODA.

Sublinear Time Algorithms for Earth Mover’s Distance

Ronitt Rubinfeld, Huy L. Nguyen, Khanh Do Ba, 2009, Theory of Computing Systems.

The complexity of approximating the entropy

Ronitt Rubinfeld, Sanjoy Dasgupta, Ravi Kumar, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

Rapid Approximate Aggregation with Distribution-Sensitive Interval Guarantees

Ronitt Rubinfeld, Aditya G. Parameswaran, Ilias Diakonikolas, 2020, 2021 IEEE 37th International Conference on Data Engineering (ICDE).

Efficient learning of typical finite automata from random walks

Ronitt Rubinfeld, Dana Ron, Linda Sellie, 1993, STOC.

Learning fallible Deterministic Finite Automata

Ronitt Rubinfeld, Dana Ron, D. Ron, 1995, Machine Learning.

A Local Algorithm for Constructing Spanners in Minor-Free Graphs

Ronitt Rubinfeld, Dana Ron, Reut Levi, 2016, APPROX-RANDOM.

The Cover Time of a Regular Expander is O(n log n)

Ronitt Rubinfeld, R. Rubinfeld, 1990, Information Processing Letters.

Approximating and testing k-histogram distributions in sub-linear time

Ronitt Rubinfeld, Piotr Indyk, Reut Levi, 2012, PODS '12.

Local Access to Huge Random Objects Through Partial Sampling

Ronitt Rubinfeld, Anak Yodpinyanee, Amartya Shankha Biswas, 2017, ITCS.

Self-testing/correcting with applications to numerical problems

Manuel Blum, Ronitt Rubinfeld, Michael Luby, 1990, STOC '90.

Differentially Private Identity and Equivalence Testing of Discrete Distributions

Ronitt Rubinfeld, Ilias Diakonikolas, Maryam Aliakbarpour, 2018, ICML.

Reconstructing algebraic functions from mixed data

Ronitt Rubinfeld, Richard J. Lipton, Sigal Ar, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions

Ronitt Rubinfeld, Michael Ben-Or, Don Coppersmith, 2008, Random Struct. Algorithms.

On the Robustness of Functional Equations

Ronitt Rubinfeld, 1999, SIAM J. Comput..

Exactly Learning Automata of Small Cover Time

Ronitt Rubinfeld, Dana Ron, D. Ron, 2004, Machine Learning.

Parallel Algorithms for Small Subgraph Counting pdf

Ronitt Rubinfeld, Quanquan C. Liu, Talya Eden, 2020, ArXiv.

Reconstructing Algebraic Functions from Mixed Data

Ronitt Rubinfeld, Richard J. Lipton, Sigal Ar, 1998, SIAM J. Comput..

Local Computation Algorithms for Graphs of Non-constant Degrees

Ronitt Rubinfeld, Reut Levi, Anak Yodpinyanee, 2016, Algorithmica.

The Bloomier filter: an efficient data structure for static support lookup tables

Bernard Chazelle, Ronitt Rubinfeld, Joe Kilian, 2004, SODA '04.

Algorithms column: sublinear time algorithms

Ronitt Rubinfeld, Ravi Kumar, Ravi Kumar, 2003, SIGA.

Proceedings of the forty-seventh annual ACM symposium on Theory of Computing

Rocco A. Servedio, Ronitt Rubinfeld, 2015, STOC 2015.

Testing monotone high-dimensional distributions

Rocco A. Servedio, Ronitt Rubinfeld, R. Servedio, 2005, STOC '05.

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling

Ronitt Rubinfeld, John Peebles, Themis Gouleakis, 2017, Algorithmica.

Local Computation Algorithms for Spanners pdf

Ronitt Rubinfeld, Merav Parter, Ali Vakilian, 2019, ITCS.

Spot-Checkers

Ronitt Rubinfeld, Sampath Kannan, Funda Ergün, 2000, J. Comput. Syst. Sci..

Fast approximate PCPs

Ronitt Rubinfeld, Funda Ergün, Ravi Kumar, 1999, STOC '99.

Learning Polynomials with Queries: The Highly Noisy Case

Ronitt Rubinfeld, Oded Goldreich, Madhu Sudan, 2000, SIAM J. Discret. Math..

Testing that distributions are close

Ronitt Rubinfeld, Lance Fortnow, Tugkan Batu, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Automatic evaluation of two-fingered grips

Rajiv S. Desai, Ronitt Rubinfeld, Richard A. Volz, 1987, IEEE J. Robotics Autom..

Local Access to Random Walks

Ronitt Rubinfeld, Amartya Shankha Biswas, Edward Pyne, 2022, ITCS.

Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time

Ronitt Rubinfeld, Talya Eden, Amartya Shankha Biswas, 2021, APPROX-RANDOM.

Sampling Multiple Edges Efficiently

Ronitt Rubinfeld, Talya Eden, Saleet Mossel, 2021, APPROX-RANDOM.

Learning-based Support Estimation in Sublinear Time pdf

Ronitt Rubinfeld, Piotr Indyk, Tal Wagner, 2021, ICLR.

Approximating the Minimum Spanning TreeWeight in Sublinear

Ronitt Rubinfeld, Chazelle, R. Rubinfeld, 2001 .

Non-Abelian homomorphism testing, and distributions close to their self-convolutions

Ronitt Rubinfeld, Michael Ben-Or, Don Coppersmith, 2008 .

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms: Preface

Moshe Lewenstein, Peter Winkler, Yossi Azar, 2006, SODA 2006.

Approximate Checking of Polynomials and Functional Equations (extended abstract).

Ronitt Rubinfeld, Funda Ergün, R. Rubinfeld, 1996, IEEE Annual Symposium on Foundations of Computer Science.

On the Time and Space Complexity of Computation Using Write-Once

Sandy Irani, Moni Naor, Ronitt Rubinfeld, 1988 .

Testing +/- 1-Weight Halfspaces

Ryan O'Donnell, Ronitt Rubinfeld, Kevin Matulef, 2009 .

Learning Circuits

Ronitt Rubinfeld, Benjamin Snyder, Benjamin Snyder, 2006 .

Robust Chara terizations of Polynomials withAppli ations to Program Testing

Ronitt Rubinfeld, R. Rubinfeld, 1996 .