Edgar Solomonik

88 papers A* 5A 18B 6Journal 50Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop. CoRR Noah Amsel, Yves Baumann, Paul Beckman, Peter Bürgisser, Chris Camaño, Tyler Chen, Edmond Chow, Anil Damle, Michal Derezinski, Mark Embree, Ethan N. Epperly, Robert D. Falgout, Mark Fornace, Anne Greenbaum, Chen Greif, Diana Halikias, Zhen Huang, Elias Jarlebring, Yiannis Koutis, Daniel Kressner, Rasmus Kyng, Jörg Liesen, Jackie Lok, Raphael A. Meyer, Yuji Nakatsukasa, Kate Pearce, Richard Peng, David Persson, Elizaveta Rebrova, Ryan Schneider, Rikhav Shah, Edgar Solomonik, Nikhil Srivastava, Alex Townsend, Robert J. Webber, Jess Williams
2025	J	`jnl`	Communication Lower Bounds for Nested Bilinear Algorithms via Rank Expansion of Kronecker Products. Found. Comput. Math. Caleb Ju, Yifan Zhang, Edgar Solomonik
2025	J	`jnl`	Efficient Tensor Completion Algorithms for Highly Oscillatory Operators. CoRR Navjot Singh, Edgar Solomonik, Xiaoye Sherry Li, Yang Liu
2025	J	`jnl`	Simulating Clifford Circuits with Gaussian Elimination. CoRR Yuchen Pang, Edgar Solomonik
2024	J	`jnl`	Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm. CoRR Linjian Ma, Matthew Fishman, Edwin Miles Stoudenmire, Edgar Solomonik
2024	J	`jnl`	Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm. Quantum Linjian Ma, Matthew Fishman, Edwin Miles Stoudenmire, Edgar Solomonik
2024	B	`conf`	Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. SPAA Raghavendra Kanakagiri, Edgar Solomonik
2023	—	`conf`	Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling (Extended Abstract). HOPC@SPAA Toluwanimi O. Odemuyiwa, Hadi Asghari Moghaddam, Michael Pellauer, Kartik Hegde, Po-An Tsai, Neal Clayton Crago, Aamer Jaleel, John D. Owens, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher
2023	—	`conf`	Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling. ASPLOS (3) Toluwanimi O. Odemuyiwa, Hadi Asghari Moghaddam, Michael Pellauer, Kartik Hegde, Po-An Tsai, Neal Clayton Crago, Aamer Jaleel, John D. Owens, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher
2023	J	`jnl`	Accelerating the Galerkin Reduced-Order Model with the Tensor Decomposition for Turbulent Flows. CoRR Ping-Hsuan Tsai, Paul Fischer, Edgar Solomonik
2023	J	`jnl`	Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition. SIAM J. Sci. Comput. Navjot Singh, Edgar Solomonik
2023	A	`conf`	Application Performance Modeling via Tensor Completion. SC Edward Hutter, Edgar Solomonik
2023	J	`jnl`	Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs. CoRR Caleb Ju, Serif Yesil, Mengyuan Sun, Chandra Chekuri, Edgar Solomonik
2023	J	`jnl`	Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. CoRR Raghavendra Kanakagiri, Edgar Solomonik
2023	B	`conf`	Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting. SPAA Wentao Yang, Vipul Harsh, Edgar Solomonik
2023	—	`conf`	Optimizing Distributed Tensor Contractions Using Node-Aware Processor Grids. Euro-Par Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann, Edgar Solomonik, Andreas Grüneis
2023	J	`jnl`	Optimizing Distributed Tensor Contractions using Node-Aware Processor Grids. CoRR Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann, Edgar Solomonik, Andreas Grüneis
2022	A*	`conf`	ATD: Augmenting CP Tensor Decomposition by Self Supervision. NeurIPS Chaoqi Yang, Cheng Qian, Navjot Singh, Cao (Danica) Xiao, M. Brandon Westover, Edgar Solomonik, Jimeng Sun
2022	J	`jnl`	Accelerating alternating least squares for tensor decomposition by pairwise perturbation. Numer. Linear Algebra Appl. Linjian Ma, Edgar Solomonik
2022	J	`jnl`	Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition. CoRR Navjot Singh, Edgar Solomonik
2022	J	`jnl`	Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputs. CoRR Linjian Ma, Edgar Solomonik
2022	A*	`conf`	Cost-efficient Gaussian tensor network embeddings for tensor-structured inputs. NeurIPS Linjian Ma, Edgar Solomonik
2022	J	`jnl`	Distributed-memory tensor completion for generalized loss functions in python using new sparse tensor kernels. J. Parallel Distributed Comput. Navjot Singh, Zecheng Zhang, Xiaoxiao Wu, Naijing Zhang, Siyuan Zhang, Edgar Solomonik
2022	J	`jnl`	Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy. SIAM J. Matrix Anal. Appl. Samah Karim, Edgar Solomonik
2022	J	`jnl`	High-Dimensional Performance Modeling via Tensor Completion. CoRR Edward Hutter, Edgar Solomonik
2022	J	`jnl`	Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting. CoRR Wentao Yang, Vipul Harsh, Edgar Solomonik
2022	—	`conf`	Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels. PP Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik
2021	A	`conf`	Accelerating Distributed-Memory Autotuning via Statistical Analysis of Execution Paths. IPDPS Edward Hutter, Edgar Solomonik
2021	J	`jnl`	Accelerating Distributed-Memory Autotuning via Statistical Analysis of Execution Paths. CoRR Edward Hutter, Edgar Solomonik
2021	J	`jnl`	Augmented Tensor Decomposition with Stochastic Optimization. CoRR Chaoqi Yang, Cheng Qian, Navjot Singh, Cao Xiao, M. Brandon Westover, Edgar Solomonik, Jimeng Sun
2021	J	`jnl`	Communication Lower Bounds for Nested Bilinear Algorithms. CoRR Caleb Ju, Yifan Zhang, Edgar Solomonik
2021	J	`jnl`	Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions. SIAM J. Sci. Comput. Edgar Solomonik, James Demmel, Torsten Hoefler
2021	J	`jnl`	Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition. SIAM J. Sci. Comput. Navjot Singh, Linjian Ma, Hongru Yang, Edgar Solomonik
2021	J	`jnl`	Efficient Preconditioners for Interior Point Methods via a new Schur Complementation Strategy. CoRR Samah Karim, Edgar Solomonik
2021	A	`conf`	Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree. IPDPS Linjian Ma, Edgar Solomonik
2021	J	`jnl`	Fast Bilinear Algorithms for Symmetric Tensor Contractions. Comput. Methods Appl. Math. Edgar Solomonik, James Demmel
2021	J	`jnl`	Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions. CoRR Linjian Ma, Edgar Solomonik
2021	A*	`conf`	Fast and accurate randomized algorithms for low-rank tensor decompositions. NeurIPS Linjian Ma, Edgar Solomonik
2021	A*	`conf`	MTC: Multiresolution Tensor Completion from Partial and Coarse Observations. KDD Chaoqi Yang, Navjot Singh, Cao Xiao, Cheng Qian, Edgar Solomonik, Jimeng Sun
2021	J	`jnl`	MTC: Multiresolution Tensor Completion from Partial and Coarse Observations. CoRR Chaoqi Yang, Navjot Singh, Cao Xiao, Cheng Qian, Edgar Solomonik, Jimeng Sun
2021	J	`jnl`	Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels. CoRR Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik
2020	B	`conf`	AutoHOOT: Automatic High-Order Optimization for Tensors. PACT Linjian Ma, Jiayu Ye, Edgar Solomonik
2020	J	`jnl`	AutoHOOT: Automatic High-Order Optimization for Tensors. CoRR Linjian Ma, Jiayu Ye, Edgar Solomonik
2020	A	`conf`	Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons. IPDPS Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik
2020	J	`jnl`	Derivation and Analysis of Fast Bilinear Algorithms for Convolution. SIAM Rev. Caleb Ju, Edgar Solomonik
2020	J	`jnl`	Distributed-Memory DMRG via Sparse and Dense Parallel Tensor Contractions. CoRR Ryan Levy, Edgar Solomonik, Bryan K. Clark
2020	A	`conf`	Distributed-memory DMRG via sparse and dense parallel tensor contractions. SC Ryan Levy, Edgar Solomonik, Bryan K. Clark
2020	J	`jnl`	Efficient 2D Tensor Network Simulation of Quantum Systems. CoRR Yuchen Pang, Tianyi Hao, Annika Dugad, Yiqing Zhou, Edgar Solomonik
2020	A	`conf`	Efficient 2D tensor network simulation of quantum systems. SC Yuchen Pang, Tianyi Hao, Annika Dugad, Yiqing Zhou, Edgar Solomonik
2020	J	`jnl`	Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree. CoRR Linjian Ma, Edgar Solomonik
2020	J	`jnl`	On Stability of Tensor Networks and Canonical Forms. CoRR Yifan Zhang, Edgar Solomonik
2020	J	`jnl`	SlimSell: A Vectorizable Graph Representation for Breadth-First Search. CoRR Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler
2020	J	`jnl`	To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations. CoRR Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, Torsten Hoefler
2019	A	`conf`	Communication-Avoiding Cholesky-QR2 for Rectangular Matrices. IPDPS Edward Hutter, Edgar Solomonik
2019	J	`jnl`	Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons. CoRR Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik
2019	J	`jnl`	Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CP Decomposition. CoRR Navjot Singh, Linjian Ma, Hongru Yang, Edgar Solomonik
2019	J	`jnl`	Derivation and Analysis of Fast Bilinear Algorithms for Convolution. CoRR Caleb Ju, Edgar Solomonik
2019	J	`jnl`	Enabling Distributed-Memory Tensor Completion in Python using New Sparse Tensor Kernels. CoRR Zecheng Zhang, Xiaoxiao Wu, Naijing Zhang, Siyuan Zhang, Edgar Solomonik
2019	A*	`conf`	ExTensor: An Accelerator for Sparse Tensor Algebra. MICRO Kartik Hegde, Hadi Asghari Moghaddam, Michael Pellauer, Neal Clayton Crago, Aamer Jaleel, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher
2019	B	`conf`	Histogram Sort with Sampling. SPAA Vipul Harsh, Laxmikant V. Kalé, Edgar Solomonik
2018	J	`jnl`	Accelerating Alternating Least Squares for Tensor Decomposition by Pairwise Perturbation. CoRR Linjian Ma, Edgar Solomonik
2018	J	`jnl`	Histogram Sort with Sampling. CoRR Vipul Harsh, Laxmikant V. Kalé, Edgar Solomonik
2017	B	`conf`	A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem. SPAA Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler
2017	J	`jnl`	Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions. CoRR Edgar Solomonik, James Demmel, Torsten Hoefler
2017	A	`conf`	Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations. IPDPS Tobias Wicky, Edgar Solomonik, Torsten Hoefler
2017	J	`jnl`	Communication-avoiding Cholesky-QR2 for rectangular matrices. CoRR Edward Hutter, Edgar Solomonik
2017	—	`ed.`	Proceedings of the 4th ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming, ARRAY@PLDI 2017, Barcelona, Spain, June 18, 2017 ARRAY@PLDI Martin Elsman, Clemens Grelck, Andreas Klöckner, David A. Padua, Edgar Solomonik
2017	A	`conf`	Scaling betweenness centrality using communication-efficient sparse matrix multiplication. SC Edgar Solomonik, Maciej Besta, Flavio Vella, Torsten Hoefler
2017	A	`conf`	SlimSell: A Vectorizable Graph Representation for Breadth-First Search. IPDPS Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler
2017	A	`conf`	To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations. HPDC Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, Torsten Hoefler
2016	J	`jnl`	A communication-avoiding parallel algorithm for the symmetric eigenvalue problem. CoRR Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler
2016	J	`jnl`	Betweenness Centrality is more Parallelizable than Dense Matrix Multiplication. CoRR Edgar Solomonik, Maciej Besta, Flavio Vella, Torsten Hoefler
2016	J	`jnl`	Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations. CoRR Tobias Wicky, Edgar Solomonik, Torsten Hoefler
2015	J	`jnl`	Sparse Tensor Algebra as a Parallel Programming Model. CoRR Edgar Solomonik, Torsten Hoefler
2014	J	`jnl`	A massively parallel tensor contraction framework for coupled-cluster computations. J. Parallel Distributed Comput. Edgar Solomonik, Devin Matthews, Jeff R. Hammond, John F. Stanton, James Demmel
2014	—	`—`	Provably Efficient Algorithms for Numerical Tensor Algebra. Edgar Solomonik
2014	A	`conf`	Reconstructing Householder Vectors from Tall-Skinny QR. IPDPS Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Hong Diep Nguyen, Edgar Solomonik
2014	B	`conf`	Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations. SPAA Edgar Solomonik, Erin Carson, Nicholas Knight, James Demmel
2013	A	`conf`	A Communication-Optimal N-Body Algorithm for Direct Interactions. IPDPS Michael B. Driscoll, Evangelos Georganas, Penporn Koanantakool, Edgar Solomonik, Katherine A. Yelick
2013	A	`conf`	Cyclops Tensor Framework: Reducing Communication and Eliminating Load Imbalance in Massively Parallel Contractions. IPDPS Edgar Solomonik, Devin Matthews, Jeff R. Hammond, James Demmel
2013	A	`conf`	Minimizing Communication in All-Pairs Shortest Paths. IPDPS Edgar Solomonik, Aydin Buluç, James Demmel
2012	A	`conf`	Communication avoiding and overlapping for numerical linear algebra. SC Evangelos Georganas, Jorge González-Domínguez, Edgar Solomonik, Yili Zheng, Juan Touriño, Katherine A. Yelick
2012	—	`conf`	Matrix Multiplication on Multidimensional Torus Networks. VECPAR Edgar Solomonik, James Demmel
2011	—	`conf`	Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms. Euro-Par (2) Edgar Solomonik, James Demmel
2011	A	`conf`	Improving communication performance in dense linear algebra via topology aware collectives. SC Edgar Solomonik, Abhinav Bhatele, James Demmel
2011	—	`ch.`	Sorting. Encyclopedia of Parallel Computing Laxmikant V. Kalé, Edgar Solomonik
2010	A	`conf`	Highly scalable parallel sorting. IPDPS Edgar Solomonik, Laxmikant V. Kalé
2010	J	`jnl`	Understanding Application Performance via Micro-benchmarks on Three Large Supercomputers: Intrepid, Ranger and Jaguar. Int. J. High Perform. Comput. Appl. Abhinav Bhatele, Lukasz Wesolowski, Eric J. Bohm, Edgar Solomonik, Laxmikant V. Kalé