Edgar Solomonik

Orcid: 0000-0002-6480-9066

According to our database1, Edgar Solomonik authored at least 60 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm.
CoRR, 2024

Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023
Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition.
SIAM J. Sci. Comput., December, 2023

Accelerating the Galerkin Reduced-Order Model with the Tensor Decomposition for Turbulent Flows.
CoRR, 2023

Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs.
CoRR, 2023

Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Application Performance Modeling via Tensor Completion.
Proceedings of the International Conference for High Performance Computing, 2023

Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling (Extended Abstract).
Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

Optimizing Distributed Tensor Contractions Using Node-Aware Processor Grids.
Proceedings of the Euro-Par 2023: Parallel Processing - 29th International Conference on Parallel and Distributed Computing, Limassol, Cyprus, August 28, 2023

Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling.
Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2023

2022
Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy.
SIAM J. Matrix Anal. Appl., 2022

Accelerating alternating least squares for tensor decomposition by pairwise perturbation.
Numer. Linear Algebra Appl., 2022

Distributed-memory tensor completion for generalized loss functions in python using new sparse tensor kernels.
J. Parallel Distributed Comput., 2022

High-Dimensional Performance Modeling via Tensor Completion.
CoRR, 2022

Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition.
CoRR, 2022

Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels.
Proceedings of the 2022 SIAM Conference on Parallel Processing for Scientific Computing, 2022

ATD: Augmenting CP Tensor Decomposition by Self Supervision.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Cost-efficient Gaussian tensor network embeddings for tensor-structured inputs.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions.
SIAM J. Sci. Comput., 2021

Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition.
SIAM J. Sci. Comput., 2021

Communication Lower Bounds for Nested Bilinear Algorithms.
CoRR, 2021

Augmented Tensor Decomposition with Stochastic Optimization.
CoRR, 2021

Efficient Preconditioners for Interior Point Methods via a new Schur Complementation Strategy.
CoRR, 2021

Fast Bilinear Algorithms for Symmetric Tensor Contractions.
Comput. Methods Appl. Math., 2021

Fast and accurate randomized algorithms for low-rank tensor decompositions.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

MTC: Multiresolution Tensor Completion from Partial and Coarse Observations.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree.
Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

Accelerating Distributed-Memory Autotuning via Statistical Analysis of Execution Paths.
Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

2020
Derivation and Analysis of Fast Bilinear Algorithms for Convolution.
SIAM Rev., 2020

On Stability of Tensor Networks and Canonical Forms.
CoRR, 2020

Efficient 2D tensor network simulation of quantum systems.
Proceedings of the International Conference for High Performance Computing, 2020

Distributed-memory DMRG via sparse and dense parallel tensor contractions.
Proceedings of the International Conference for High Performance Computing, 2020

Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

AutoHOOT: Automatic High-Order Optimization for Tensors.
Proceedings of the PACT '20: International Conference on Parallel Architectures and Compilation Techniques, 2020

2019
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CP Decomposition.
CoRR, 2019

Enabling Distributed-Memory Tensor Completion in Python using New Sparse Tensor Kernels.
CoRR, 2019

Histogram Sort with Sampling.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

ExTensor: An Accelerator for Sparse Tensor Algebra.
Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture, 2019

Communication-Avoiding Cholesky-QR2 for Rectangular Matrices.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

2017
A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Scaling betweenness centrality using communication-efficient sparse matrix multiplication.
Proceedings of the International Conference for High Performance Computing, 2017

Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

SlimSell: A Vectorizable Graph Representation for Breadth-First Search.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations.
Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing, 2017

2016
Betweenness Centrality is more Parallelizable than Dense Matrix Multiplication.
CoRR, 2016

2015
Sparse Tensor Algebra as a Parallel Programming Model.
CoRR, 2015

2014
Provably Efficient Algorithms for Numerical Tensor Algebra.
PhD thesis, 2014

A massively parallel tensor contraction framework for coupled-cluster computations.
J. Parallel Distributed Comput., 2014

Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Reconstructing Householder Vectors from Tall-Skinny QR.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

2013
Cyclops Tensor Framework: Reducing Communication and Eliminating Load Imbalance in Massively Parallel Contractions.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Minimizing Communication in All-Pairs Shortest Paths.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

A Communication-Optimal N-Body Algorithm for Direct Interactions.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

2012
Matrix Multiplication on Multidimensional Torus Networks.
Proceedings of the High Performance Computing for Computational Science, 2012

Communication avoiding and overlapping for numerical linear algebra.
Proceedings of the SC Conference on High Performance Computing Networking, 2012

2011
Sorting.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Improving communication performance in dense linear algebra via topology aware collectives.
Proceedings of the Conference on High Performance Computing Networking, 2011

Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010
Understanding Application Performance via Micro-benchmarks on Three Large Supercomputers: Intrepid, Ranger and Jaguar.
Int. J. High Perform. Comput. Appl., 2010

Highly scalable parallel sorting.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010


  Loading...