ES
Edgar Solomonik
cs.NAmath.NAcs.DCcs.DScs.LGcs.MSquant-phcs.DMcs.PFphysics.comp-ph
On Valency
published · living versionsW_5sj46647·v2 · currentpublished
Preprints & journals
44 papers in the corpus · 2015–2026Simultaneous Matrix Multiplication by Tensor Contraction Aggregation2610.26563v2 · Edgar Solomonik, Markus Blaser2026 · 0 citationsarXivon Valency
Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop2602.05394v3 · Noah Amsel, Yves Baumann, Paul Beckman et al.2026 · 0 citationsarXiv
Simulating Clifford Circuits with Gaussian Elimination2511.06127v3 · Yuchen Pang, Edgar Solomonik2025 · 0 citationsarXiv
Efficient Tensor Completion Algorithms for Highly Oscillatory Operators2510.17734v3 · Navjot Singh, Edgar Solomonik, Xiaoye Sherry Li et al.2025 · 0 citationsarXiv
Sparse LDL, LU, and inverse butterfly factorization via tree decomposition2504.20305v5 · Edgar Solomonik2025 · 0 citationsarXiv
Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm2406.09769v3 · Linjian Ma, Matthew Fishman, Miles Stoudenmire et al.2024 · 3 citationsQuantum 8, 1580 (2024)
Accelerating Galerkin Reduced-Order Models for Turbulent Flows with Tensor Decomposition2311.03694v2 · Ping-Hsuan Tsai, Paul Fischer, Edgar Solomonik2023 · 3 citationsarXiv
Optimizing Distributed Tensor Contractions using Node-Aware Processor Grids2307.08829v1 · Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann et al.2023 · 2 citationsarXiv
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network2307.05740v2 · Raghavendra Kanakagiri, Edgar Solomonik2023 · 11 citationsarXiv
Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs2307.03307v3 · Caleb Ju, Serif Yesil, Mengyuan Sun et al.2023 · 0 citationsarXiv
Application Performance Modeling via Tensor Completion2210.10184v3 · Edward Hutter, Edgar Solomonik2022 · 4 citationsarXiv
Tensor Rank and Other Multipartite Entanglement Measures of Graph States2209.06320v2 · Louis Schatzki, Linjian Ma, Edgar Solomonik et al.2022 · 2 citationsarXiv
Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputs2205.13163v1 · Linjian Ma, Edgar Solomonik2022 · 4 citationsarXiv
Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition2204.07208v2 · Navjot Singh, Edgar Solomonik2022 · 0 citationsarXiv
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting2204.04599v6 · Wentao Yang, Vipul Harsh, Edgar Solomonik2022 · 0 citationsarXiv
ATD: Augmenting CP Tensor Decomposition by Self Supervision.37994346 · Yang, Chaoqi, Qian, Cheng, Singh, Navjot et al.2023 · 6 citationsAdvances in neural information processing systems. 2022;35:32039-32052
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels2110.04865v2 · Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik2021 · 2 citationsarXiv
Communication lower bounds for nested bilinear algorithms via rank expansion of Kronecker products2107.09834v4 · Caleb Ju, Yifan Zhang, Edgar Solomonik2021 · 0 citationsarXiv
ATD: Augmenting CP Tensor Decomposition by Self Supervision2106.07900v4 · Chaoqi Yang, Cheng Qian, Navjot Singh et al.2021 · 6 citationsarXiv
MTC: Multiresolution Tensor Completion from Partial and Coarse Observations2106.07135v2 · Chaoqi Yang, Navjot Singh, Cao Xiao et al.2021 · 3 citationsarXiv
Efficient Preconditioners for Interior Point Methods via a new Schur Complement-Based Strategy2104.12916v3 · Samah Karim, Edgar Solomonik2021 · 3 citationsarXiv
Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions2104.01101v2 · Linjian Ma, Edgar Solomonik2021 · 12 citationsarXiv
Accelerating Distributed-Memory Autotuning via Statistical Analysis of Execution Paths2103.01304v1 · Edward Hutter, Edgar Solomonik2021 · 1 citationarXiv
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations2010.16012v1 · Maciej Besta, Michal Podstawski, Linus Groner et al.2020 · 10 citationsProceedings of the 26th ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC'17), 2017
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree2010.12056v1 · Linjian Ma, Edgar Solomonik2020 · 7 citationsarXiv
SlimSell: A Vectorizable Graph Representation for Breadth-First Search2010.09913v2 · Maciej Besta, Florian Marending, Edgar Solomonik et al.2020 · 57 citationsProceedings of the 31st IEEE International Parallel and Distributed Processing Symposium (IPDPS'17), 2017
Automatic transformation of irreducible representations for efficient contraction of tensors with cyclic group symmetry2007.08056v4 · Yang Gao, Phillip Helms, Garnet Kin-Lic Chan et al.2020 · 2 citationsarXiv
Distributed-Memory DMRG via Sparse and Dense Parallel Tensor Contractions2007.05540v1 · Ryan Levy, Edgar Solomonik, Bryan K. Clark2020 · 18 citationsSC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC), (2020) 319-332
Efficient 2D Tensor Network Simulation of Quantum Systems2006.15234v2 · Yuchen Pang, Tianyi Hao, Annika Dugad et al.2020 · 18 citationsarXiv
AutoHOOT: Automatic High-Order Optimization for Tensors2005.04540v2 · Linjian Ma, Jiayu Ye, Edgar Solomonik2020 · 1 citationarXiv
On Stability of Tensor Networks and Canonical Forms2001.01191v1 · Yifan Zhang, Edgar Solomonik2020 · 5 citationsarXiv
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons1911.04200v3 · Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa et al.2019 · 85 citationsProceedings of the 34st IEEE International Parallel and Distributed Processing Symposium (IPDPS'20), 2020
Derivation and Analysis of Fast Bilinear Algorithms for Convolution1910.13367v2 · Caleb Ju, Edgar Solomonik2019 · 12 citationsarXiv
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CP Decomposition1910.12331v2 · Navjot Singh, Linjian Ma, Hongru Yang et al.2019 · 5 citationsarXiv
Distributed-Memory Tensor Completion for Generalized Loss Functions in Python using New Sparse Tensor Kernels1910.02371v3 · Navjot Singh, Zecheng Zhang, Xiaoxiao Wu et al.2019 · 12 citationsarXiv
Accelerating Alternating Least Squares for Tensor Decomposition by Pairwise Perturbation1811.10573v6 · Linjian Ma, Edgar Solomonik2018 · 16 citationsarXiv
Histogram Sort with Sampling1803.01237v2 · Vipul Harsh, Laxmikant Kale, Edgar Solomonik2018 · 12 citationsarXiv
Communication-avoiding Cholesky-QR2 for rectangular matrices1710.08471v6 · Edward Hutter, Edgar Solomonik2017 · 11 citationsarXiv
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral1710.05867v4 · Edwin Pednault, John A. Gunnels, Giacomo Nannicini et al.2017 · 48 citationsarXiv
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions1707.04618v2 · Edgar Solomonik, James Demmel, Torsten Hoefler2017 · 5 citationsarXiv
Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations1612.01855v2 · Tobias Wicky, Edgar Solomonik, Torsten Hoefler2016 · 11 citationsarXiv
Scaling betweenness centrality using communication-efficient sparse matrix multiplication1609.07008v2 · Edgar Solomonik, Maciej Besta, Flavio Vella et al.2016 · 81 citationsarXiv
A communication-avoiding parallel algorithm for the symmetric eigenvalue problem1604.03703v1 · Edgar Solomonik, Grey Ballard, James Demmel et al.2016 · 14 citationsarXiv
Sparse Tensor Algebra as a Parallel Programming Model1512.00066v1 · Edgar Solomonik, Torsten Hoefler2015 · 34 citationsarXiv
Career total: 182 works. 44 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.