I agree that this site is using cookies. You can find further informations here.
X
Rubinfeld, Ronitt
192  results:
Search for persons X
?
1

Testing Distributional Assumptions of Learning Algorithms:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Rubinfeld, Ronitt ; Vasilyan, Arsen - p. 1643-1656 , 2023
Link: https://dl.acm.org/doi/1..
 
?
2

Properly learning monotone functions via local correction:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Lange, Jane ; Rubinfeld, Ronitt ; Vasilyan, Arsen - p. 75-86 , 2022
Link: https://doi.org/10.1109/..
 
?
3

Improved local computation algorithm for set cover via spar..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Grunau, Christoph ; Mitrović, Slobodan ; Rubinfeld, Ronitt. - p. 2993-3011 , 2020
Link: https://dl.acm.org/doi/1..
 
?
4

Local Algorithms for Sparse Spanning Graphs:

Levi, Reut ; Ron, Dana ; Rubinfeld, Ronitt
Algorithmica.  82 (2019)  4 - p. 747-786 , 2019
Link: https://doi.org/10.1007/..
 
?
5

Local Computation Algorithms:

, In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing,
Rubinfeld, Ronitt - p. 3 ff. , 2019
Link: https://dl.acm.org/doi/1..
 
?
6

Sampling Correctors:

Canonne, Clément L. ; Gouleakis, Themis ; Rubinfeld, Ronitt
SIAM Journal on Computing.  47 (2018)  4 - p. 1373-1423 , 2018
Link: https://doi.org/10.1137/..
 
?
7

Set cover in sub-linear time:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Indyk, Piotr ; Mahabadi, Sepideh ; Rubinfeld, Ronitt.. - p. 2467-2486 , 2018
Link: https://dl.acm.org/doi/1..
 
?
8

Set Cover in Sub-linear Time:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Indyk, Piotr ; Mahabadi, Sepideh ; Rubinfeld, Ronitt.. - p. 2467-2486 , 2018
Link: https://doi.org/10.1137/..
 
?
9

Improved Massively Parallel Computation Algorithms for MIS,..:

, In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing,
Ghaffari, Mohsen ; Gouleakis, Themis ; Konrad, Christian.. - p. 129-138 , 2018
Link: https://dl.acm.org/doi/1..
 
?
10

Sublinear-Time Algorithms for Counting Star Subgraphs via E..:

Aliakbarpour, Maryam ; Biswas, Amartya Shankha ; Gouleakis, Themis...
Algorithmica.  80 (2017)  2 - p. 668-697 , 2017
Link: https://doi.org/10.1007/..
 
?
11

Testing Shape Restrictions of Discrete Distributions:

Canonne, Clément L. ; Diakonikolas, Ilias ; Gouleakis, Themis.
Theory of Computing Systems.  62 (2017)  1 - p. 4-62 , 2017
Link: https://doi.org/10.1007/..
 
?
12

Constructing near spanning trees with few local inspections:

Levi, Reut ; Moshkovitz, Guy ; Ron, Dana..
Random Structures & Algorithms.  50 (2016)  2 - p. 183-200 , 2016
Link: https://doi.org/10.1002/..
 
?
13

Sampling Correctors:

, In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science,
Canonne, Clement L. ; Gouleakis, Themis ; Rubinfeld, Ronitt - p. 93-102 , 2016
Link: https://dl.acm.org/doi/1..
 
?
14

Local Computation Algorithms for Graphs of Non-constant Deg..:

Levi, Reut ; Rubinfeld, Ronitt ; Yodpinyanee, Anak
Algorithmica.  77 (2016)  4 - p. 971-994 , 2016
Link: https://doi.org/10.1007/..
 
?
15

Proceedings of the forty-seventh annual ACM symposium on Th..:

Servedio, Rocco ; Rubinfeld, Ronitt , 2015
Link: https://dl.acm.org/doi/1..
 
1-15