- Yahoo Finance
Avi Wigderson, Professor of Mathematics at the Institute for Advanced Study, works in theoretical computer science and information science. He was an invited speaker at the International Congress of Mathematicians on two occasions, and was awarded the Nevanlinna Prize in 1994 and the Gödel Prize in 2009.
Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson Innovations in Theoretical Computer Science (ITCS) 2019 [conference version] [arXiv version] Spanoids - an abstraction of spanning structures, and a barrier for LCCs Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson SIAM Journal on Computing (SICOMP), 49(3):465-496, 2020 [journal version]
New articles will be added to the collection early next year, including one by 2019 Turing Award winner, Patrick Hanrahan on the math behind movies, and another by 2021 Abel Prize winner, Avi Wigderson on computational complexity theory. To view more scientific articles for kids and teens, visit the Frontiers for Young Minds website.
Laureates of mathematics and computer science meet the next generation. László Lovász is an accomplished man: He won the Abel Prize in 2021 alongside Avi Wigderson, another laureate who attended the 10th Heidelberg Laureate Forum (HLF) this year; he was President of the International Mathematical Union from 2007 to 2010; and he is also a ...
Nati Linial and Avi Wigderson. Class Hours: Monday 12-2, Sprinzak 115 Avi's Office hours: Wednesday 9-10:30, Ross 215 Course Requirements: 50% - lecture notes , 50% - exercises TA / Lecture notes coordinator: Shlomoh Hoory (email@example.com). Bulletin Board: The lecture notes are on-line.
Get your manuscript edited for free. Use our pre-submission checklist. Avoid common mistakes on your manuscript. Sign up for alerts. Get notified when new articles are published. The Israel Journal of Mathematics is an international journal publishing high-quality, original research papers in a wide spectrum of pure and applied ...
Last Updated: 27 Nov 2023. Download Citation | Improved Polynomial Secret-Sharing Schemes | Despite active research on secret-sharing schemes for arbitrary access structures for more than 35 years ...
Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the twentieth annual ACM symposium on Theory of computing. 1--10.
Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In 20th ACM STOC. ACM Press, (May 1988), 1--10. Google Scholar; Mohamed-Walid Benabderrahmane, Louis-Noël Pouchet, Albert Cohen, and Cédric Bastoul. 2010.
In this work, we introduce the notion of Set Membership Encryption (SME) - a new member in the area of laconic cryptography. SME allows a sender to encrypt to one recipient from a universe of receivers, while using a small digest from a large subset of receivers.