Omer Reingold
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.[2] 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."[3]
Omer Reingold | |
|---|---|
| Nationality | Israeli |
| Alma mater | Weizmann Institute of Science |
| Awards | Grace Murray Hopper Award (2005) Gödel Prize (2009) ACM Fellow |
| Scientific career | |
| Fields | Computer science |
| Institutions | Stanford University |
| Doctoral advisor | Moni Naor[1] |
Selected publications
- Reingold, Omer (2008), "Undirected connectivity in log-space", Journal of the ACM, 55 (4): 1–24, doi:10.1145/1391289.1391291, S2CID 207168478.
References
- Omer Reingold at the Mathematics Genealogy Project
- REINGOLD, OMER (2008). "Undirected connectivity in log-space". Journal of the ACM. ACM. 55 (4): 1–24. doi:10.1145/1391289.1391291. S2CID 207168478.
- ACM Names Fellows for Innovations in Computing Archived 2015-01-09 at the Wayback Machine, ACM, January 8, 2015, retrieved 2015-01-08.
External links
- 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
Authority control  |
|---|
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.