Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Rubinfeld, Ronitt
193  Ergebnisse:
Personensuche X
?
1

New Partitioning Techniques and Faster Algorithms for Appro..:

Compton, Spencer ; Mitrović, Slobodan ; Rubinfeld, Ronitt
Algorithmica.  , 2024
Link: https://doi.org/10.1007/..
 
?
2

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..
 
?
3

Testing Distributional Assumptions of Learning Algorithms:

Rubinfeld, Ronitt ; Vasilyan, Arsen
https://doi.org/10.1145/3564246.3585117.  , 2023
Link: https://hdl.handle.net/1..
 
?
4

From Big Data Theory to Big Data Practice (Dagstuhl Seminar..:

Farach-Colton, Martin ; Kuhn, Fabian Daniel ; Rubinfeld, Ronitt.
doi:10.4230/DagRep.13.2.33.  , 2023
Link: https://doi.org/10.4230/..
 
?
5

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/..
 
?
6

Exponentially Improving the Complexity of Simulating the We..:

Aamand, Anders ; Chen, Justin Y ; Indyk, Piotr...
http://arxiv.org/abs/2211.03232.  , 2022
Link: http://arxiv.org/abs/221..
 
?
7

Properly learning monotone functions via local reconstructi..:

Lange, Jane ; Rubinfeld, Ronitt ; Vasilyan, Arsen
http://arxiv.org/abs/2204.11894.  , 2022
Link: http://arxiv.org/abs/220..
 
?
8

Local Access to Random Walks:

Biswas, Amartya Shankha ; Pyne, Edward ; Rubinfeld, Ronitt
doi:10.4230/LIPIcs.ITCS.2022.24.  , 2022
Link: https://doi.org/10.4230/..
 
?
9

Testing distributional assumptions of learning algorithms:

Rubinfeld, Ronitt ; Vasilyan, Arsen
http://arxiv.org/abs/2204.07196.  , 2022
Link: http://arxiv.org/abs/220..
 
?
10

Rapid Approximate Aggregation with Distribution-Sensitive I..:

Macke, Stephen ; Aliakbarpour, Maryam ; Diakonikolas, Ilias..
10.1109/ICDE51399.2021.00150.  , 2022
Link: https://hdl.handle.net/1..
 
?
11

Massively Parallel Algorithms for Small Subgraph Counting:

Biswas, Amartya Shankha ; Eden, Talya ; Liu, Quanquan C..
doi:10.4230/LIPIcs.APPROX/RANDOM.2022.39.  , 2022
Link: https://doi.org/10.4230/..
 
?
12

Triangle and Four Cycle Counting with Predictions in Graph ..:

Chen, Justin Y ; Eden, Talya ; Indyk, Piotr...
http://arxiv.org/abs/2203.09572.  , 2022
Link: http://arxiv.org/abs/220..
 
?
13

Sampling Multiple Edges Efficiently:

Eden, Talya ; Mossel, Saleet ; Rubinfeld, Ronitt
doi:10.4230/LIPIcs.APPROX/RANDOM.2021.51.  , 2021
Link: https://doi.org/10.4230/..
 
?
14

Towards a Decomposition-Optimal Algorithm for Counting and ..:

Biswas, Amartya Shankha ; Eden, Talya ; Rubinfeld, Ronitt
http://arxiv.org/abs/2107.06582.  , 2021
Link: http://arxiv.org/abs/210..
 
?
15

Local Access to Random Walks:

Biswas, Amartya Shankha ; Pyne, Edward ; Rubinfeld, Ronitt
http://arxiv.org/abs/2102.07740.  , 2021
Link: http://arxiv.org/abs/210..
 
1-15