default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonitt Rubinfeld
Person information
- affiliation: MIT, Cambridge, USA
- affiliation: Tel Aviv University, Blavatnik School of Computer Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j49]Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld:
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. Algorithmica 86(9): 2997-3026 (2024)- [c94]Slobodan Mitrovic, Ronitt Rubinfeld, Mihir Singhal:
Locally Computing Edge Orientations. ESA 2024: 89:1-89:17 - [i60]Amartya Shankha Biswas, Ruidi Cao, Edward Pyne, Ronitt Rubinfeld:
Average-Case Local Computation Algorithms. CoRR abs/2403.00129 (2024) - 2023
- [c93]Maryam Aliakbarpour, Amartya Shankha Biswas, Kavya Ravichandran, Ronitt Rubinfeld:
Testing Tail Weight of a Distribution Via Hazard Rate. ALT 2023: 34-81 - [c92]Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld:
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. ICALP 2023: 45:1-45:16 - [c91]Ronitt Rubinfeld, Arsen Vasilyan:
Testing Distributional Assumptions of Learning Algorithms. STOC 2023: 1643-1656 - [i59]Martin Farach-Colton, Fabian Daniel Kuhn, Ronitt Rubinfeld, Przemyslaw Uznanski:
From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071). Dagstuhl Reports 13(2): 33-46 (2023) - 2022
- [c90]Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld:
Online Page Migration with ML Advice. AISTATS 2022: 1655-1670 - [c89]Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic:
Massively Parallel Algorithms for Small Subgraph Counting. APPROX/RANDOM 2022: 39:1-39:28 - [c88]Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan:
Properly learning monotone functions via local correction. FOCS 2022: 75-86 - [c87]Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang:
Triangle and Four Cycle Counting with Predictions in Graph Streams. ICLR 2022 - [c86]Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld:
Local Access to Random Walks. ITCS 2022: 24:1-24:22 - [c85]Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner:
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. NeurIPS 2022 - [i58]Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang:
Triangle and Four Cycle Counting with Predictions in Graph Streams. CoRR abs/2203.09572 (2022) - [i57]Ronitt Rubinfeld, Arsen Vasilyan:
Testing distributional assumptions of learning algorithms. CoRR abs/2204.07196 (2022) - [i56]Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan:
Properly learning monotone functions via local reconstruction. CoRR abs/2204.11894 (2022) - [i55]Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner:
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. CoRR abs/2211.03232 (2022) - 2021
- [c84]Talya Eden, Saleet Mossel, Ronitt Rubinfeld:
Sampling Multiple Edges Efficiently. APPROX-RANDOM 2021: 51:1-51:15 - [c83]Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld:
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. APPROX-RANDOM 2021: 55:1-55:19 - [c82]Stephen Macke, Maryam Aliakbarpour
, Ilias Diakonikolas, Aditya G. Parameswaran, Ronitt Rubinfeld:
Rapid Approximate Aggregation with Distribution-Sensitive Interval Guarantees. ICDE 2021: 1703-1714 - [c81]Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner:
Learning-based Support Estimation in Sublinear Time. ICLR 2021 - [i54]Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld:
Local Access to Random Walks. CoRR abs/2102.07740 (2021) - [i53]Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner:
Learning-based Support Estimation in Sublinear Time. CoRR abs/2106.08396 (2021) - [i52]Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld:
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. CoRR abs/2107.06582 (2021) - 2020
- [j48]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Local Algorithms for Sparse Spanning Graphs. Algorithmica 82(4): 747-786 (2020) - [c80]Amartya Shankha Biswas, Ronitt Rubinfeld, Anak Yodpinyanee:
Local Access to Huge Random Objects Through Partial Sampling. ITCS 2020: 27:1-27:65 - [c79]Ronitt Rubinfeld, Arsen Vasilyan:
Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear Samples. ITCS 2020: 28:1-28:34 - [c78]Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian:
Improved Local Computation Algorithm for Set Cover via Sparsification. SODA 2020: 2993-3011 - [i51]Ronitt Rubinfeld, Arsen Vasilyan:
Monotone probability distributions over the Boolean cube can be learned with sublinear samples. CoRR abs/2002.03415 (2020) - [i50]Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Slobodan Mitrovic, Ronitt Rubinfeld:
Parallel Algorithms for Small Subgraph Counting. CoRR abs/2002.08299 (2020) - [i49]Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld:
Online Page Migration with ML Advice. CoRR abs/2006.05028 (2020) - [i48]Stephen Macke, Maryam Aliakbarpour, Ilias Diakonikolas, Aditya G. Parameswaran, Ronitt Rubinfeld:
Rapid Approximate Aggregation with Distribution-Sensitive Interval Guarantees. CoRR abs/2008.03891 (2020) - [i47]Talya Eden, Saleet Mossel, Ronitt Rubinfeld:
Amortized Edge Sampling. CoRR abs/2008.08032 (2020) - [i46]Maryam Aliakbarpour, Amartya Shankha Biswas, Kavya Ravichandran, Ronitt Rubinfeld:
Testing Tail Weight of a Distribution Via Hazard Rate. CoRR abs/2010.02888 (2020) - [i45]Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld:
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. CoRR abs/2012.15002 (2020)
2010 – 2019
- 2019
- [c77]Ronitt Rubinfeld, Arsen Vasilyan:
Approximating the Noise Sensitivity of a Monotone Boolean Function. APPROX-RANDOM 2019: 52:1-52:17 - [c76]Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Towards Testing Monotonicity of Distributions Over General Posets. COLT 2019: 34-82 - [c75]Maryam Aliakbarpour, Ravi Kumar, Ronitt Rubinfeld:
Testing Mixtures of Discrete Distributions. COLT 2019: 83-114 - [c74]Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Local Computation Algorithms for Spanners. ITCS 2019: 58:1-58:21 - [c73]Maryam Aliakbarpour, Ilias Diakonikolas, Daniel Kane, Ronitt Rubinfeld:
Private Testing of Distributions via Sample Permutations. NeurIPS 2019: 10877-10888 - [c72]Ronitt Rubinfeld:
Local Computation Algorithms. PODC 2019: 3 - [i44]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Set Cover in Sub-linear Time. CoRR abs/1902.03534 (2019) - [i43]Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Local Computation Algorithms for Spanners. CoRR abs/1902.08266 (2019) - [i42]Ronitt Rubinfeld, Arsen Vasilyan:
Approximating the noise sensitivity of a monotone Boolean function. CoRR abs/1904.06745 (2019) - [i41]Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Towards Testing Monotonicity of Distributions Over General Posets. CoRR abs/1907.03182 (2019) - [i40]Maryam Aliakbarpour, Ravi Kumar, Ronitt Rubinfeld:
Testing Mixtures of Discrete Distributions. CoRR abs/1907.03190 (2019) - [i39]Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian:
Improved Local Computation Algorithm for Set Cover via Sparsification. CoRR abs/1910.14154 (2019) - 2018
- [j47]Maryam Aliakbarpour, Amartya Shankha Biswas, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling. Algorithmica 80(2): 668-697 (2018) - [j46]Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld:
Testing Shape Restrictions of Discrete Distributions. Theory Comput. Syst. 62(1): 4-62 (2018) - [j45]Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld:
Sampling Correctors. SIAM J. Comput. 47(4): 1373-1423 (2018) - [c71]Maryam Aliakbarpour, Ilias Diakonikolas, Ronitt Rubinfeld:
Differentially Private Identity and Equivalence Testing of Discrete Distributions. ICML 2018: 169-178 - [c70]Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld:
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. PODC 2018: 129-138 - [c69]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Set Cover in Sub-linear Time. SODA 2018: 2467-2486 - [i38]Mohsen Ghaffari, Themis Gouleakis, Slobodan Mitrovic, Ronitt Rubinfeld:
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. CoRR abs/1802.08237 (2018) - 2017
- [j44]Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee:
Local Computation Algorithms for Graphs of Non-constant Degrees. Algorithmica 77(4): 971-994 (2017) - [j43]Sajjadur Rahman, Maryam Aliakbarpour, Hidy Kong, Eric Blais, Karrie Karahalios, Aditya G. Parameswaran, Ronitt Rubinfeld:
I've Seen "Enough": Incrementally Improving Visualizations to Support Rapid Decision Making. Proc. VLDB Endow. 10(11): 1262-1273 (2017) - [j42]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing near spanning trees with few local inspections. Random Struct. Algorithms 50(2): 183-200 (2017) - [c68]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan R. Ullman, Ali Vakilian, Anak Yodpinyanee:
Fractional Set Cover in the Streaming Model. APPROX-RANDOM 2017: 12:1-12:20 - [c67]Ronitt Rubinfeld:
Can We Locally Compute Sparse Connected Subgraphs? CSR 2017: 38-47 - [c66]Ronitt Rubinfeld:
Local Computation Algorithms (Invited Talk). ICALP 2017: 3:1-3:1 - [i37]Maryam Aliakbarpour, Ilias Diakonikolas, Ronitt Rubinfeld:
Differentially Private Identity and Closeness Testing of Discrete Distributions. CoRR abs/1707.05497 (2017) - [i36]Amartya Shankha Biswas, Ronitt Rubinfeld, Anak Yodpinyanee:
Local-Access Generators for Basic Random Graph Models. CoRR abs/1711.10692 (2017) - 2016
- [j41]Sheela Devadas, Ronitt Rubinfeld:
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness. Theory Comput. Syst. 59(1): 99-111 (2016) - [c65]Reut Levi, Dana Ron, Ronitt Rubinfeld:
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. APPROX-RANDOM 2016: 38:1-38:15 - [c64]Maryam Aliakbarpour, Eric Blais, Ronitt Rubinfeld:
Learning and Testing Junta Distributions. COLT 2016: 19-46 - [c63]Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld:
Sampling Correctors. ITCS 2016: 93-102 - [c62]Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld:
Testing Shape Restrictions of Discrete Distributions. STACS 2016: 25:1-25:14 - [p4]Ronitt Rubinfeld, Eric Blais:
Something for (Almost) Nothing: New Advances in Sublinear-Time Algorithms. Handbook of Big Data 2016: 155-167 - [r2]Sofya Raskhodnikova, Ronitt Rubinfeld:
Linearity Testing/Testing Hadamard Codes. Encyclopedia of Algorithms 2016: 1107-1110 - [i35]Maryam Aliakbarpour, Amartya Shankha Biswas, Themistoklis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation. CoRR abs/1601.04233 (2016) - [i34]Reut Levi, Dana Ron, Ronitt Rubinfeld:
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. CoRR abs/1604.07038 (2016) - 2015
- [j40]Albert Kim, Eric Blais, Aditya G. Parameswaran, Piotr Indyk, Samuel Madden, Ronitt Rubinfeld:
Rapid Sampling for Visualizations with Ordering Guarantees. Proc. VLDB Endow. 8(5): 521-532 (2015) - [c61]Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time. PODS 2015: 343 - [c60]Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee:
Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees. SPAA 2015: 59-61 - [e4]Rocco A. Servedio, Ronitt Rubinfeld:
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015. ACM 2015, ISBN 978-1-4503-3536-2 [contents] - [i33]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. CoRR abs/1502.00413 (2015) - [i32]Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee:
Local Computation Algorithms for Graphs of Non-Constant Degrees. CoRR abs/1502.04022 (2015) - [i31]Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld:
Sampling Correctors. CoRR abs/1504.06544 (2015) - [i30]Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld:
Testing Shape Restrictions of Discrete Distributions. CoRR abs/1507.03558 (2015) - [i29]Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j39]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Similar Means. SIAM J. Discret. Math. 28(4): 1699-1724 (2014) - [c59]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Local Algorithms for Sparse Spanning Graphs. APPROX-RANDOM 2014: 826-842 - [c58]Clément L. Canonne, Ronitt Rubinfeld:
Testing Probability Distributions Underlying Aggregated Data. ICALP (1) 2014: 283-295 - [i28]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Local Algorithms for Sparse Spanning Graphs. CoRR abs/1402.3609 (2014) - [i27]Clément L. Canonne, Ronitt Rubinfeld:
Testing probability distributions underlying aggregated data. CoRR abs/1402.3835 (2014) - [i26]Albert Kim, Eric Blais, Aditya G. Parameswaran, Piotr Indyk, Sam Madden, Ronitt Rubinfeld:
Rapid Sampling for Visualizations with Ordering Guarantees. CoRR abs/1412.3040 (2014) - [i25]Sheela Devadas, Ronitt Rubinfeld:
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness. CoRR abs/1412.5484 (2014) - [i24]Clément L. Canonne, Ronitt Rubinfeld:
Testing probability distributions underlying aggregated data. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j38]Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith:
Sublinear Algorithms for Approximating String Compressibility. Algorithmica 65(3): 685-709 (2013) - [j37]Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White:
Testing Closeness of Discrete Distributions. J. ACM 60(1): 4:1-4:25 (2013) - [j36]Ronitt Rubinfeld, Ning Xie:
Robust characterizations of k-wise independence over product spaces and related testing results. Random Struct. Algorithms 43(3): 265-312 (2013) - [j35]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Properties of Collections of Distributions. Theory Comput. 9: 295-347 (2013) - [c57]Andrea Campagna, Alan Guo, Ronitt Rubinfeld:
Local Reconstructors and Tolerant Testers for Connectivity and Diameter. APPROX-RANDOM 2013: 411-424 - [c56]Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld:
A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support. DCC 2013: 113-122 - [i23]Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld:
A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support. CoRR abs/1301.2495 (2013) - 2012
- [j34]Ronitt Rubinfeld:
Taming big probability distributions. XRDS 19(1): 24-28 (2012) - [j33]Dana Ron, Ronitt Rubinfeld, Muli Safra, Alex Samorodnitsky, Omri Weinstein:
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity. ACM Trans. Comput. Theory 4(4): 11:1-11:12 (2012) - [c55]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Similar Means. ICALP (1) 2012: 629-640 - [c54]Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Approximating and testing k-histogram distributions in sub-linear time. PODS 2012: 15-22 - [c53]Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld:
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. SODA 2012: 1123-1131 - [c52]Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie:
Space-efficient local computation algorithms. SODA 2012: 1132-1139 - [i22]Andrea Campagna, Alan Guo, Ronitt Rubinfeld:
Local reconstructors and tolerant testers for connectivity and diameter. CoRR abs/1208.2956 (2012) - [i21]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Similar Means. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j32]Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt Rubinfeld:
Sublinear Time Algorithms for Earth Mover's Distance. Theory Comput. Syst. 48(2): 428-442 (2011) - [j31]Ronitt Rubinfeld, Asaf Shapira:
Sublinear Time Algorithms. SIAM J. Discret. Math. 25(4): 1562-1588 (2011) - [c51]Dana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein:
Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity. APPROX-RANDOM 2011: 664-675 - [c50]Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Properties of Collections of Distributions. ICS 2011: 179-194 - [c49]Ronitt Rubinfeld, Gil Tamir, Shai Vardi, Ning Xie:
Fast Local Computation Algorithms. ICS 2011: 223-238 - [c48]Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant:
Testing monotonicity of distributions over general partial orders. ICS 2011: 239-252 - [i20]Dana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein:
Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity. CoRR abs/1101.5345 (2011) - [i19]Ronitt Rubinfeld, Gil Tamir, Shai Vardi, Ning Xie:
Fast Local Computation Algorithms. CoRR abs/1104.1377 (2011) - [i18]Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie:
Space-efficient Local Computation Algorithms. CoRR abs/1109.6178 (2011) - [i17]Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld:
A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size. CoRR abs/1110.1079 (2011) - [i16]Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Approximating and Testing k-Histogram Distributions in Sub-linear time. Electron. Colloquium Comput. Complex. TR11 (2011) - [i15]Ronitt Rubinfeld, Asaf Shapira:
Sublinear Time Algorithms. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j30]Elena Grigorescu, Kyomin Jung, Ronitt Rubinfeld:
A local decision test for sparse polynomials. Inf. Process. Lett. 110(20): 898-901 (2010) - [j29]Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio:
Testing Halfspaces. SIAM J. Comput. 39(5): 2004-2047 (2010) - [c47]Ronitt Rubinfeld, Ning Xie:
Testing Non-uniform k-Wise Independent Distributions over Product Spaces. ICALP (1) 2010: 565-581 - [c46]Krzysztof Onak, Ronitt Rubinfeld:
Maintaining a large matching and a small vertex cover. STOC 2010: 457-464 - [c45]Rubi Boim, Haim Kaplan, Tova Milo, Ronitt Rubinfeld:
Improved Recommendations via (More) Collaboration. WebDB 2010 - [p3]Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld:
Sublinear Algorithms in the External Memory Model. Property Testing 2010: 240-243 - [p2]