Rafail Ostrovsky
Scholar

Rafail Ostrovsky

Google Scholar ID: UvFrX04AAAAJ
Norman E. Friedman Chair in Knowledge Sciences, Distinguished Prof. of CS & MATH
Theoretical Computer ScienceCryptographyComputer SecurityComplexity TheoryDistributed Algorithms
Citations & Impact
All-time
Citations
15,180
 
H-index
55
 
i10-index
177
 
Publications
20
 
Co-authors
49
list available
Resume (English only)
Academic Achievements
  • Over 360 refereed publications; 16 issued USPTO patents; recipient of multiple awards and honors, including the 1993 Henry Taub Prize, the 2017 IEEE Computer Society Edward J. McCluskey Technical Achievement Award, the 2018 RSA Award for Excellence in Mathematics (also known as the RSA Prize), and the 2022 W. Wallace McDowell Award, the highest award given by the IEEE Computer Society.
Research Experience
  • Served as the chair of the IEEE Technical Committee on Mathematical Foundations of Computing from 2015 to 2018; served as the chair of the IEEE Annual Symposium on Foundations of Computer Science (FOCS) 2011 Program Committee (PC); served on over 40 other international conference PC's; currently serving on the editorial boards of the Journal of ACM and the Algorithmica Journal.
Education
  • Information not provided
Background
  • Norman E. Friedman Chair in Knowledge Sciences at UCLA Samueli School of Engineering; Distinguished Professor of Computer Science and Mathematics at UCLA; Fellow of multiple organizations, including the National Academy of Inventors, AAAS, ACM, IEEE, and IACR; foreign member of Academia Europaea. His research interests include all aspects of theory of computation, especially cryptography, network algorithms, and search and classification of large-scale, high-dimensional data.
Miscellany
  • Teaching experience includes: CS282A/MATH209A: Foundations of Cryptography; CS183: Introduction to Cryptography; CS282B/M209B: Cryptographic Protocols; CS289A: Current Topics in Computer Science Theory; CS289A: Seminar on Probabilistically Checkable Proofs; CS289A: Seminar on Byzantine Agreement; CS180: Introduction to Algorithms and Complexity.