OR
Technology & Engineering

Omer Reingold

Share
Who

Omer Reingold · Technology & Engineering

What

Israeli cryptographer who proved SL = L; Gödel Prize (2009)

When

1969, Tel Aviv, Israel

Where

Israel · United States

Biography

Omer Reingold is recognized among Israeli contributors to Technology & Engineering — Israeli cryptographer who proved SL = L; Gödel Prize (2009)

How & why

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.

Sources & external links

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.

Contributions & Sources

Israeli cryptographer who proved SL = L; Gödel Prize (2009)

2009

Source: Jinfo.org — Jewish recipients of the Gödel Prize