R. Rubinfeld

发表

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.

Self-testing/correcting for polynomials and for approximate functions

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

Random walks with “back buttons” (extended abstract)

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

Self-testing polynomial functions efficiently and over rational domains

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

Introduction to Number Theory

A. Meyer, R. Rubinfeld, Albert R. Meyer, 2005 .

Learning Fallible Deterministic Finite Automata

D. Ron, R. Rubinfeld, 2004, Machine Learning.

Testing membership in parenthesis languages

D. Ron, Michal Parnas, R. Rubinfeld, 2003, Random Struct. Algorithms.

Sublinear-time approximation of Euclidean minimum spanning tree

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

Sub-linear approximation of euclidean minimum spanning tree

A. Czumaj, A. Magen, R. Rubinfeld, 2005 .

Robust Characterizations of Polynomials and Their Applications to Program Testing

M. Sudan, R. Rubinfeld, 1993 .

A mathematical theory of self-checking, self-testing and self-correcting programs

R. Rubinfeld, 1991 .

Tolerant property testing and distance approximation

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

Open Problems in Data Streams, Property Testing, and Related Topics

David P. Woodruff, T. S. Jayram, Michael W. Mahoney, 2011 .

Testing that distributions are close

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

Testing for Concise Representations

Ilias Diakonikolas, R. Servedio, R. Rubinfeld, 2007, FOCS 2007.

Testing monotone high-dimensional distributions

R. Servedio, R. Rubinfeld, 2009 .

Testing +/- 1-Weight Halfspaces

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

Property Testing of Abelian Group Operations

R. Rubinfeld, S. R. Kumar, 2007 .

Linearity and Group Homomorphism Testing / Testing Hadamard Codes

R. Rubinfeld, Sofya Raskhodnikova, 2015 .

D S ] 2 1 Ja n 20 16 Testing Shape Restrictions of Discrete Distributions

Ilias Diakonikolas, R. Rubinfeld, C. Canonne, 2018 .

{38 () Learning Fallible Deterministic Finite Automata

R. Rubinfeld, 1995 .

Eecient Learning of Typical Finite Automata from Random Walks Extended Abstract

Y. Freund, M. Kearns, D. Ron, 1996 .

Rapid sampling for visualizations with ordering guarantees Citation

Aditya G. Parameswaran, S. Madden, P. Indyk, 2014 .

Reversing Trains: A Turn of the Century Sorting Problem

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

25 : 2 Testing Shape Restrictions of Discrete Distributions restricted inference

Ilias Diakonikolas, R. Rubinfeld, C. Canonne, 2016 .

Linearity Testing/Testing Hadamard Codes

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

Session details: 13A

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

Runtime Verification of Remotely Executed Code using Probabilistically Checkable Proof Systems

R. Rubinfeld, Tugkan Batu, Patrick White, 2006 .

On the robustness of functional equations

R. Rubinfeld, 1994, FOCS.

52 : 2 Approximating the Noise Sensitivity of a Monotone Boolean Function Funding

R. Rubinfeld, A. Vasilyan, 2019 .

Massively Parallel Algorithms for Small Subgraph Counting

Quanquan C. Liu, Amartya Shankha Biswas, R. Rubinfeld, 2020, APPROX/RANDOM.

Parallel Algorithms for Small Subgraph Counting

Quanquan C. Liu, Amartya Shankha Biswas, R. Rubinfeld, 2020, ArXiv.

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

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

Properly learning monotone functions via local reconstruction

R. Rubinfeld, Jane Lange, A. Vasilyan, 2022, ArXiv.

Proceedings of the Annual IEEE Conference on Computational Complexity: Preface

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

Approximation, Randomization and Combinatorial Optimization.

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

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.

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

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

Sublinear Algorithms, 17.07. - 22.07.2005

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

Testing distributional assumptions of learning algorithms

R. Rubinfeld, A. Vasilyan, 2022, ArXiv.

Properly learning monotone functions via local reconstruction

R. Rubinfeld, Jane Lange, A. Vasilyan, 2022, ArXiv.

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

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

2 KEY RESULTS

R. Rubinfeld, 2007 .

Sampling Correctors

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

Testing Tail Weight of a Distribution Via Hazard Rate

Amartya Shankha Biswas, R. Rubinfeld, M. Aliakbarpour, 2020, ArXiv.

1 Polynomial Identity Testing

D. Sontag, R. Rubinfeld, 2006 .

Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks

Justin Y. Chen, P. Indyk, R. Rubinfeld, 2022, NeurIPS.

Sublinear Time

R. Rubinfeld, Eldrian Wu, 2022 .

Robust Functional Equations with Applications to Self-Testing/Correcting

Ronitt Rubinfeld, R. Rubinfeld, 1994 .

Exactly Learning Automata of Small Cover Time

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

Exactly learning automata with small cover time

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

Exploration Strategies for Model-based Learning 37 Convergence Results for Single-step On-policy Reinforcement-learning Algorithms. Machine Learning Journal Exploration Strategies for Model-based Learning Exploration Strategies for Model-based Learning

Y. Mansour, Y. Freund, R. Schapire, 2007 .

Testing Closeness of Discrete Distributions pdf

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

The complexity of approximating the entropy

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

On the learnability of discrete distributions

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

A sublinear algorithm for weakly approximating edit distance

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

Selective private function evaluation with applications to private statistics

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

Local Access to Huge Random Objects Through Partial Sampling

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

Local-Access Generators for Basic Random Graph Models pdf

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

Sublinear Time Algorithms

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

Self-testing/correcting with applications to numerical problems

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

Designing checkers for programs that run in parallel

Ronitt Rubinfeld, R. Rubinfeld, 1996, Algorithmica.

Automatic evaluation of two-fingered grips

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

Automatic two-fingered grip selection

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

Learning fallible Deterministic Finite Automata

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

Learning fallible finite state automata

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

Efficient learning of typical finite automata from random walks

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

Testing Closeness of Discrete Distributions Citation

Warren D. Smith, R. Rubinfeld, L. Fortnow, 2010 .

Rapid Sampling for Visualizations with Ordering Guarantees

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

Rapid sampling for visualizations with ordering guarantees Citation

Aditya G. Parameswaran, S. Madden, P. Indyk, 2014 .

Learning and Testing Junta Distributions

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

Testing Properties of Collections of Distributions

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

Testing ±1-weight halfspace

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

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

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

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

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

On the robustness of functional equations

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

Testing Parenthesis Languages

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

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).

