- Home
- Best Scientists - Mathematics
- Avi Wigderson

Mathematics

USA

2023

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
91
Citations
48,218
381
World Ranking
49
National Ranking
35

Computer Science
D-index
91
Citations
48,555
395
World Ranking
338
National Ranking
201

2023 - 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

- Algorithm
- Discrete mathematics
- Combinatorics

Avi Wigderson focuses on Discrete mathematics, Combinatorics, Theoretical computer science, Mathematical proof and Upper and lower bounds. The Discrete mathematics study combines topics in areas such as Turing machine, Computational complexity theory, Zero-knowledge proof, Randomness and String. His studies deal with areas such as Monotone polygon, Communication complexity and Exponential function as well as Combinatorics.

His work carried out in the field of Theoretical computer science brings together such families of science as Cryptographic protocol, Cryptography, Fault tolerance, Completeness and Secure two-party computation. His Interactive proof system, Probabilistically checkable proof and Proof complexity study in the realm of Mathematical proof connects with subjects such as Generality. His Upper and lower bounds research integrates issues from Probabilistic analysis of algorithms, Randomized algorithm, Game theory and Deterministic algorithm.

- How to play ANY mental game (2707 citations)
- Completeness theorems for non-cryptographic fault-tolerant distributed computation (2019 citations)
- How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority (1655 citations)

The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Upper and lower bounds, Theoretical computer science and Mathematical proof. Avi Wigderson interconnects Function, Polynomial and Computational complexity theory in the investigation of issues within Discrete mathematics. The various areas that Avi Wigderson examines in his Polynomial study include Commutative property and Algebraic number.

His Combinatorics research focuses on subjects like Rank, which are linked to Matrix. His Theoretical computer science study frequently draws connections between related disciplines such as Cryptography. His Mathematical proof study frequently links to adjacent areas such as Simple.

- Discrete mathematics (57.58%)
- Combinatorics (49.76%)
- Upper and lower bounds (17.06%)

- Discrete mathematics (57.58%)
- Combinatorics (49.76%)
- Polynomial (10.19%)

His main research concerns Discrete mathematics, Combinatorics, Polynomial, Mathematical proof and Time complexity. Avi Wigderson is studying Boolean circuit, which is a component of Discrete mathematics. His Combinatorics study incorporates themes from Point and Block code.

His studies examine the connections between Polynomial and genetics, as well as such issues in Tensor, with regards to Arithmetic. His work deals with themes such as Simple, Bounded function and Theoretical computer science, which intersect with Mathematical proof. His Time complexity research incorporates elements of Commutative property, Algebra, Invariant theory and Quantum information.

- How to play any mental game, or a completeness theorem for protocols with honest majority (331 citations)
- A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing (59 citations)
- Much Faster Algorithms for Matrix Scaling (43 citations)

- Algorithm
- Algebra
- Combinatorics

Avi Wigderson mostly deals with Discrete mathematics, Combinatorics, Time complexity, Commutative property and Invariant theory. His Discrete mathematics research integrates issues from Field, Matrix and Rank. Avi Wigderson combines subjects such as Point and Upper and lower bounds with his study of Combinatorics.

His research investigates the link between Time complexity and topics such as Algebra that cross with problems in Computational complexity theory and Polytope. Avi Wigderson has included themes like Polynomial, Operator and Convex optimization in his Commutative property study. His Invariant theory study also includes

- Polynomial identity testing, which have a strong connection to Randomized algorithm,
- Linear algebra together with Identity testing and Quantum information.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

How to play any mental game, or a completeness theorem for protocols with honest majority

Oded Goldreich;Silvio Micali;Avi Wigderson.

Providing Sound Foundations for Cryptography **(2019)**

5260 Citations

How to play ANY mental game

O. Goldreich;S. Micali;A. Wigderson.

symposium on the theory of computing **(1987)**

4541 Citations

Completeness theorems for non-cryptographic fault-tolerant distributed computation

Michael Ben-Or;Shafi Goldwasser;Avi Wigderson.

symposium on the theory of computing **(1988)**

3523 Citations

Completeness theorems for non-cryptographic fault-tolerant distributed computation

Michael Ben-Or;Shafi Goldwasser;Avi Wigderson.

Providing Sound Foundations for Cryptography **(2019)**

3220 Citations

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

Oded Goldreich;Silvio Micali;Avi Wigderson.

symposium on the theory of computing **(1987)**

3081 Citations

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

Oded Goldreich;Silvio Micali;Avi Wigderson.

Journal of the ACM **(1991)**

1938 Citations

Hardness vs randomness

Noam Nisan;Avi Wigderson.

Journal of Computer and System Sciences **(1994)**

1109 Citations

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

Michael Ben-Or;Shafi Goldwasser;Avi Wigderson.

symposium on the theory of computing **(1988)**

809 Citations

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

Oded Goldreich;Silvio Micali;Avi Wigderson.

foundations of computer science **(1986)**

752 Citations

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

Russell Impagliazzo;Avi Wigderson.

symposium on the theory of computing **(1997)**

738 Citations

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

Contact us

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:

Weizmann Institute of Science

Hebrew University of Jerusalem

University of California, San Diego

Harvard University

Technion – Israel Institute of Technology

Tel Aviv University

Brown University

University of California, Berkeley

MIT

Harvard University

Open Insights

Princeton University

King Abdullah University of Science and Technology

Spanish National Research Council

Qatar University

Osaka University

Max Delbrück Center for Molecular Medicine

Ghent University

University of Minnesota

Pohang University of Science and Technology

GlaxoSmithKline (United Kingdom)

University of Vermont

Pfizer (United States)

University of Nottingham

University of Sydney

University of Colorado Boulder

Something went wrong. Please try again later.