Ronitt Rubinfeld

Publication Activity (10 Years)

Years Active: 1986-2023
Publications (10 Years): 74

Top Venues

CoRR

APPROX-RANDOM

ITCS

Algorithmica

Publications

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) (2023)
Maryam Aliakbarpour, Amartya Shankha Biswas, Kavya Ravichandran, Ronitt Rubinfeld
Testing Tail Weight of a Distribution Via Hazard Rate. ALT (2023)
Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. ICALP (2023)
Ronitt Rubinfeld, Arsen Vasilyan
Testing Distributional Assumptions of Learning Algorithms. STOC (2023)
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 (2022)
Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld
Online Page Migration with ML Advice. AISTATS (2022)
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 (2022)
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)
Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan
Properly learning monotone functions via local reconstruction. CoRR (2022)
Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld
Local Access to Random Walks. ITCS (2022)
Ronitt Rubinfeld, Arsen Vasilyan
Testing distributional assumptions of learning algorithms. CoRR (2022)
Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan
Properly learning monotone functions via local correction. FOCS (2022)
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)
Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic
Massively Parallel Algorithms for Small Subgraph Counting. APPROX/RANDOM (2022)
Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. APPROX-RANDOM (2021)
Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. CoRR (2021)
Talya Eden, Saleet Mossel, Ronitt Rubinfeld
Sampling Multiple Edges Efficiently. APPROX-RANDOM (2021)
Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner
Learning-based Support Estimation in Sublinear Time. CoRR (2021)
Stephen Macke, Maryam Aliakbarpour, Ilias Diakonikolas, Aditya G. Parameswaran, Ronitt Rubinfeld
Rapid Approximate Aggregation with Distribution-Sensitive Interval Guarantees. ICDE (2021)
Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld
Local Access to Random Walks. CoRR (2021)
Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner
Learning-based Support Estimation in Sublinear Time. ICLR (2021)
Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian
Improved Local Computation Algorithm for Set Cover via Sparsification. SODA (2020)
Stephen Macke, Maryam Aliakbarpour, Ilias Diakonikolas, Aditya G. Parameswaran, Ronitt Rubinfeld
Rapid Approximate Aggregation with Distribution-Sensitive Interval Guarantees. CoRR (2020)
Amartya Shankha Biswas, Ronitt Rubinfeld, Anak Yodpinyanee
Local Access to Huge Random Objects Through Partial Sampling. ITCS (2020)
Maryam Aliakbarpour, Amartya Shankha Biswas, Kavya Ravichandran, Ronitt Rubinfeld
Testing Tail Weight of a Distribution Via Hazard Rate. CoRR (2020)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Local Algorithms for Sparse Spanning Graphs. Algorithmica 82 (4) (2020)
Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Slobodan Mitrovic, Ronitt Rubinfeld
Parallel Algorithms for Small Subgraph Counting. CoRR (2020)
Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld
Online Page Migration with ML Advice. CoRR (2020)
Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. CoRR (2020)
Talya Eden, Saleet Mossel, Ronitt Rubinfeld
Amortized Edge Sampling. CoRR (2020)
Ronitt Rubinfeld, Arsen Vasilyan
Monotone probability distributions over the Boolean cube can be learned with sublinear samples. CoRR (2020)
Ronitt Rubinfeld, Arsen Vasilyan
Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear Samples. ITCS (2020)
Ronitt Rubinfeld, Arsen Vasilyan
Approximating the Noise Sensitivity of a Monotone Boolean Function. APPROX-RANDOM (2019)
Ronitt Rubinfeld
Local Computation Algorithms. PODC (2019)
Maryam Aliakbarpour, Ravi Kumar, Ronitt Rubinfeld
Testing Mixtures of Discrete Distributions. CoRR (2019)
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Set Cover in Sub-linear Time. CoRR (2019)
Ronitt Rubinfeld, Arsen Vasilyan
Approximating the noise sensitivity of a monotone Boolean function. CoRR (2019)
Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee
Towards Testing Monotonicity of Distributions Over General Posets. CoRR (2019)
Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Local Computation Algorithms for Spanners. ITCS (2019)
Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Local Computation Algorithms for Spanners. CoRR (2019)
Maryam Aliakbarpour, Ravi Kumar, Ronitt Rubinfeld
Testing Mixtures of Discrete Distributions. COLT (2019)
Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee
Towards Testing Monotonicity of Distributions Over General Posets. COLT (2019)
Maryam Aliakbarpour, Ilias Diakonikolas, Daniel Kane, Ronitt Rubinfeld
Private Testing of Distributions via Sample Permutations. NeurIPS (2019)
Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian
Improved Local Computation Algorithm for Set Cover via Sparsification. CoRR (2019)
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) (2018)
Maryam Aliakbarpour, Ilias Diakonikolas, Ronitt Rubinfeld
Differentially Private Identity and Equivalence Testing of Discrete Distributions. ICML (2018)
Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld
Testing Shape Restrictions of Discrete Distributions. Theory Comput. Syst. 62 (1) (2018)
Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld
Sampling Correctors. SIAM J. Comput. 47 (4) (2018)
Mohsen Ghaffari, Themis Gouleakis, Slobodan Mitrovic, Ronitt Rubinfeld
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. CoRR (2018)
Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. PODC (2018)
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Set Cover in Sub-linear Time. SODA (2018)
Amartya Shankha Biswas, Ronitt Rubinfeld, Anak Yodpinyanee
Local-Access Generators for Basic Random Graph Models. CoRR (2017)
Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira
Constructing near spanning trees with few local inspections. Random Struct. Algorithms 50 (2) (2017)
Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee
Local Computation Algorithms for Graphs of Non-constant Degrees. Algorithmica 77 (4) (2017)
Ronitt Rubinfeld
Local Computation Algorithms (Invited Talk). ICALP (2017)
Ronitt Rubinfeld
Can We Locally Compute Sparse Connected Subgraphs? CSR (2017)
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) (2017)
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan R. Ullman, Ali Vakilian, Anak Yodpinyanee
Fractional Set Cover in the Streaming Model. APPROX-RANDOM (2017)
Maryam Aliakbarpour, Ilias Diakonikolas, Ronitt Rubinfeld
Differentially Private Identity and Closeness Testing of Discrete Distributions. CoRR (2017)
Reut Levi, Dana Ron, Ronitt Rubinfeld
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. CoRR (2016)
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 (2016)
Maryam Aliakbarpour, Eric Blais, Ronitt Rubinfeld
Learning and Testing Junta Distributions. COLT (2016)
Sheela Devadas, Ronitt Rubinfeld
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness. Theory Comput. Syst. 59 (1) (2016)
Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld
Testing Shape Restrictions of Discrete Distributions. STACS (2016)
Reut Levi, Dana Ron, Ronitt Rubinfeld
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. APPROX-RANDOM (2016)
Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld
Sampling Correctors. ITCS (2016)
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) (2015)
Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld
Testing Shape Restrictions of Discrete Distributions. CoRR (2015)
Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld
Sampling Correctors. CoRR (2015)
Piotr Indyk, Reut Levi, Ronitt Rubinfeld
-Histogram Distributions in Sub-linear Time. PODS (2015)
Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira
Constructing Near Spanning Trees with Few Local Inspections. CoRR (2015)
Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee
Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees. SPAA (2015)
Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira
Constructing Near Spanning Trees with Few Local Inspections. Electron. Colloquium Comput. Complex. 22 (2015)
Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee
Local Computation Algorithms for Graphs of Non-Constant Degrees. CoRR (2015)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Local Algorithms for Sparse Spanning Graphs. CoRR (2014)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Similar Means. SIAM J. Discret. Math. 28 (4) (2014)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Local Algorithms for Sparse Spanning Graphs. APPROX-RANDOM (2014)
Albert Kim, Eric Blais, Aditya G. Parameswaran, Piotr Indyk, Sam Madden, Ronitt Rubinfeld
Rapid Sampling for Visualizations with Ordering Guarantees. CoRR (2014)
Clément L. Canonne, Ronitt Rubinfeld
Testing Probability Distributions Underlying Aggregated Data. ICALP (1) (2014)
Sheela Devadas, Ronitt Rubinfeld
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness. CoRR (2014)
Clément L. Canonne, Ronitt Rubinfeld
Testing probability distributions underlying aggregated data. Electron. Colloquium Comput. Complex. 21 (2014)
Clément L. Canonne, Ronitt Rubinfeld
Testing probability distributions underlying aggregated data. CoRR (2014)
Andrea Campagna, Alan Guo, Ronitt Rubinfeld
Local Reconstructors and Tolerant Testers for Connectivity and Diameter. APPROX-RANDOM (2013)
Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld
A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support CoRR (2013)
Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White
Testing Closeness of Discrete Distributions. J. ACM 60 (1) (2013)
Ronitt Rubinfeld, Ning Xie
-wise independence over product spaces and related testing results. Random Struct. Algorithms 43 (3) (2013)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Properties of Collections of Distributions. Theory Comput. 9 (2013)
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith
Sublinear Algorithms for Approximating String Compressibility. Algorithmica 65 (3) (2013)
Akashnil Dutta, Reut Levi, Dana Ron, Ronitt Rubinfeld
A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support. DCC (2013)
Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie
Space-efficient local computation algorithms. SODA (2012)
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) (2012)
Ronitt Rubinfeld
Taming big probability distributions. XRDS 19 (1) (2012)
Andrea Campagna, Alan Guo, Ronitt Rubinfeld
Local reconstructors and tolerant testers for connectivity and diameter CoRR (2012)
Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. SODA (2012)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Similar Means. ICALP (1) (2012)
Reut Levi, Dana Ron, Ronitt Rubinfeld
Testing Similar Means. Electron. Colloquium Comput. Complex. 19 (2012)
Piotr Indyk, Reut Levi, Ronitt Rubinfeld
Approximating and testing k-histogram distributions in sub-linear time. PODS (2012)
Ronitt Rubinfeld, Gil Tamir, Shai Vardi, Ning Xie
Fast Local Computation Algorithms. ICS (2011)
Ronitt Rubinfeld, Asaf Shapira
Sublinear Time Algorithms. SIAM J. Discret. Math. 25 (4) (2011)
Piotr Indyk, Reut Levi, Ronitt Rubinfeld
-Histogram Distributions in Sub-linear time. Electron. Colloquium Comput. Complex. 18 (2011)

Ronitt Rubinfeld.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ronitt Rubinfeld