Ronitt Rubinfeld

Affiliations: 
Cornell University, Ithaca, NY, United States 
Area:
Computer Science, Statistics
Google:
"Ronitt Rubinfeld"

Parents

Sign in to add mentor
Manuel Blum grad student UC Berkeley (Computer Science Tree)

Children

Sign in to add trainee
Tugkan Batu grad student 2001 Cornell
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Aliakbarpour M, Biswas AS, Gouleakis T, et al. (2018) Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling Algorithmica. 80: 668-697
Levi R, Rubinfeld R, Yodpinyanee A. (2016) Local Computation Algorithms for Graphs of Non-constant Degrees Algorithmica. 1-24
Canonne CL, Diakonikolas I, Gouleakis T, et al. (2016) Testing shape restrictions of discrete distributions Leibniz International Proceedings in Informatics, Lipics. 47
Levi R, Moshkovitz G, Ron D, et al. (2016) Constructing near spanning trees with few local inspections Random Structures and Algorithms
Levi R, Rubinfeld R, Yodpinyanee A. (2015) Brief announcement: Local computation algorithms for graphs of non-constant degrees Annual Acm Symposium On Parallelism in Algorithms and Architectures. 2015: 59-61
Devadas S, Rubinfeld R. (2015) A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness Theory of Computing Systems
Levi R, Ron D, Rubinfeld R. (2014) Testing similar means Siam Journal On Discrete Mathematics. 28: 1699-1724
Levi R, Ron D, Rubinfeld R. (2014) Local algorithms for sparse spanning graphs Leibniz International Proceedings in Informatics, Lipics. 28: 826-842
Canonne C, Rubinfeld R. (2014) Testing probability distributions underlying aggregated data Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8572: 283-295
Levi R, Ron D, Rubinfeld R. (2013) Testing Properties of Collections of Distributions Theory of Computing. 9: 295-347
See more...