To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

How to transfigure the Wikipedia

Would you like Wikipedia to always look as professional and up-to-date? We have created a browser extension. It will enhance any encyclopedic page you visit with the magic of the WIKI 2 technology.

Try it — you can delete it anytime.

Install in 5 seconds
4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
Great Wikipedia has got greater.
.
Leo
Newton
Brights
Milds

Omer Reingold

From Wikipedia, the free encyclopedia

Omer Reingold
NationalityIsraeli
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
Doctoral advisorMoni 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]

YouTube Encyclopedic

  • 1/3
    Views:
    562
    537
    723
  • Omer Reingold - Recent Developments Related to RL vs. L - Part 1
  • Getting Harder All the Time?
  • Pseudorandomness in Data Structures

Transcription

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

  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. ACM. 55 (4): 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.

External links


P ≟ NP 

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

This page was last edited on 3 March 2024, at 03:53
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.
Contact WIKI 2
Introduction
Terms of Service
Privacy Policy