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.

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
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

From Wikipedia, the free encyclopedia

Irit Dinur
Dinur in 2014
Alma materPhD Tel Aviv University
Awards
Scientific career
FieldsComputer Science, Complexity Theory
InstitutionsWeizmann Institute of Science
Thesis (2001)
Doctoral advisorShmuel Safra
Websitewww.wisdom.weizmann.ac.il/~dinuri/

Irit Dinur (Hebrew: אירית דינור) is an Israeli computer scientist. She is professor of computer science at the Weizmann Institute of Science.[1] Her research is in foundations of computer science and in combinatorics, and especially in probabilistically checkable proofs and hardness of approximation.[2]

YouTube Encyclopedic

  • 1/3
    Views:
    379
    2 029
    2 226
  • High Dimensional Expanders and PCPs
  • Irit Dinur: On the Structure of NP-Hard 3-SAT Instances
  • 12. Gaps and PCP

Transcription

Biography

Irit Dinur earned her doctorate in 2002 from the school of computer science in Tel Aviv University, advised by Shmuel Safra; her thesis was entitled On the Hardness of Approximating the Minimum Vertex Cover and The Closest Vector in a Lattice.[3] She joined the Weizmann Institute after visiting the Institute for Advanced Study in Princeton, New Jersey, NEC, and the University of California, Berkeley.

Dinur published in 2006 a new proof of the PCP theorem that was significantly simpler than previous proofs of the same result.[4]

Awards and recognition

In 2007, she was given the Michael Bruno Memorial Award in Computer Science by Yad Hanadiv.[5] She was a plenary speaker at the 2010 International Congress of Mathematicians.[6] In 2012, she won the Anna and Lajos Erdős Prize in Mathematics, given by the Israel Mathematical Union.[7] She was the William Bentinck-Smith Fellow at Harvard University in 2012–2013.[8] In 2019, she won the Gödel Prize for her paper "The PCP theorem by gap amplification".[9]

References

  1. ^ Faculty listing, Weizmann Institute Faculty of Mathematics and Computer Science, retrieved 2014-06-18.
  2. ^ Research interests of faculty members, Weizmann Institute Faculty of Mathematics and Computer Science, retrieved 2014-06-18.
  3. ^ School of Computer Science Thesis Repository, Tel Aviv University, accessed 2014-06-18.
  4. ^ Radhakrishnan, Jaikumar; Sudan, Madhu (2007), "On Dinur's proof of the PCP theorem", Bulletin of the American Mathematical Society, New Series, 44 (1): 19–61, doi:10.1090/S0273-0979-06-01143-8, MR 2265009.
  5. ^ Michael Bruno Memorial Award recipients Archived 2018-10-12 at the Wayback Machine, retrieved 2014-06-18.
  6. ^ ICM2010 — Avila, Dinur, plenary lectures, Tim Gowers, August 30, 2010.
  7. ^ EMS e-News 4, September 2012 Archived 2013-06-12 at the Wayback Machine, European Mathematical Society, retrieved 2014-06-18.
  8. ^ Irit Dinur, Radcliffe Institute for Advanced Study, Harvard University, retrieved 2014-06-18.
  9. ^ EATCS 2019 Gödel Prize, retrieved 2019-09-11.

External links

This page was last edited on 22 November 2023, at 10:39
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.