Ronitt Rubinfeld

ScholarGPS® ID: 65087213777005

Affiliation

Massachusetts Institute of Technology, Cambridge, Massachusetts, United States

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Metrics Summary

Publication Count

125

Predicted Citations

7,069

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Testing Distributional Assumptions of Learning Algorithms (conference) Rubinfeld, Ronitt \| Vasilyan, Arsen STOC '23: 55th Annual ACM Symposium on Theory of Computing (2023) Orlando FL USA 10.1145/3564246.3585117 Cited by (1) \| Cite \| Source
Properly learning monotone functions via local correction (conference) Lange, Jane \| Rubinfeld, Ronitt \| Vasilyan, Arsen 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (2022) Denver, CO, USA 10.1109/FOCS54457.2022.00015 Cited by (2) \| Cite \| Source
Rapid Approximate Aggregation with Distribution-Sensitive Interval Guarantees (conference) Macke, Stephen \| Aliakbarpour, Maryam \| Diakonikolas, Ilias \| Parameswaran, Aditya \| Rubinfeld, Ronitt 2021 IEEE 37th International Conference on Data Engineering (ICDE) (2021) Chania, Greece 10.1109/ICDE51399.2021.00150 Cited by (2) \| Cite \| Source
Local Algorithms for Sparse Spanning Graphs (journal article) Levi, Reut \| Ron, Dana \| Rubinfeld, Ronitt Algorithmica, volume 82, issue 4, pages 747-786 (2020). 10.1007/s00453-019-00612-6 Cited by (2) \| Cite \| Source
Improved Local Computation Algorithm for Set Cover via Sparsification (book chapter) In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms Grunau, Christoph \| Mitrović, Slobodan \| Rubinfeld, Ronitt \| Vakilian, Ali Society for Industrial and Applied Mathematics (2020) 10.1137/1.9781611975994.181 Cited by (3) \| Cite \| Source
Local Computation Algorithms (conference) Rubinfeld, Ronitt PODC '19: ACM Symposium on Principles of Distributed Computing (2019) Toronto ON Canada 10.1145/3293611.3331587 Cite \| Source
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover (conference) Ghaffari, Mohsen \| Gouleakis, Themis \| Konrad, Christian \| Mitrović, Slobodan \| Rubinfeld, Ronitt PODC '18: ACM Symposium on Principles of Distributed Computing (2018) Egham United Kingdom 10.1145/3212734.3212743 Cited by (57) \| Cite \| Source \| Open Access
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling (journal article) Aliakbarpour, Maryam \| Biswas, Amartya Shankha \| Gouleakis, Themis \| Peebles, John \| Rubinfeld, Ronitt \| Yodpinyanee, Anak Algorithmica, volume 80, issue 2, pages 668-697 (2018). 10.1007/s00453-017-0287-3 Cited by (14) \| Cite \| Source
Sampling Correctors (journal article) Canonne, Clément L. \| Gouleakis, Themis \| Rubinfeld, Ronitt SIAM Journal on Computing, volume 47, issue 4, pages 1373-1423 (2018). 10.1137/16M1076666 Cite \| Source
Set Cover in Sub-linear Time (book chapter) In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms Indyk, Piotr \| Mahabadi, Sepideh \| Rubinfeld, Ronitt \| Vakilian, Ali \| Yodpinyanee, Anak Society for Industrial and Applied Mathematics (2018) 10.1137/1.9781611975031.158 Cited by (4) \| Cite \| Source \| Open Access
Testing Shape Restrictions of Discrete Distributions (journal article) Canonne, Clément L. \| Diakonikolas, Ilias \| Gouleakis, Themis \| Rubinfeld, Ronitt Theory of Computing Systems, volume 62, issue 1, pages 4-62 (2018). 10.1007/s00224-017-9785-6 Cited by (8) \| Cite \| Source \| Open Access
Local Computation Algorithms for Graphs of Non-constant Degrees (journal article) Levi, Reut \| Rubinfeld, Ronitt \| Yodpinyanee, Anak Algorithmica, volume 77, issue 4, pages 971-994 (2017). 10.1007/s00453-016-0126-y Cited by (13) \| Cite \| Source \| Open Access
Constructing near spanning trees with few local inspections (journal article) Levi, Reut \| Moshkovitz, Guy \| Ron, Dana \| Rubinfeld, Ronitt \| Shapira, Asaf Random Structures & Algorithms, volume 50, issue 2, pages 183-200 (2017). 10.1002/rsa.20652 Cited by (6) \| Cite \| Source \| Open Access
Fractional Set Cover in the Streaming Model (conference) Indyk, Piotr \| Mahabadi, Sepideh \| Rubinfeld, Ronitt \| Ullman, Jonathan \| Vakilian, Ali \| Yodpinyanee, Anak International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2017) 10.4230/LIPIcs.APPROX-RANDOM.2017.12 Cited by (4) \| Cite \| Source
Can We Locally Compute Sparse Connected Subgraphs? (book chapter) In Computer Science – Theory and Applications Rubinfeld, Ronitt Springer International Publishing (2017) 10.1007/978-3-319-58747-9_6 Cite \| Source
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness (journal article) Devadas, Sheela \| Rubinfeld, Ronitt Theory of Computing Systems, volume 59, issue 1, pages 99-111 (2016). 10.1007/s00224-015-9639-z Cite \| Source \| Open Access
Sampling Correctors (conference) Canonne, Clement L. \| Gouleakis, Themis \| Rubinfeld, Ronitt ITCS'16: Innovations in Theoretical Computer Science (2016) Cambridge Massachusetts USA 10.1145/2840728.2840729 Cite \| Source \| Open Access
Testing Shape Restrictions of Discrete Distributions (conference) Canonne, Clément L. \| Diakonikolas, Ilias \| Gouleakis, Themistoklis \| Rubinfeld, Ronitt Symposium on Theoretical Aspects of Computer Science (2016) Orléans, France 10.4230/LIPIcs.STACS.2016.25 Cited by (10) \| Cite \| Source
A Local Algorithm for Constructing Spanners in Minor-Free Graphs (conference) Levi, Reut \| Ron, Dana \| Rubinfeld, Ronitt International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2016) 10.4230/LIPIcs.APPROX-RANDOM.2016.38 Cited by (4) \| Cite \| Source
Linearity Testing/Testing Hadamard Codes (book chapter) In Encyclopedia of Algorithms Raskhodnikova, Sofya \| Rubinfeld, Ronitt Springer New York (2016) 10.1007/978-1-4939-2864-4_202 Cited by (1) \| Cite \| Source

