|Alma mater||Weizmann Institute of Science|
Grace Murray Hopper Award (2005)|
Gödel Prize (2009)
|Doctoral advisor||Moni Naor|
|Doctoral students||Iftach Haitner, Shachar Lovett|
Omer Reingold (Hebrew: עומר ריינגולד) is a faculty member of the Computer Science Department at Stanford University. He received the 2005 Grace Murray Hopper Award for his work in finding a deterministic logarithmic-space algorithm for ST-connectivity in undirected graphs. He, along with Avi Wigderson and Salil Vadhan, won the Gödel Prize (2009) for their work on the zig-zag product. He became a Fellow of the Association for Computing Machinery in 2014 "For contributions to the study of pseudorandomness, derandomization, and cryptography."
- Reingold, Omer (2008), "Undirected connectivity in log-space", Journal of the ACM, 55 (4): Article 17, 24 pages, doi:10.1145/1391289.1391291.
- Omer Reingold at the Mathematics Genealogy Project
- REINGOLD, OMER (2008). "Undirected connectivity in log-space". Journal of the ACM. ACM. 55 (4). doi:10.1145/1391289.1391291. Retrieved 9 January 2015.
- ACM Names Fellows for Innovations in Computing Archived 2015-01-09 at the Wayback Machine., ACM, January 8, 2015, retrieved 2015-01-08.
- Omer Reingold's personal homepage
- Omer Reingold's homepage at Simon's Institute, Berkeley
- Omer Reingold's homepage at Weizmann Institute
- Omer Reingold's homepage at Stanford University
- His Grace Murray Hopper award
|P ≟ NP||This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.|