default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdgar Solomonik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2014
[b1]Edgar Solomonik:
Provably Efficient Algorithms for Numerical Tensor Algebra. University of California, Berkeley, USA, 2014
Journal Articles
- 2023
- [j10]Navjot Singh, Edgar Solomonik
:
Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition. SIAM J. Sci. Comput. 45(6): 2781-2812 (2023) - 2022
- [j9]Navjot Singh, Zecheng Zhang, Xiaoxiao Wu, Naijing Zhang, Siyuan Zhang, Edgar Solomonik:
Distributed-memory tensor completion for generalized loss functions in python using new sparse tensor kernels. J. Parallel Distributed Comput. 169: 269-285 (2022) - [j8]Linjian Ma, Edgar Solomonik:
Accelerating alternating least squares for tensor decomposition by pairwise perturbation. Numer. Linear Algebra Appl. 29(4) (2022) - [j7]Samah Karim, Edgar Solomonik:
Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy. SIAM J. Matrix Anal. Appl. 43(4): 1680-1711 (2022) - 2021
- [j6]Edgar Solomonik, James Demmel:
Fast Bilinear Algorithms for Symmetric Tensor Contractions. Comput. Methods Appl. Math. 21(1): 211-231 (2021) - [j5]Navjot Singh, Linjian Ma, Hongru Yang, Edgar Solomonik:
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition. SIAM J. Sci. Comput. 43(4): C290-C311 (2021) - [j4]Edgar Solomonik, James Demmel, Torsten Hoefler:
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions. SIAM J. Sci. Comput. 43(5): A3328-A3356 (2021) - 2020
- [j3]Caleb Ju, Edgar Solomonik:
Derivation and Analysis of Fast Bilinear Algorithms for Convolution. SIAM Rev. 62(4): 743-777 (2020) - 2014
- [j2]Edgar Solomonik, Devin Matthews, Jeff R. Hammond, John F. Stanton, James Demmel:
A massively parallel tensor contraction framework for coupled-cluster computations. J. Parallel Distributed Comput. 74(12): 3176-3190 (2014) - 2010
- [j1]Abhinav Bhatele, Lukasz Wesolowski, Eric J. Bohm, Edgar Solomonik, Laxmikant V. Kalé:
Understanding Application Performance via Micro-benchmarks on Three Large Supercomputers: Intrepid, Ranger and Jaguar. Int. J. High Perform. Comput. Appl. 24(4): 411-427 (2010)
Conference and Workshop Papers
- 2024
- [c35]Raghavendra Kanakagiri, Edgar Solomonik:
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. SPAA 2024: 169-181 - 2023
- [c34]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:
Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling. ASPLOS (3) 2023: 18-32 - [c33]Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann, Edgar Solomonik, Andreas Grüneis:
Optimizing Distributed Tensor Contractions Using Node-Aware Processor Grids. Euro-Par 2023: 710-724 - [c32]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:
Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling (Extended Abstract). HOPC@SPAA 2023: 15-16 - [c31]Edward Hutter, Edgar Solomonik:
Application Performance Modeling via Tensor Completion. SC 2023: 65:1-65:14 - [c30]Wentao Yang, Vipul Harsh, Edgar Solomonik:
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting. SPAA 2023: 467-478 - 2022
- [c29]Linjian Ma, Edgar Solomonik:
Cost-efficient Gaussian tensor network embeddings for tensor-structured inputs. NeurIPS 2022 - [c28]Chaoqi Yang, Cheng Qian, Navjot Singh, Cao (Danica) Xiao, M. Brandon Westover, Edgar Solomonik, Jimeng Sun:
ATD: Augmenting CP Tensor Decomposition by Self Supervision. NeurIPS 2022 - [c27]Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik:
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels. PP 2022: 72-83 - 2021
- [c26]Edward Hutter, Edgar Solomonik:
Accelerating Distributed-Memory Autotuning via Statistical Analysis of Execution Paths. IPDPS 2021: 46-57 - [c25]Linjian Ma, Edgar Solomonik:
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree. IPDPS 2021: 412-421 - [c24]Chaoqi Yang, Navjot Singh, Cao Xiao, Cheng Qian, Edgar Solomonik, Jimeng Sun:
MTC: Multiresolution Tensor Completion from Partial and Coarse Observations. KDD 2021: 1953-1963 - [c23]Linjian Ma, Edgar Solomonik:
Fast and accurate randomized algorithms for low-rank tensor decompositions. NeurIPS 2021: 24299-24312 - 2020
- [c22]Linjian Ma, Jiayu Ye, Edgar Solomonik:
AutoHOOT: Automatic High-Order Optimization for Tensors. PACT 2020: 125-137 - [c21]Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik:
Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons. IPDPS 2020: 1122-1132 - [c20]Yuchen Pang, Tianyi Hao, Annika Dugad, Yiqing Zhou, Edgar Solomonik:
Efficient 2D tensor network simulation of quantum systems. SC 2020: 14 - [c19]Ryan Levy, Edgar Solomonik, Bryan K. Clark:
Distributed-memory DMRG via sparse and dense parallel tensor contractions. SC 2020: 24 - 2019
- [c18]Edward Hutter, Edgar Solomonik:
Communication-Avoiding Cholesky-QR2 for Rectangular Matrices. IPDPS 2019: 89-100 - [c17]Kartik Hegde, Hadi Asghari Moghaddam, Michael Pellauer, Neal Clayton Crago, Aamer Jaleel, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher:
ExTensor: An Accelerator for Sparse Tensor Algebra. MICRO 2019: 319-333 - [c16]Vipul Harsh, Laxmikant V. Kalé, Edgar Solomonik:
Histogram Sort with Sampling. SPAA 2019: 201-212 - 2017
- [c15]Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, Torsten Hoefler:
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations. HPDC 2017: 93-104 - [c14]Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler:
SlimSell: A Vectorizable Graph Representation for Breadth-First Search. IPDPS 2017: 32-41 - [c13]Tobias Wicky, Edgar Solomonik, Torsten Hoefler:
Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations. IPDPS 2017: 678-687 - [c12]Edgar Solomonik, Maciej Besta, Flavio Vella, Torsten Hoefler:
Scaling betweenness centrality using communication-efficient sparse matrix multiplication. SC 2017: 47 - [c11]Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler:
A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem. SPAA 2017: 111-121 - 2014
- [c10]Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Hong Diep Nguyen, Edgar Solomonik:
Reconstructing Householder Vectors from Tall-Skinny QR. IPDPS 2014: 1159-1170 - [c9]Edgar Solomonik, Erin C. Carson, Nicholas Knight, James Demmel:
Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations. SPAA 2014: 307-318 - 2013
- [c8]Edgar Solomonik, Aydin Buluç, James Demmel:
Minimizing Communication in All-Pairs Shortest Paths. IPDPS 2013: 548-559 - [c7]Edgar Solomonik, Devin Matthews, Jeff R. Hammond, James Demmel:
Cyclops Tensor Framework: Reducing Communication and Eliminating Load Imbalance in Massively Parallel Contractions. IPDPS 2013: 813-824 - [c6]Michael B. Driscoll, Evangelos Georganas, Penporn Koanantakool, Edgar Solomonik, Katherine A. Yelick:
A Communication-Optimal N-Body Algorithm for Direct Interactions. IPDPS 2013: 1075-1084 - 2012
- [c5]Evangelos Georganas, Jorge González-Domínguez, Edgar Solomonik, Yili Zheng, Juan Touriño, Katherine A. Yelick:
Communication avoiding and overlapping for numerical linear algebra. SC 2012: 100 - [c4]Edgar Solomonik, James Demmel:
Matrix Multiplication on Multidimensional Torus Networks. VECPAR 2012: 201-215 - 2011
- [c3]Edgar Solomonik, James Demmel:
Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms. Euro-Par (2) 2011: 90-109 - [c2]Edgar Solomonik, Abhinav Bhatele, James Demmel:
Improving communication performance in dense linear algebra via topology aware collectives. SC 2011: 77:1-77:11 - 2010
- [c1]Edgar Solomonik, Laxmikant V. Kalé:
Highly scalable parallel sorting. IPDPS 2010: 1-12
Editorship
- 2017
- [e1]Martin Elsman, Clemens Grelck, Andreas Klöckner, David A. Padua, Edgar Solomonik:
Proceedings of the 4th ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming, ARRAY@PLDI 2017, Barcelona, Spain, June 18, 2017. ACM 2017, ISBN 978-1-4503-5069-3 [contents]
Reference Works
- 2011
- [r1]Laxmikant V. Kalé, Edgar Solomonik:
Sorting. Encyclopedia of Parallel Computing 2011: 1855-1862
Informal and Other Publications
- 2024
- [i35]Linjian Ma, Matthew Fishman, Edwin Miles Stoudenmire, Edgar Solomonik:
Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm. CoRR abs/2406.09769 (2024) - 2023
- [i34]Caleb Ju, Serif Yesil, Mengyuan Sun, Chandra Chekuri, Edgar Solomonik:
Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs. CoRR abs/2307.03307 (2023) - [i33]Raghavendra Kanakagiri, Edgar Solomonik:
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. CoRR abs/2307.05740 (2023) - [i32]Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann, Edgar Solomonik, Andreas Grüneis:
Optimizing Distributed Tensor Contractions using Node-Aware Processor Grids. CoRR abs/2307.08829 (2023) - [i31]Ping-Hsuan Tsai, Paul Fischer, Edgar Solomonik:
Accelerating the Galerkin Reduced-Order Model with the Tensor Decomposition for Turbulent Flows. CoRR abs/2311.03694 (2023) - 2022
- [i30]Wentao Yang, Vipul Harsh, Edgar Solomonik:
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting. CoRR abs/2204.04599 (2022) - [i29]Navjot Singh, Edgar Solomonik:
Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition. CoRR abs/2204.07208 (2022) - [i28]Linjian Ma, Edgar Solomonik:
Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputs. CoRR abs/2205.13163 (2022) - [i27]Edward Hutter, Edgar Solomonik:
High-Dimensional Performance Modeling via Tensor Completion. CoRR abs/2210.10184 (2022) - 2021
- [i26]Edward Hutter, Edgar Solomonik:
Accelerating Distributed-Memory Autotuning via Statistical Analysis of Execution Paths. CoRR abs/2103.01304 (2021) - [i25]Linjian Ma, Edgar Solomonik:
Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions. CoRR abs/2104.01101 (2021) - [i24]Samah Karim, Edgar Solomonik:
Efficient Preconditioners for Interior Point Methods via a new Schur Complementation Strategy. CoRR abs/2104.12916 (2021) - [i23]Chaoqi Yang, Navjot Singh, Cao Xiao, Cheng Qian, Edgar Solomonik, Jimeng Sun:
MTC: Multiresolution Tensor Completion from Partial and Coarse Observations. CoRR abs/2106.07135 (2021) - [i22]Chaoqi Yang, Cheng Qian, Navjot Singh, Cao Xiao, M. Brandon Westover, Edgar Solomonik, Jimeng Sun:
Augmented Tensor Decomposition with Stochastic Optimization. CoRR abs/2106.07900 (2021) - [i21]Caleb Ju, Yifan Zhang, Edgar Solomonik:
Communication Lower Bounds for Nested Bilinear Algorithms. CoRR abs/2107.09834 (2021) - [i20]Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik:
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels. CoRR abs/2110.04865 (2021) - 2020
- [i19]Yifan Zhang, Edgar Solomonik:
On Stability of Tensor Networks and Canonical Forms. CoRR abs/2001.01191 (2020) - [i18]Linjian Ma, Jiayu Ye, Edgar Solomonik:
AutoHOOT: Automatic High-Order Optimization for Tensors. CoRR abs/2005.04540 (2020) - [i17]Yuchen Pang, Tianyi Hao, Annika Dugad, Yiqing Zhou, Edgar Solomonik:
Efficient 2D Tensor Network Simulation of Quantum Systems. CoRR abs/2006.15234 (2020) - [i16]Ryan Levy, Edgar Solomonik, Bryan K. Clark:
Distributed-Memory DMRG via Sparse and Dense Parallel Tensor Contractions. CoRR abs/2007.05540 (2020) - [i15]Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler:
SlimSell: A Vectorizable Graph Representation for Breadth-First Search. CoRR abs/2010.09913 (2020) - [i14]Linjian Ma, Edgar Solomonik:
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree. CoRR abs/2010.12056 (2020) - [i13]Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, Torsten Hoefler:
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations. CoRR abs/2010.16012 (2020) - 2019
- [i12]Zecheng Zhang, Xiaoxiao Wu, Naijing Zhang, Siyuan Zhang, Edgar Solomonik:
Enabling Distributed-Memory Tensor Completion in Python using New Sparse Tensor Kernels. CoRR abs/1910.02371 (2019) - [i11]Navjot Singh, Linjian Ma, Hongru Yang, Edgar Solomonik:
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CP Decomposition. CoRR abs/1910.12331 (2019) - [i10]Caleb Ju, Edgar Solomonik:
Derivation and Analysis of Fast Bilinear Algorithms for Convolution. CoRR abs/1910.13367 (2019) - [i9]Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik:
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons. CoRR abs/1911.04200 (2019) - 2018
- [i8]Vipul Harsh, Laxmikant V. Kalé, Edgar Solomonik:
Histogram Sort with Sampling. CoRR abs/1803.01237 (2018) - [i7]Linjian Ma, Edgar Solomonik:
Accelerating Alternating Least Squares for Tensor Decomposition by Pairwise Perturbation. CoRR abs/1811.10573 (2018) - 2017
- [i6]Edgar Solomonik, James Demmel, Torsten Hoefler:
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions. CoRR abs/1707.04618 (2017) - [i5]Edward Hutter, Edgar Solomonik:
Communication-avoiding Cholesky-QR2 for rectangular matrices. CoRR abs/1710.08471 (2017) - 2016
- [i4]Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler:
A communication-avoiding parallel algorithm for the symmetric eigenvalue problem. CoRR abs/1604.03703 (2016) - [i3]Edgar Solomonik, Maciej Besta, Flavio Vella, Torsten Hoefler:
Betweenness Centrality is more Parallelizable than Dense Matrix Multiplication. CoRR abs/1609.07008 (2016) - [i2]Tobias Wicky, Edgar Solomonik, Torsten Hoefler:
Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations. CoRR abs/1612.01855 (2016) - 2015
- [i1]Edgar Solomonik, Torsten Hoefler:
Sparse Tensor Algebra as a Parallel Programming Model. CoRR abs/1512.00066 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
