Countries citing papers authored by Gregory Valiant
Since
Specialization
Citations
This map shows the geographic impact of Gregory Valiant'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 Gregory Valiant with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gregory Valiant more than expected).
This network shows the impact of papers produced by Gregory Valiant. 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 Gregory Valiant. The network helps show where Gregory Valiant may publish in the future.
Co-authorship network of co-authors of Gregory Valiant
This figure shows the co-authorship network connecting the top 25 collaborators of Gregory Valiant.
A scholar is included among the top collaborators of Gregory Valiant 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 Gregory Valiant. Gregory Valiant is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Diakonikolas, Ilias, et al.. (2019). A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families. arXiv (Cornell University). 32. 7721–7733.3 indexed citations
3.
Tai, Kai Sheng, Peter Bailis, & Gregory Valiant. (2019). Equivariant Transformer Networks.. International Conference on Machine Learning. 6086–6095.8 indexed citations
4.
Guan, Melody Y. & Gregory Valiant. (2019). A Surprising Density of Illusionable Natural Speech.. eScholarship (California Digital Library). 1871.2 indexed citations
5.
Kong, Weihao, et al.. (2017). Learning Populations of Parameters. Neural Information Processing Systems. 30. 5778–5787.2 indexed citations
6.
Valiant, Gregory & Paul Valiant. (2017). Estimating the Unseen. Journal of the ACM. 64(6). 1–41.26 indexed citations
Roughgarden, Tim & Gregory Valiant. (2016). CS168: The Modern Algorithmic Toolbox Lecture #2: Approximate Heavy Hitters and the Count-Min Sketch.
9.
Steinhardt, Jacob, Gregory Valiant, & Stefan Wager. (2015). Memory, Communication, and Statistical Queries. Electronic colloquium on computational complexity. 22. 126–1516.2 indexed citations
10.
Bhattacharya, Bhaswar B. & Gregory Valiant. (2015). Testing closeness with unequal sized samples. Neural Information Processing Systems. 28. 2611–2619.7 indexed citations
11.
Andoni, Alexandr, Rina Panigrahy, Gregory Valiant, & Li Zhang. (2014). Learning Polynomials with Neural Networks. International Conference on Machine Learning. 1908–1916.40 indexed citations
12.
Valiant, Paul & Gregory Valiant. (2013). Estimating the Unseen: Improved Estimators for Entropy and other Properties. Neural Information Processing Systems. 26. 2157–2165.39 indexed citations
13.
Valiant, Gregory & Paul Valiant. (2013). Instance-by-instance optimal identity testing.. Electronic colloquium on computational complexity. 20. 111.1 indexed citations
Valiant, Gregory. (2012). Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas with Noise.. Electronic colloquium on computational complexity. 19. 6.6 indexed citations
Valiant, Gregory & Paul Valiant. (2010). Estimating the unseen: A sublinear-sample canonical estimator of distributions.. Electronic colloquium on computational complexity. 17. 180.15 indexed citations
19.
Papadimitriou, Christos H. & Gregory Valiant. (2010). A New Look at Selfish Routing. 178–187.18 indexed citations
20.
Valiant, Gregory & Paul Valiant. (2010). A CLT and tight lower bounds for estimating entropy.. Electronic colloquium on computational complexity. 17. 179.33 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.