Rafail Ostrovsky
Affiliations: | Computer Science | University of California, Los Angeles, Los Angeles, CA |
Area:
theory of computation; cryptography and security; distributed algorithms; high-dimensional search; routing and flow control in communication networksGoogle:
"Rafail Ostrovsky"Cross-listing: MathTree
Children
Sign in to add trainee| Shailesh Vaya | grad student | 2006 | UCLA (MathTree) |
| William E. Skeith | grad student | 2007 | UCLA (MathTree) |
| Vipul Goyal | grad student | 2009 | UCLA (MathTree) |
| Steve N. Lu | grad student | 2009 | UCLA (MathTree) |
| Paul H. Bunn | grad student | 2010 | UCLA (MathTree) |
| Brett Hemenway | grad student | 2010 | UCLA |
| Ryan Moriarty | grad student | 2010 | UCLA (MathTree) |
| Omkant Pandey | grad student | 2010 | UCLA (MathTree) |
| Vladimir Braverman | grad student | 2011 | UCLA (MathTree) |
| Nishanth Chandran | grad student | 2011 | UCLA (MathTree) |
| Michael Shindler | grad student | 2011 | UCLA (MathTree) |
| Joshua W. Baron | grad student | 2012 | UCLA (MathTree) |
| Abhishek Jain | grad student | 2012 | UCLA (MathTree) |
| Hakan A. Seyalioglu | grad student | 2012 | UCLA (MathTree) |
| Chongwon Cho | grad student | 2013 | UCLA (MathTree) |
| Sanjam Garg | grad student | 2013 | UCLA |
| Clinton A. Givens | grad student | 2013 | UCLA (MathTree) |
| Chen-Kuei Lee | grad student | 2013 | UCLA (MathTree) |
| Ran Gelles | grad student | 2014 | UCLA (MathTree) |
| Silas I. Richelson | grad student | 2014 | UCLA (MathTree) |
| Alan J. Roytman | grad student | 2014 | UCLA (MathTree) |
| Akshay Wadia | grad student | 2014 | UCLA (MathTree) |
BETA: Related publications
See more...
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. |
| Bunn P, Ostrovsky R. (2020) Oblivious Sampling with Applications to Two-Party k-Means Clustering Journal of Cryptology. 33: 1362-1403 |
| Gonczarowski YA, Nisan N, Ostrovsky R, et al. (2019) A stable marriage requires communication Games and Economic Behavior. 118: 626-647 |
| Alter G, Falk BH, Lu S, et al. (2018) Computing Statistics from Private Data Data Science Journal. 17 |
| Braverman M, Gelles R, Mao J, et al. (2017) Coding for Interactive Communication Correcting Insertions and Deletions Ieee Transactions On Information Theory. 63: 6256-6270 |
| Hemenway B, Ostrovsky R. (2017) Efficient robust secret sharing from expander graphs Cryptography and Communications. 10: 79-99 |
| Khamsemanan N, Ostrovsky R, Skeith WE. (2016) On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols Siam Journal On Discrete Mathematics. 30: 266-295 |
| Braverman V, Ostrovsky R, Roytman A. (2015) Zero-one laws for sliding windows and universal sketches Leibniz International Proceedings in Informatics, Lipics. 40: 573-590 |
| Franklin M, Gelles R, Ostrovsky R, et al. (2015) Optimal coding for streaming authentication and interactive communication Ieee Transactions On Information Theory. 61: 133-145 |
| Braverman V, Ostrovsky R, Vorsanger G. (2015) Weighted sampling without replacement from data streams Information Processing Letters. 115: 923-926 |
| Hemenway B, Ostrovsky R, Wootters M. (2015) Local correctability of expander codes Information and Computation. 243: 178-190 |