This map shows the geographic impact of Andrew Wan'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 Andrew Wan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrew Wan more than expected).
This network shows the impact of papers produced by Andrew Wan. 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 Andrew Wan. The network helps show where Andrew Wan may publish in the future.
Co-authorship network of co-authors of Andrew Wan
This figure shows the co-authorship network connecting the top 25 collaborators of Andrew Wan.
A scholar is included among the top collaborators of Andrew Wan 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 Andrew Wan. Andrew Wan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Steinke, Thomas, Salil Vadhan, & Andrew Wan. (2017). . Theory of Computing. 13(1). 1–50.8 indexed citations
3.
Diakonikolas, Ilias, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, & Andrew Wan. (2015). . Edinburgh Research Explorer (University of Edinburgh). 21(1). 1–13.
4.
Diakonikolas, Ilias, Rocco A. Servedio, Li-Yang Tan, & Andrew Wan. (2014). . Theory of Computing. 10(1). 27–53.4 indexed citations
5.
Filmus, Yuval, Hamed Hatami, Steven Heilman, et al.. (2014). Real Analysis in Computer Science: A collection of Open Problems.3 indexed citations
Bogdanov, Andrej, Kunal Talwar, & Andrew Wan. (2010). Hard Instances for Satisfiability and Quasi-one-way Functions. 290–300.2 indexed citations
10.
Klivans, Adam R., Homin K. Lee, & Andrew Wan. (2010). Mansour's Conjecture is True for Random DNF Formulas. Conference on Learning Theory. 17. 23–380.10 indexed citations
11.
Diakonikolas, Ilias, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, & Andrew Wan. (2010). Efficiently Testing Sparse GF(2) Polynomials. Algorithmica. 61(3). 580–605.1 indexed citations
12.
Servedio, Rocco A., Tal Malkin, & Andrew Wan. (2010). Learning, cryptography, and the average case.2 indexed citations
Servedio, Rocco A. & Andrew Wan. (2005). Computing sparse permanents faster. Information Processing Letters. 96(3). 89–92.10 indexed citations
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.