Omer Reingold
Omer Reingold · Technology & Engineering
Israeli cryptographer who proved SL = L; Gödel Prize (2009)
1969, Tel Aviv, Israel
Israel · United States
Omer Reingold is recognized among Israeli contributors to Technology & Engineering — Israeli cryptographer who proved SL = L; Gödel Prize (2009)
An Israeli theoretical computer scientist who earned his PhD at the Weizmann Institute and is now a professor at Stanford, Reingold proved that undirected graph connectivity can be decided using only logarithmic memory (SL = L), resolving a long-standing question in complexity theory. With collaborators he introduced the zig-zag graph product, sharing the 2009 Gödel Prize. He is Jewish and Israeli.
Verify and go deeper with these external references.
Source: Jinfo.org — Jewish recipients of the Gödel Prize
This page is published in seven languages from an English source. The translations are reviewed, but a mistake can still slip through. If you spot one on this profile — a wrong word, a lost date, a sentence that says something the English does not — please tell us.
Israeli cryptographer who proved SL = L; Gödel Prize (2009)
Source: Jinfo.org — Jewish recipients of the Gödel Prize