Wikipedia's first sentence called it “professor of computer science at the faculty of mathematics and computer science of weizmann institute of scien”. Today it says “professor of computer science at the faculty of mathematics and computer science of the weizmann institute of s”.
Measured, not asserted. Every count, date and revision on this page was taken from Wikipedia's own history and checked against the live article. The words quoted are theirs.
Machine-checked against the full current article on 2026-08-03.
We saved snapshots of this article over twenty years; you are reading the 2020 one. Red dashes: removed from Wikipedia since.Pale dots: rewritten; the numbered note shows what it says now.Red text: written in or rewritten since the previous snapshot.1 tap a number or a side note to jump between them
The opening as it read in 2020
Oded Goldreich ( ; b. 1957) is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel.1 His research interests lie within the theory of computation and are, specifically, the interplay of randomness and computation, the foundations of cryptography , and computational complexity theory . He won the Knuth Prize in 2017. Goldreich has contributed to the development of pseudorandomness , zero knowledge proofs , secure function evaluation , property testing , and other areas in cryptography and computational complexity . Goldreich has also authored several books including: Foundations of Cryptography which comes in two volumes (volume 1 in 2001 and volume 2 in 2004), Computational Complexity: A Conceptual Perspective (2008), and Modern Cryptography, Probabilistic Proofs and Pseudorandomness (1998). He is married to Dana Ron , who is a computer scientist at Tel Aviv University , and has collaborated with Ron on approximation algorithms. Oded Goldreich, Shafi Goldwasser , and Silvio Micali . Oded Goldreich and Leonid Levin . Hard-core Predicates for any One-Way Function. In the proceedings of the 21st ACM Symp. on Theory of Computing, pages 25-32, 1989. How to Play any Mental Game or a Completeness Theorem for Protocols with Honest Majority. Journal of the ACM , pages 653-750. Journal of the ACM . 45 (6): 965– 982. Journal of the ACM . 53 (4): 558– 655.2
This is Wikipedia's own text, saved in our repository. Their copy of it is revision 952597961.
The opening as it stood in 2010
Oded Goldreich ( ; b. 1957) is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel . His research interests lie within the theory of computation . Specifically, the interplay of randomness and computation, the foundations of cryptography and computational complexity theory . Goldreich has explored the development of pseudorandomness , zero knowledge proofs , secure function evaluation , and other areas in computational complexity . Goldreich has also authored several books including: Foundations of Cryptography which comes in two volumes (volume 1 in 2001 and volume 2 in 2004), Computational Complexity: A Conceptual Perspective (2008), and Modern Cryptography, Probabilistic Proofs and Pseudorandomness (1998). Hard-core Predicates for any One-Way Function. In the proceedings of the 21st ACM Symp. on Theory of Computing, pages 25-32, 1989. How to Play any Mental Game or a Completeness Theorem for Protocols with Honest Majority.
Red text was written in or rewritten since the previous snapshot. Their copy is revision 363053269.
The opening as it stood in 2015
Oded Goldreich ( ; b. 1957) is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel . His research interests lie within the theory of computation and are, specifically, the interplay of randomness and computation, the foundations of cryptography , and computational complexity theory . Goldreich has contributed to the development of pseudorandomness , zero knowledge proofs , secure function evaluation , property testing , and other areas in cryptography and computational complexity . Goldreich has also authored several books including: Foundations of Cryptography which comes in two volumes (volume 1 in 2001 and volume 2 in 2004), Computational Complexity: A Conceptual Perspective (2008), and Modern Cryptography, Probabilistic Proofs and Pseudorandomness (1998). He is married to Dana Ron , who is also a computer scientist at Tel Aviv University , and has collaborated with Ron on approximation algorithms.Oded Goldreich, Shafi Goldwasser , and Silvio Micali .Oded Goldreich and Leonid Levin . Hard-core Predicates for any One-Way Function. In the proceedings of the 21st ACM Symp. on Theory of Computing, pages 25-32, 1989. How to Play any Mental Game or a Completeness Theorem for Protocols with Honest Majority. Property Testing and its connection to Learning and Approximation.Journal of the ACM, pages 653--750, July 1998.Kushilevitz and Madhu Sudan .Goldreich, and Rafail Ostrovsky .
Red text was written in or rewritten since the previous snapshot. Their copy is revision 664143474.
The opening as it stood on October 6, 2023 11 passages from the previous snapshot no longer appear
Israeli computer scientist Oded Goldreich ( ; b. 1957) is a professor of computer science at the faculty of mathematics and computer science of the Weizmann Institute of Science, Israel. His research interests lie within the theory of computation and are, specifically, the interplay of randomness and computation, the foundations of cryptography , and computational complexity theory . He won the Knuth Prize in 2017 and was selected in 2021 to receive the Israel Prize in mathematics.
Red text was written in or rewritten since the previous snapshot. Their copy is revision 1164238157.
The opening as it stood in 2025
Israeli computer scientist ; (born 1957) Oded Goldreich ( Hebrew : עודד גולדרייך ; born 1957) is a professor of computer science at the faculty of mathematics and computer science of the Weizmann Institute of Science, Israel. His research interests lie within the theory of computation and are, specifically, the interplay of randomness and computation, the foundations of cryptography , and computational complexity theory . He won the Knuth Prize in 2017 and was selected in 2021 to receive the Israel Prize in mathematics. He is a member of the Israel Academy of Sciences and Humanities .
Red text was written in or rewritten since the previous snapshot. Their copy is revision 1295453132. This is our newest snapshot; the live article may have moved again since.
Today
Wikipedia's first sentence called it “professor of computer science at the faculty of mathematics and computer science of weizmann institute of scien”. Today it says “professor of computer science at the faculty of mathematics and computer science of the weizmann institute of s”. Read the current article and compare.
2010
2015
2020
Oct '23
2025
Counts in the opening at each snapshot. Green: the word gained ground. Red: it was cut. Grey: no change.
What Wikipedia says this is
Every article opens by defining its subject. This one was redefined since 2010, and today's defining sentence is their current revision.
Then
professor of computer science at the faculty of mathematics and computer science of weizmann institute of scien
Now
professor of computer science at the faculty of mathematics and computer science of the weizmann institute of s
Struck red text is no longer in the article; dotted amber text was rewritten. Every revision id links to Wikipedia's copy; the text shown is our own saved copy. Data: /data. Wikipedia text is CC BY-SA; quoted for the record; not affiliated with Wikipedia.
