Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a21aa8dd8b6bb6ed

Jump to content

// Workers AI · dad joke modeIs Omer Reingold a good dancer? He's got algorithms to reel you in.

From Wikipedia, the free encyclopedia
Omer Reingold
עומר ריינגולד
Alma materWeizmann Institute of Science
Known forZig-zag product
AwardsGrace Murray Hopper Award (2005)
Gödel Prize (2009)
ACM Fellow
Scientific career
FieldsComputer science
InstitutionsStanford University
Moni Naor[1]

Omer Reingold (Hebrew: עומר ריינגולד) is an Israeli computer scientist. He is the Rajeev Motwani professor of computer science in the Computer Science Department at Stanford University and the director of the Simons Collaboration on the Theory of Algorithmic Fairness. He received a PhD in computer science at Weizmann in 1998 under Moni Naor.[2] He received the 2005 Grace Murray Hopper Award for his work in finding a deterministic logarithmic-space algorithm for st-connectivity in undirected graphs.[3] 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."[4]

Selected publications

[edit]
  • Reingold, Omer (2008), "Undirected connectivity in log-space", Journal of the ACM, 55 (4): 1–24, doi:10.1145/1391289.1391291, S2CID 207168478.

References

[edit]
  1. Omer Reingold at the Mathematics Genealogy Project
  2. Reingold, Omer (January 2022). "CV-1" (PDF). Bio. Retrieved 29 November 2022.
  3. REINGOLD, OMER (2008). "Undirected connectivity in log-space". Journal of the ACM. 55 (4). ACM: 1–24. doi:10.1145/1391289.1391291. S2CID 207168478.
  4. ACM Names Fellows for Innovations in Computing Archived 2015-01-09 at the Wayback Machine, ACM, January 8, 2015, retrieved 2015-01-08.
[edit]