This map shows the geographic impact of Cameron Musco'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 Cameron Musco with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Cameron Musco more than expected).
This network shows the impact of papers produced by Cameron Musco. 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 Cameron Musco. The network helps show where Cameron Musco may publish in the future.
Co-authorship network of co-authors of Cameron Musco
This figure shows the co-authorship network connecting the top 25 collaborators of Cameron Musco.
A scholar is included among the top collaborators of Cameron Musco 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 Cameron Musco. Cameron Musco is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Musco, Cameron, et al.. (2020). Node Embeddings and Exact Low-Rank Representations of Complex Networks. Neural Information Processing Systems. 33. 13185–13198.1 indexed citations
6.
Musco, Cameron, et al.. (2020). Importance Sampling via Local Sensitivity. International Conference on Artificial Intelligence and Statistics. 3099–3109.1 indexed citations
7.
Cohen, Michael B., Cameron Musco, & Jakub Pachocki. (2020). . Theory of Computing. 16(1). 1–25.6 indexed citations
Kalai, Adam Tauman, et al.. (2019). Learning to Prune: Speeding up Repeated Computations. CaltechAUTHORS (California Institute of Technology). 30–33.1 indexed citations
Hoskins, Jeremy G., Cameron Musco, Christopher Musco, & Charalampos E. Tsourakakis. (2018). Inferring Networks From Random Walk-Based Node Similarities. neural information processing systems. 31. 3704–3715.1 indexed citations
12.
Musco, Cameron & David P. Woodruff. (2017). Is Input Sparsity Time Possible for Kernel Low-Rank Approximation?. Neural Information Processing Systems. 30. 4435–4445.1 indexed citations
Avron, Haim, et al.. (2017). Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees. International Conference on Machine Learning. 253–262.15 indexed citations
15.
Musco, Cameron & Christopher Musco. (2017). Recursive Sampling for the Nyström Method. arXiv (Cornell University). 30. 3834–3846.24 indexed citations
Garber, Dan, Elad Hazan, Chi Jin, et al.. (2016). Faster eigenvector computation via shift-and-invert preconditioning. 2626–2634.2 indexed citations
18.
Musco, Cameron & Christopher Musco. (2015). Stronger Approximate Singular Value Decomposition via the Block Lanczos and Power Methods.. arXiv (Cornell University).4 indexed citations
19.
Musco, Cameron & Christopher Musco. (2015). Stronger and Faster Approximate Singular Value Decomposition via the Block Lanczos Method. arXiv (Cornell University).3 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.