Title	Investigators	Year	Expiration	Amount
Foundations of Data Science Institute	Indyk, Piotr \| Rubinfeld, Ronitt \| Shah, Devavrat \| Kelner, Jonathan \| Rigollet, Philippe	09-01-2020	08-31-2025	$1,098,060
AF: Small: Sparsity in Local Computation	Rubinfeld, Ronitt	07-01-2020	06-30-2022	$300,000
BIGDATA: F: Testing High Dimensional Distributions without the Curse of Dimensionality	Rubinfeld, Ronitt \| Daskalakis, Constantinos	12-01-2017	11-30-2020	$900,000
TRIPODS: Institute for Foundations of Data Science (IFDS)	Indyk, Piotr \| Rubinfeld, Ronitt \| Shah, Devavrat \| Kelner, Jonathan \| Rigollet, Philippe	10-01-2017	09-30-2021	$1,368,500
AitF: Collaborative Research: Fast, Accurate, and Practical: Adaptive Sublinear Algorithms for Scalable Visualization	Rubinfeld, Ronitt	09-15-2017	08-31-2020	$232,999
EAGER: Testing Pseudorandom Distributions	Daskalakis, Constantinos \| Rubinfeld, Ronitt	09-01-2016	08-31-2018	$300,000
AF: Small: New directions in the design of local computation algorithms	Rubinfeld, Ronitt	09-01-2014	08-31-2017	$400,000
AF: Small: Local Computation Algorithms	Rubinfeld, Ronitt	09-01-2012	08-31-2014	$250,000
AF: Medium: Taming Masssive Data with Sub-Linear Algorithms	Indyk, Piotr \| Rubinfeld, Ronitt	03-01-2011	02-29-2016	$1,160,930
Fast Approximate Algorithms for Wireless Sensor Networks	Katabi, Dina \| Indyk, Piotr \| Rubinfeld, Ronitt	09-01-2007	08-31-2011	$560,080
MSPA-MCS: Learning to Rank	Sipser, Michael \| Rubinfeld, Ronitt \| Agarwal, Shivani	09-01-2007	08-31-2010	$373,396
The Complexity of Testing Distributions	Rubinfeld, Ronitt	07-15-2005	06-30-2008	$200,000
CAREER: Algorithms for Self-testing/Correcting Program and Learning	Rubinfeld, Ronitt	05-15-1996	04-30-2000	$200,000
Relationships between Self-Testing/Correcting Programs and Interactive Proofs	Rubinfeld, Ronitt	09-01-1995	09-30-1996	$159,246