Avi Wigderson
About
In The Last Decade
Avi Wigderson
283 papers receiving 11.2k citations
Hit Papers
Peers
Comparison fields: 5 of 117
- Artificial Intelligence 8.3k
- Computational Theory and Mathematics 7.6k
- Computer Networks and Communications 2.7k
- Electrical and Electronic Engineering 1.2k
- Information Systems 988
Countries citing papers authored by Avi Wigderson
This map shows the geographic impact of Avi Wigderson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Avi Wigderson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Avi Wigderson more than expected).
Fields of papers citing papers by Avi Wigderson
This network shows the impact of papers produced by Avi Wigderson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Avi Wigderson. The network helps show where Avi Wigderson may publish in the future.
Co-authorship network of co-authors of Avi Wigderson
This figure shows the co-authorship network connecting the top 25 collaborators of Avi Wigderson. A scholar is included among the top collaborators of Avi Wigderson based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Avi Wigderson. Avi Wigderson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Constructing Large Families of Pairwise Far Permutations: Good Permutation Codes Based on the Shuffle-Exchange Network. | 1 |
| 2 | 6 | |
| 3 | 5 | |
| 4 | Algorithmic aspects of Brascamp-Lieb inequalities. | 2 |
| 5 | Sum-of-squares lower bounds for Sparse PCA | 8 |
| 6 | On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions. | 1 |
| 7 | Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. | 2 |
| 8 | Non-commutative circuits and the sum-of-squares problem. | 1 |
| 9 | Monotone expanders - constructions and applications. | 1 |
| 10 | Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications | 2 |
| 11 | Pairwise Independence and Derandomization (Foundations and Trends(R) in Theoretical Computer Science) | 2 |
| 12 | A Randomness-Efficient Sampler for Matrix-valued Functions and Applications | 2 |
| 13 | On Pseudorandomness with respect to Deterministic Observers. | 5 |
| 14 | Extracting Randomness via Repeated Condensing | 1 |
| 15 | Improved Derandomization of BPP Using a Hitting Set Generator | 7 |
| 16 | The Wonders of the Digital Envelope - A Crash Course in Modern Cryptography. | 1 |
| 17 | Probabilistic Communication Complexity of Boolean Relations (Extended Abstract) | 4 |
| 18 | Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract) | 15 |
| 19 | Improving the performance guarantee for approximate graph coloring | 1 |
| 20 | Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version) | 11 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.