World's Best Scientists 2026 revealed!
Award Badge
Mathematics
USA
2026

D-Index & Metrics

Computer Science

D-Index
99
Citations
52326
World Ranking
384
National Ranking
212

Mathematics

D-Index
98
Citations
51924
World Ranking
51
National Ranking
36

Research.com Recognitions

  • 2026 - Research.com Mathematics in United States Leader Award
  • 2025 - Research.com Mathematics in United States Leader Award
  • 2018 - ACM Fellow For contributions to theoretical computer science and mathematics
  • 2013 - Member of the National Academy of Sciences
  • 2011 - Fellow of the American Academy of Arts and Sciences
  • 1994 - Rolf Nevanlinna Prize

Overview

Avi Wigderson is affiliated with the Institute for Advanced Study in the United States. Their research primarily spans the fields of Computer Science and Mathematics, with a significant focus on subfields such as Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Geometry and Topology, and Algebra and Number Theory.

The scientist's work covers a variety of topics, notably including Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Machine Learning and Algorithms, graph theory and CDMA systems, Graph theory and applications, Coding theory and cryptography, and Commutative Algebra and Its Applications.

Among the recent papers authored or coauthored by Avi Wigderson are the following:

  • Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings, 2020, published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing, 2022, published in TheoretiCS
  • Unnamed paper, 2021, published in Theory of Computing
  • Connections between graphs and matrix spaces, 2023, published in Israel Journal of Mathematics
  • Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties), 2021, published in Journal für die reine und angewandte Mathematik (Crelles Journal)

The scientist frequently collaborates with several coauthors, including:

  • Oded Goldreich
  • Yuval Wigderson
  • Visu Makam
  • Youming Qiao
  • Chuanqi Zhang

Publications by this researcher often appear in several venues, with notable frequency in:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Theory of Computing
  • Israel Journal of Mathematics
  • SIAM Journal on Computing

Avi Wigderson has received several awards throughout their career, including:

  • ACM Fellow (2018) for contributions to theoretical computer science and mathematics
  • Member of the National Academy of Sciences (2013)
  • Fellow of the American Academy of Arts and Sciences (2011)
  • Rolf Nevanlinna Prize (1994)

Best Publications

  • How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority

    Oded Goldreich;Silvio Micali;Avi Wigderson

  • How to play ANY mental game

    O. Goldreich;S. Micali;A. Wigderson

  • Completeness theorems for non-cryptographic fault-tolerant distributed computation

    Michael Ben-Or;Shafi Goldwasser;Avi Wigderson

  • Completeness theorems for non-cryptographic fault-tolerant distributed computation

    Michael Ben-Or;Shafi Goldwasser;Avi Wigderson

  • Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

    Oded Goldreich;Silvio Micali;Avi Wigderson

  • Hardness vs randomness

    Noam Nisan;Avi Wigderson

  • Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)

    Michael Ben-Or;Shafi Goldwasser;Avi Wigderson

  • P = BPP if E requires exponential circuits: derandomizing the XOR lemma

    Russell Impagliazzo;Avi Wigderson

  • Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

    Oded Goldreich;Silvio Micali;Avi Wigderson

  • Multi-prover interactive proofs: how to remove intractability assumptions

    Michael Ben-Or;Shafi Goldwasser;Joe Kilian;Avi Wigderson

  • On span programs

    M. Karchmer;A. Wigderson

  • Short proofs are narrow—resolution made simple

    Eli Ben-Sasson;Avi Wigderson

  • Short proofs are narrow—resolution made simple

    Eli Ben-Sasson;Avi Wigderson

  • Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors

    Omer Reingold;Salil P. Vadhan;Avi Wigderson

  • On the power of randomization in on-line algorithms

    S. Ben-David;A. Borodin;R. Karp;G. Tardos

  • Theory of computing: a scientific perspective

    Oded Goldreich;Avi Wigderson

  • Quantum vs. classical communication and computation

    Harry Buhrman;Richard Cleve;Avi Wigderson

  • BPP has subexponential time simulations unless EXPTIME has publishable proofs

    László Babai;Lance Fortnow;Noam Nisan;Avi Wigderson

  • Constructing a perfect matching is in random NC

    R M Karp;E Upfal;A Wigderson

  • Monotone circuits for connectivity require super-logarithmic depth

    Mauricio Karchmer;Avi Wigderson

Frequent Co-Authors

Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Noam Nisan
Noam Nisan Hebrew University of Jerusalem
Russell Impagliazzo
Russell Impagliazzo University of California, San Diego
Boaz Barak
Boaz Barak Harvard University
Eli Ben-Sasson
Eli Ben-Sasson Technion – Israel Institute of Technology
Amir Shpilka
Amir Shpilka Tel Aviv University
Richard M. Karp
Richard M. Karp University of California, Berkeley
Salil P. Vadhan
Salil P. Vadhan Harvard University
Eli Upfal
Eli Upfal Brown University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can broaden career opportunities. Many professionals consider an MBA to complement their quantitative skills. Programs such as year long MBA programs offer accelerated learning paths that fit well for those eager to enhance business acumen quickly.

When selecting an MBA program, it's valuable to know that you can transfer credits into an MBA program, making it easier to build on previous coursework and potentially shorten the time to graduation.

Aside from MBA options, pursuing a master's in Data Analytics is another strategic move. Programs highlighted under analytics masters programs emphasize skills that are increasingly in demand for roles in technology, finance, and healthcare.

For those concerned about admissions, researching the easiest MBA programs can provide insight into accessible pathways, making advanced business education more attainable without compromising quality.

Best Scientists Citing Avi Wigderson

Trending Scientists