Samson Zhou

572 total citations
23 papers, 123 citations indexed

About

Samson Zhou is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Samson Zhou has authored 23 papers receiving a total of 123 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Artificial Intelligence, 6 papers in Computational Theory and Mathematics and 5 papers in Computer Networks and Communications. Recurrent topics in Samson Zhou's work include Machine Learning and Algorithms (9 papers), Cryptography and Data Security (7 papers) and Complexity and Algorithms in Graphs (6 papers). Samson Zhou is often cited by papers focused on Machine Learning and Algorithms (9 papers), Cryptography and Data Security (7 papers) and Complexity and Algorithms in Graphs (6 papers). Samson Zhou collaborates with scholars based in United States, Israel and Hong Kong. Samson Zhou's co-authors include Jeremiah Blocki, Elena Grigorescu, Sidharth Jaggi, David P. Woodruff, Vladimir Braverman, Grigory Yaroslavtsev, Margarita Osadchy, Dan Feldman, Petros Drineas and Slobodan Mitrović and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Neural Networks and Learning Systems and Lecture notes in computer science.

In The Last Decade

Samson Zhou

20 papers receiving 115 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Samson Zhou United States 6 64 31 28 28 24 23 123
Junji Shikata Japan 6 70 1.1× 38 1.2× 29 1.0× 21 0.8× 4 0.2× 49 125
Kevin Yeo United States 8 135 2.1× 30 1.0× 38 1.4× 15 0.5× 7 0.3× 22 186
Benjamin Fuller United States 10 89 1.4× 57 1.8× 73 2.6× 48 1.7× 9 0.4× 23 217
Siwei Sun China 10 227 3.5× 13 0.4× 24 0.9× 15 0.5× 12 0.5× 37 267
Anoosheh Heidarzadeh United States 8 109 1.7× 148 4.8× 7 0.3× 11 0.4× 4 0.2× 31 226
Y. Lee South Korea 5 78 1.2× 94 3.0× 61 2.2× 9 0.3× 8 0.3× 14 245
Chang‐An Zhao China 8 167 2.6× 27 0.9× 86 3.1× 4 0.1× 5 0.2× 40 196
Elliot Meyerson United States 7 159 2.5× 8 0.3× 9 0.3× 10 0.4× 7 0.3× 15 216
Jan Feyereisl United Kingdom 6 73 1.1× 17 0.5× 12 0.4× 23 0.8× 12 183
Stephan Tinguely Switzerland 8 44 0.7× 197 6.4× 12 0.4× 21 0.8× 11 270

Countries citing papers authored by Samson Zhou

Since Specialization
Citations

This map shows the geographic impact of Samson Zhou'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 Samson Zhou with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Samson Zhou more than expected).

Fields of papers citing papers by Samson Zhou

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Samson Zhou. 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 Samson Zhou. The network helps show where Samson Zhou may publish in the future.

Co-authorship network of co-authors of Samson Zhou

This figure shows the co-authorship network connecting the top 25 collaborators of Samson Zhou. A scholar is included among the top collaborators of Samson Zhou 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 Samson Zhou. Samson Zhou is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
2.
Blocki, Jeremiah, Peiyuan Liu, Ling Ren, & Samson Zhou. (2024). Bandwidth-Hard Functions: Reductions and Lower Bounds. Journal of Cryptology. 37(2).
3.
Woodruff, David P., et al.. (2024). Streaming Algorithms with Few State Changes. Proceedings of the ACM on Management of Data. 2(2). 1–28.
4.
Cohen-Addad, Vincent, David P. Woodruff, & Samson Zhou. (2023). Streaming Euclidean k-median and k-means with o(log n) Space. 883–908. 3 indexed citations
5.
Zhou, Samson, et al.. (2022). A Fast, Provably Accurate Approximation Algorithm for Sparse Principal Component Analysis Reveals Human Genetic Variation Across the World. Lecture notes in computer science. 86–106. 2 indexed citations
6.
Ajtai, Miklós, et al.. (2022). The White-Box Adversarial Data Stream Model. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). 15–27. 3 indexed citations
7.
Woodruff, David P., et al.. (2022). Memory bounds for the experts problem. 1158–1171. 3 indexed citations
8.
Blocki, Jeremiah, et al.. (2021). Relaxed Locally Correctable Codes in Computationally Bounded Channels. IEEE Transactions on Information Theory. 67(7). 4338–4360. 4 indexed citations
9.
Osadchy, Margarita, et al.. (2020). Data-Independent Neural Pruning via Coresets. International Conference on Learning Representations. 3 indexed citations
10.
Mahabadi, Sepideh, Ilya Razenshteyn, David P. Woodruff, & Samson Zhou. (2020). Non-adaptive adaptive sampling on turnstile streams. 1251–1264. 4 indexed citations
11.
Braverman, Vladimir, Petros Drineas, Cameron Musco, et al.. (2020). Near Optimal Linear Algebra in the Online and Sliding Window Models. PubMed Central. 517–528. 10 indexed citations
12.
Zhou, Samson, et al.. (2019). On Activation Function Coresets for Network Pruning. arXiv (Cornell University). 1 indexed citations
13.
Yaroslavtsev, Grigory, et al.. (2019). "Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack.. arXiv (Cornell University). 3263–3274. 2 indexed citations
14.
Grigorescu, Elena, et al.. (2019). Nearly Optimal Sparse Group Testing. IEEE Transactions on Information Theory. 65(5). 2760–2773. 18 indexed citations
15.
Mitrović, Slobodan, et al.. (2019). Adversarially Robust Submodular Maximization under Knapsack Constraints. 148–156. 8 indexed citations
16.
Braverman, Vladimir, Elena Grigorescu, Harry G. Lang, David P. Woodruff, & Samson Zhou. (2018). Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5 indexed citations
17.
Grigorescu, Elena, et al.. (2018). Structural Results on Matching Estimation with Applications to Streaming. Algorithmica. 81(1). 367–392. 2 indexed citations
18.
Blocki, Jeremiah, et al.. (2018). On the Economics of Offline Password Cracking. 853–871. 33 indexed citations
19.
Blocki, Jeremiah, Ling Ren, & Samson Zhou. (2018). Bandwidth-Hard Functions. 1820–1836. 4 indexed citations
20.
Grigorescu, Elena, et al.. (2016). Nearly optimal sparse group testing. 401–408. 8 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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Junji Shikata Breakdown of academic impact, for papers by Kevin Yeo Breakdown of academic impact, for papers by Benjamin Fuller Breakdown of academic impact, for papers by Siwei Sun Breakdown of academic impact, for papers by Anoosheh Heidarzadeh Breakdown of academic impact, for papers by Y. Lee Breakdown of academic impact, for papers by Chang‐An Zhao Breakdown of academic impact, for papers by Elliot Meyerson Breakdown of academic impact, for papers by Jan Feyereisl Breakdown of academic impact, for papers by Stephan Tinguely
Rankless by CCL
2026