Edgar Solomonik

2.0k total citations
40 papers, 768 citations indexed

About

Edgar Solomonik is a scholar working on Hardware and Architecture, Computational Mathematics and Computational Theory and Mathematics. According to data from OpenAlex, Edgar Solomonik has authored 40 papers receiving a total of 768 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Hardware and Architecture, 21 papers in Computational Mathematics and 14 papers in Computational Theory and Mathematics. Recurrent topics in Edgar Solomonik's work include Parallel Computing and Optimization Techniques (26 papers), Tensor decomposition and applications (21 papers) and Interconnection Networks and Systems (7 papers). Edgar Solomonik is often cited by papers focused on Parallel Computing and Optimization Techniques (26 papers), Tensor decomposition and applications (21 papers) and Interconnection Networks and Systems (7 papers). Edgar Solomonik collaborates with scholars based in United States, Switzerland and Italy. Edgar Solomonik's co-authors include James Demmel, Jeff R. Hammond, Devin A. Matthews, Torsten Hoefler, Maciej Besta, Laxmikant V. Kalé, John F. Stanton, Michael Pellauer, Hadi Asghari-Moghaddam and Aamer Jaleel and has published in prestigious journals such as SIAM Review, SIAM Journal on Scientific Computing and SIAM Journal on Matrix Analysis and Applications.

In The Last Decade

Edgar Solomonik

37 papers receiving 736 citations

Peers

Edgar Solomonik

HA

CNC

AI

CVPR

CM

Jee Choi United States

Kazushige Goto United States

Jiajia Li United States

Greg Henry United States

Hartwig Anzt United States

Paolo Bientinesi Germany

Gerald Baumgartner United States

Field G. Zee United States

Olga Holtz United States

L. S. Blackford United States

Jee Choi United States

Edgar Solomonik

589 ×1.4

HA

456 ×1.5

CNC

133 ×0.6

AI

81 ×0.4

CVPR

106 ×0.7

CM

Citations per year, relative to Edgar Solomonik Edgar Solomonik (= 1×) peers Jee Choi

Countries citing papers authored by Edgar Solomonik

Since Specialization

Citations

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

Fields of papers citing papers by Edgar Solomonik

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Edgar Solomonik

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Solomonik, Edgar, et al.. (2024). Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. 169–181. 3 indexed citations

2.

Ma, Linjian, Matthew Fishman, E. Miles Stoudenmire, & Edgar Solomonik. (2024). Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm. Quantum. 8. 1580–1580.

3.

Pednault, Edwin, et al.. (2024). Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). 3 indexed citations

4.

Asghari-Moghaddam, Hadi, Michael Pellauer, Kartik Hegde, et al.. (2023). Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling (Extended Abstract). 15–16. 1 indexed citations

5.

Solomonik, Edgar, et al.. (2023). Application Performance Modeling via Tensor Completion. 1–14. 3 indexed citations

6.

Solomonik, Edgar, et al.. (2023). Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition. SIAM Journal on Scientific Computing. 45(6). A2781–A2812.

7.

Gao, Yang, Phillip Helms, Garnet Kin‐Lic Chan, & Edgar Solomonik. (2023). Codebase release 1.3 for SymTensor. 1 indexed citations

8.

Gao, Yang, Phillip Helms, Garnet Kin‐Lic Chan, & Edgar Solomonik. (2023). Automatic transformation of irreducible representations for efficient contraction of tensors with cyclic group symmetry. 1 indexed citations

9.

Solomonik, Edgar, et al.. (2022). Cost-Efficient Gaussian Tensor Network Embeddings for Tensor-Structured Inputs. 38980–38993.

10.

Zhang, Zecheng, et al.. (2022). Distributed-memory tensor completion for generalized loss functions in python using new sparse tensor kernels. Journal of Parallel and Distributed Computing. 169. 269–285. 8 indexed citations

11.

Ma, Linjian & Edgar Solomonik. (2021). Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree. 412–421. 3 indexed citations

12.

Ma, Linjian, Jiayu Ye, & Edgar Solomonik. (2020). AutoHOOT. 125–137. 7 indexed citations

13.

Besta, Maciej, et al.. (2017). SlimSell: A Vectorizable Graph Representation for Breadth-First Search. 32–41. 28 indexed citations

14.

Solomonik, Edgar, et al.. (2017). Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations. 678–687. 5 indexed citations

15.

Solomonik, Edgar & James Demmel. (2015). Contracting symmetric tensors using fewer multiplications. Repository for Publications and Research Data (ETH Zurich). 2 indexed citations

16.

Georganas, Evangelos, et al.. (2013). A Communication-Optimal N-Body Algorithm for Direct Interactions. eScholarship (California Digital Library). 1075–1084. 18 indexed citations

17.

Georganas, Evangelos, Jorge González‐Domínguez, Edgar Solomonik, et al.. (2012). Communication avoiding and overlapping for numerical linear algebra. RUC (Universidade Da Coruña). 1–11. 12 indexed citations

18.

Solomonik, Edgar, Abhinav Bhatelé, & James Demmel. (2011). Improving communication performance in dense linear algebra via topology aware collectives. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). 1–11. 35 indexed citations

19.

Solomonik, Edgar & Laxmikant V. Kalé. (2010). Highly scalable parallel sorting. 1–12. 46 indexed citations

20.

Bhatelé, Abhinav, Lukasz Wesolowski, Eric J. Bohm, Edgar Solomonik, & Laxmikant V. Kalé. (2010). Understanding Application Performance via Micro-benchmarks on Three Large Supercomputers: Intrepid, Ranger and Jaguar. The International Journal of High Performance Computing Applications. 24(4). 411–427. 20 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