Checking Approximate Computations of Polynomials and Functional Equations

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

Spot-checkers

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

Approximate checking of polynomials and functional equations

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

Testing Shape Restrictions of Discrete Distributions

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

Learning polynomials with queries: The highly noisy case

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

Random walks with `back buttons'

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

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

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

Sublinear Algorithms for Approximating String Compressibility

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

Fast Local Computation Algorithms

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

Maintaining a large matching and a small vertex cover

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

Online Page Migration with ML Advice pdf

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

External Sampling

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

Short paths in expander graphs

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

Local Algorithms for Sparse Spanning Graphs

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

Robust Characterizations of Polynomials with Applications to Program Testing

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

Improved Local Computation Algorithm for Set Cover via Sparsification pdf

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

Set Cover in Sub-linear Time pdf

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

Fractional Set Cover in the Streaming Model

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

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling

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

A Local Algorithm for Constructing Spanners in Minor-Free Graphs

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

Constructing near spanning trees with few local inspections pdf

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

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Klaus Jansen, Leslie Ann Goldberg, R. Ravi, 2006, Lecture Notes in Computer Science.

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

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

Space-efficient local computation algorithms pdf

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

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

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

Differentially Private Identity and Equivalence Testing of Discrete Distributions

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

Approximating the Minimum Spanning Tree Weight in Sublinear Time

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

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

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

Testing Similar Means

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

Triangle and Four Cycle Counting with Predictions in Graph Streams

David P. Woodruff, Justin Y. Chen, P. Indyk, 2022, ICLR.

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

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

On learning bounded-width branching programs

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

A local decision test for sparse polynomials

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

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.

On Testing Convexity and Submodularity

MICHAL PARNAS, DANA RON, RONITT RUBINFELD, 2002, SIAM J. Comput..

Testing monotone high-dimensional distributions

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

Sublinear algorithms for testing monotone and unimodal distributions

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

Differentially Private Identity and Closeness Testing of Discrete Distributions pdf

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

Testing for Concise Representations

Ilias Diakonikolas, R. Servedio, R. Rubinfeld, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Learning Circuits

Ronitt Rubinfeld, Benjamin Snyder, Benjamin Snyder, 2006 .

Fast approximate probabilistically checkable proofs

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

Algorithms column: sublinear time algorithms

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

Testing (Subclasses of) Halfspaces

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

Sublinear Algorithms in the External Memory Model

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

Monotonicity testing over general poset domains

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

Testing random variables for independence and identity

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

Testing k-wise and almost k-wise independence

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

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling

R. Rubinfeld, Slobodan Mitrovi'c, Spencer Compton, 2020, ICALP.

Fast approximate PCPs

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

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling

Amartya Shankha Biswas, R. Rubinfeld, Themis Gouleakis, 2017, Algorithmica.

Local Reconstructors and Tolerant Testers for Connectivity and Diameter

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

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

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

Sampling Correctors

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

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

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

Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity

S. Safra, R. Rubinfeld, Alex Samorodnitsky, 2012, TOCT.

Private Testing of Distributions via Sample Permutations

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

Reconstructing algebraic functions from mixed data

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

Linearity Testing/Testing Hadamard Codes

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

A new modular interpolation algorithm for factoring multivariate polynominals

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

Approximating the Minimum Spanning TreeWeight in Sublinear

Ronitt Rubinfeld, Chazelle, R. Rubinfeld, 2001 .

Robust Chara terizations of Polynomials withAppli ations to Program Testing

Ronitt Rubinfeld, R. Rubinfeld, 1996 .

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

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

Sublinear Time Algorithms for Earth Mover’s Distance

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

Handbook of Big Data

R. Rubinfeld, Eric Blais, 2022 .

Testing Closeness of Discrete Distributions

Warren D. Smith, R. Rubinfeld, L. Fortnow, 2010, JACM.

Random Walks with \Back Buttons"

R. Rubinfeld, S. Rajagopalan, Andrew Tomkins, 2000 .