##### Web results:

**Avi Wigderson**I am the Herbert H. Maass Professor at the School of Mathematics , Institute for Advanced Study, Princeton. I organize the school activities in CSDM (Computer Science and Discrete Mathematics).**Avi Wigderson**(Hebrew: אבי ויגדרזון; born 9 September 1956) is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey, United States of America.609-455-4398. Dan Komoda.

**Avi Wigderson**.**Avi Wigderson**of the Institute for Advanced Study (IAS) was named a recipient of the 2021 Abel Prize, which he shares jointly with László Lovász —a former IAS visiting professor—of Eötvös Loránd University.**Avi Wigderson**is a widely recognized authority in the diverse and evolving field of theoretical computer science. His main research area is computational complexity theory. This field studies the power and limits of efficient computation and is motivated by such fundamental scientific problems as: Does P = NP?**Avi Wigderson**Home Publication List 1. S. Goldwasser, M. Ben-Or, A.**Wigderson**Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computing 2023 Edsger W. Dijkstra Prize in Distributed Computing Proceedings of the 20th Symposium on the Theory of Computing (STOC), May 1988 ( Abstract )**Avi Wigderson**is a Professor in the School of Mathematics at the Institute for Advanced Study, in Princeton, New Jersey. His research interests are in complexity theory, parallel computation, combinatorics and graph theory, combinatorial optimization algorithms, randomness and cryptography, and distributed and neural networks. Program VisitsThe 2021 Abel Prize has been awarded to

**Avi Wigderson**of the**Institute for Advanced Study**(IAS) in Princeton, NJ, jointly shared with former IAS Visiting Professor László Lovász of Eötvös Loránd University.**Avi Wigderson**Home » Works Talks Optimization, Complexity and Math (or, can we prove P!=NP by gradient descent?). A 3-hour survey. MIMUW Lecture Series - October 8, 2021 Abstract [ Powerpoint ] [ Video ] Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing Computation Complexity Conference 2021 - July 20, 2021This is an overview of some of the works of

**Avi Wigderson**, 2021 Abel prize laureate.**Wigderson**'s contributions span many fields of computer science and mathematics. In this survey we focus on four subfields: cryptography, pseudorandomness, computational complexity lower bounds, and the theory of optimization over symmetric manifolds.**Avi Wigderson**. An action of a group on a vector space partitions the latter into a set of orbits. We consider three natural and useful algorithmic "isomorphism" or "classification" problems ...