Ben Adcock

4.0k total citations · 1 hit paper
72 papers, 1.4k citations indexed

About

Ben Adcock is a scholar working on Computational Mechanics, Applied Mathematics and Radiology, Nuclear Medicine and Imaging. According to data from OpenAlex, Ben Adcock has authored 72 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computational Mechanics, 26 papers in Applied Mathematics and 20 papers in Radiology, Nuclear Medicine and Imaging. Recurrent topics in Ben Adcock's work include Sparse and Compressive Sensing Techniques (32 papers), Image and Signal Denoising Methods (18 papers) and Mathematical Analysis and Transform Methods (16 papers). Ben Adcock is often cited by papers focused on Sparse and Compressive Sensing Techniques (32 papers), Image and Signal Denoising Methods (18 papers) and Mathematical Analysis and Transform Methods (16 papers). Ben Adcock collaborates with scholars based in Canada, United Kingdom and United States. Ben Adcock's co-authors include Anders C. Hansen, Clarice Poon, Vegard Antun, Francesco Renna, Daan Huybrechs, Bogdan Roman, Nick Dexter, Simone Brugiapaglia, Il Yong Chun and Milana Gatarić and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Journal of Computational Physics and IEEE Transactions on Information Theory.

In The Last Decade

Ben Adcock

69 papers receiving 1.3k citations

Hit Papers

On instabilities of deep learning in image reconstruction... 2020 2026 2022 2024 2020 100 200 300 400

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Ben Adcock Canada 18 562 496 323 305 295 72 1.4k
Anders C. Hansen United Kingdom 17 405 0.7× 481 1.0× 268 0.8× 266 0.9× 211 0.7× 39 1.2k
Yifei Lou United States 25 1.0k 1.8× 520 1.0× 994 3.1× 587 1.9× 60 0.2× 80 2.2k
Serena Morigi Italy 20 558 1.0× 117 0.2× 488 1.5× 215 0.7× 133 0.5× 83 1.4k
Gerlind Plonka Germany 23 559 1.0× 130 0.3× 1.1k 3.3× 162 0.5× 288 1.0× 95 1.8k
C. Si̇nan Güntürk United States 12 594 1.1× 98 0.2× 462 1.4× 327 1.1× 112 0.4× 25 1.2k
James G. Nagy United States 26 905 1.6× 266 0.5× 1.1k 3.4× 445 1.5× 230 0.8× 107 2.5k
Bradley J. Lucier United States 18 597 1.1× 123 0.2× 1.1k 3.4× 169 0.6× 300 1.0× 44 1.9k
Guy Gilboa Israel 16 779 1.4× 229 0.5× 2.1k 6.4× 222 0.7× 208 0.7× 48 2.9k
Rachel Ward United States 19 811 1.4× 111 0.2× 339 1.0× 266 0.9× 51 0.2× 64 1.4k
Andreas Rieder Germany 20 239 0.4× 171 0.3× 249 0.8× 257 0.8× 181 0.6× 63 1.1k

Countries citing papers authored by Ben Adcock

Since Specialization
Citations

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

Fields of papers citing papers by Ben Adcock

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ben Adcock

This figure shows the co-authorship network connecting the top 25 collaborators of Ben Adcock. A scholar is included among the top collaborators of Ben Adcock 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 Ben Adcock. Ben Adcock 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.
Adcock, Ben, et al.. (2025). Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples. Journal of Complexity. 89. 101933–101933.
2.
Adcock, Ben, et al.. (2025). Restarts Subject to Approximate Sharpness: A Parameter-Free and Optimal Scheme For First-Order Methods. Foundations of Computational Mathematics.
3.
Antun, Vegard, et al.. (2025). The Troublesome Kernel: On Hallucinations, No Free Lunches, and the Accuracy-Stability Tradeoff in Inverse Problems. SIAM Review. 67(1). 73–104. 3 indexed citations
5.
Adcock, Ben, et al.. (2024). Optimal approximation of infinite-dimensional holomorphic functions. CALCOLO. 61(1). 5 indexed citations
6.
Adcock, Ben, et al.. (2024). Near-optimal learning of Banach-valued, high-dimensional functions via deep neural networks. Neural Networks. 181. 106761–106761. 3 indexed citations
7.
Adcock, Ben, et al.. (2024). Optimal deep learning of holomorphic operators between Banach spaces. 27725–27789. 1 indexed citations
9.
Adcock, Ben, Simone Brugiapaglia, & Clayton Webster. (2022). Sparse Polynomial Approximation of High-Dimensional Functions. Society for Industrial and Applied Mathematics eBooks. 31 indexed citations
10.
Adcock, Ben, Simone Brugiapaglia, & Clayton Webster. (2017). Polynomial approximation of high-dimensional functions via compressed sensing. arXiv (Cornell University). 1 indexed citations
11.
Adcock, Ben, Milana Gatarić, & José Luis Romero. (2017). Computing reconstructions from nonuniform Fourier samples: Universality of stability barriers and stable sampling rates. Applied and Computational Harmonic Analysis. 46(2). 226–249. 3 indexed citations
12.
Li, Chen & Ben Adcock. (2017). Compressed sensing with local structure: Uniform recovery guarantees for the sparsity in levels class. Applied and Computational Harmonic Analysis. 46(3). 453–477. 15 indexed citations
13.
Chun, Il Yong, Chen Li, & Ben Adcock. (2016). Sparsity and parallel acquisition: Optimal uniform and nonuniform recovery guarantees. 1–6. 1 indexed citations
14.
Adcock, Ben, Milana Gatarić, & Anders C. Hansen. (2015). Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples. Applied and Computational Harmonic Analysis. 42(3). 508–535. 9 indexed citations
15.
Adcock, Ben, Anders C. Hansen, Clarice Poon, & Bogdan Roman. (2013). Breaking the coherence barrier: asymptotic incoherence and asymptotic sparsity in compressed sensing. arXiv (Cornell University). 25 indexed citations
16.
Adcock, Ben & Daan Huybrechs. (2013). On the resolution power of Fourier extensions for oscillatory functions. Journal of Computational and Applied Mathematics. 260. 312–336. 28 indexed citations
17.
Adcock, Ben, Anders C. Hansen, & Clarice Poon. (2013). On optimal wavelet reconstructions from Fourier samples: Linearity and universality of the stable sampling rate. Applied and Computational Harmonic Analysis. 36(3). 387–415. 23 indexed citations
18.
Adcock, Ben & Anders C. Hansen. (2012). A Generalized Sampling Theorem for Stable Reconstructions in Arbitrary Bases. Journal of Fourier Analysis and Applications. 18(4). 685–716. 42 indexed citations
19.
Adcock, Ben. (2011). On the convergence of expansions in polyharmonic eigenfunctions. Journal of Approximation Theory. 163(11). 1638–1674. 2 indexed citations
20.
Adcock, Ben & Anders C. Hansen. (2011). Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon. Applied and Computational Harmonic Analysis. 32(3). 357–388. 44 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

Rankless by CCL
2026