H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Mathematics H-index 81 Citations 38,899 226 World Ranking 60 National Ranking 35
Computer Science H-index 81 Citations 36,396 229 World Ranking 402 National Ranking 239

Research.com Recognitions

Awards & Achievements

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

What is he best known for?

The fields of study he is best known for:

  • 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.

His most cited work include:

  • 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)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

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

What were the highlights of his more recent work (between 2013-2021)?

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

In recent papers he was focusing on the following fields of study:

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.

Between 2013 and 2021, his most popular works were:

  • 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)

In his most recent research, the most cited papers focused on:

  • 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.

Top Publications

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)

4614 Citations

How to play ANY mental game

O. Goldreich;S. Micali;A. Wigderson.
symposium on the theory of computing (1987)

4182 Citations

Completeness theorems for non-cryptographic fault-tolerant distributed computation

Michael Ben-Or;Shafi Goldwasser;Avi Wigderson.
symposium on the theory of computing (1988)

2407 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)

1639 Citations

Hardness vs randomness

Noam Nisan;Avi Wigderson.
Journal of Computer and System Sciences (1994)

1014 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)

720 Citations

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

Russell Impagliazzo;Avi Wigderson.
symposium on the theory of computing (1997)

664 Citations

Short proofs are narrow—resolution made simple

Eli Ben-Sasson;Avi Wigderson.
symposium on the theory of computing (1999)

601 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)

597 Citations

Multi-prover interactive proofs: how to remove intractability assumptions

Michael Ben-Or;Shafi Goldwasser;Joe Kilian;Avi Wigderson.
symposium on the theory of computing (1988)

549 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Avi Wigderson

Rafail Ostrovsky

Rafail Ostrovsky

University of California, Los Angeles

Publications: 141

Oded Goldreich

Oded Goldreich

Weizmann Institute of Science

Publications: 141

Yuval Ishai

Yuval Ishai

Technion – Israel Institute of Technology

Publications: 139

Salil P. Vadhan

Salil P. Vadhan

Harvard University

Publications: 106

Yehuda Lindell

Yehuda Lindell

Bar-Ilan University

Publications: 94

Amit Sahai

Amit Sahai

University of California, Los Angeles

Publications: 94

Eyal Kushilevitz

Eyal Kushilevitz

Technion – Israel Institute of Technology

Publications: 92

Moni Naor

Moni Naor

Weizmann Institute of Science

Publications: 89

Ivan Damgård

Ivan Damgård

Aarhus University

Publications: 88

Ran Raz

Ran Raz

Princeton University

Publications: 82

Rafael Pass

Rafael Pass

Cornell University

Publications: 82

Madhu Sudan

Madhu Sudan

Harvard University

Publications: 75

Ran Canetti

Ran Canetti

Boston University

Publications: 73

Toniann Pitassi

Toniann Pitassi

University of Toronto

Publications: 72

Shafi Goldwasser

Shafi Goldwasser

MIT

Publications: 70

Something went wrong. Please try again later.