Fetching the paper…
Reading the bibliography…
Dense and sparse tensors allow the representation of most bulk data structures in computational science applications.
Note on an approximation treatment for many-electron systems
C. Møller and M. S. Plesset · 1934
Earlier work this paper cites.
Shortest connection networks and some generalizations
R. Prim · 1957
Earlier work this paper cites.
On a Routing Problem
R. Bellman · 1958
Earlier work this paper cites.
Network flow and systems of representatives
L. Ford and D. Fulkerson · 1958
Earlier work this paper cites.
Algorithm 97: Shortest path
R. W. Floyd · 1962
Earlier work this paper cites.
A theorem on boolean matrices
S. Warshall · 1962
Earlier work this paper cites.
Many‐body perturbation theory applied to electron pair correlation energies. i. closed‐shell first‐row diatomic hydrides
R. J. Bartlett and D. M. Silver · 1975
Earlier work this paper cites.
Basic Linear Algebra Subprograms for Fortran usage
C. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh · 1979
Earlier work this paper cites.
Techniques for parallel manipulation of sparse matrices
C. P. Kruskal, L. Rudolph, and M. Snir · 1989
Earlier work this paper cites.
A bridging model for parallel computation
L. G. Valiant · 1990
Earlier work this paper cites.
LAPACK Users’ Guide
E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. D. Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen · 1992
Earlier work this paper cites.
Semirings for social networks analysis
V. Batagelj · 1994
Earlier work this paper cites.
A quantitative study of the scaling properties of the Hartree–Fock method
D. L. Strout and G. E. Scuseria · 1995
Earlier work this paper cites.
Global Arrays: A nonuniform memory access programming model for high-performance computers
J. Nieplocha, R. J. Harrison, and R. J. Littlefield · 1996
Earlier work this paper cites.
ScaLAPACK Users’ Guide
L. S. Blackford, J. Choi, A. Cleary, E. D’Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley · 1997
Earlier work this paper cites.
SUMMA: Scalable Universal Matrix Multiplication Algorithm
R. A. van de Geijn and J. Watts · 1997
Cited alongside, same era.
A faster algorithm for betweenness centrality
U. Brandes · 2001
Cited alongside, same era.
Low-order scaling local electron correlation methods. IV. linear scaling local coupled-cluster (LCCSD)
M. Schütz and H.-J. Werner · 2001
Cited alongside, same era.
All-pairs shortest paths computation in the BSP model
A. Tiskin · 2001
Cited alongside, same era.
Tensor Contraction Engine: Abstraction and automated parallel implementation of configuration-interaction, coupled-cluster, and many-body perturbation theories
S. Hirata · 2003
Cited alongside, same era.
Synthesis of high-performance parallel programs for a class of ab initio quantum chemistry models
Julia: A Fast Dynamic Language for Technical Computing
J. Bezanson, S. Karpinski, V. B. Shah, and A. Edelman · 2012
Later among the works it cites.
Communication optimal parallel multiplication of sparse random matrices
G. Ballard, A. Buluc, J. Demmel, L. Grigori, B. Lipshitz, O. Schwartz, and S. Toledo · 2013
Later among the works it cites.
Communication-optimal parallel recursive rectangular matrix multiplication
J. Demmel, D. Eliahu, A. Fox, S. Kamil, B. Lipshitz, O. Schwartz, and O. Spillinger · 2013
Later among the works it cites.
New implementation of high-level correlated methods using a general block tensor library for high-performance electronic structure calculations
E. Epifanovsky, M. Wormit, T. Kuś, A. Landau, D. Zuev, K. Khistyaev, P. Manohar, I. Kaliman, A. Dreuw, and A. I. Krylov · 2013
Later among the works it cites.
Sparse tensor framework for implementation of general local correlation methods
D. Kats and F. R. Manby · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Baumgartner, A. Auer, D. Bernholdt, A. Bibireata, V. Choppella, D. Cociorva, X. Gao, R. Harrison, S. Hirata, S. Krishnamoorthy, S. Krishnan, C. Lam, Q. Lu, M. Nooijen, R. Pitzer, J. Ramanujam, P. Sadayappan, and A. Sibiryakov · 2005
Cited alongside, same era.
The Parallel BGL: A generic library for distributed graph computations
D. Gregor and A. Lumsdaine · 2005
Cited alongside, same era.
Mapreduce: simplified data processing on large clusters
J. Dean and S. Ghemawat · 2008
Cited alongside, same era.
Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks
A. Buluç, J. T. Fineman, M. Frigo, J. R. Gilbert, and C. E. Leiserson · 2009
Cited alongside, same era.
Pregel: a system for large-scale graph processing
G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski · 2010
Cited alongside, same era.
A sparse framework for the derivation and implementation of fermion algebra
J. A. Parkhill and M. Head-Gordon · 2010
Cited alongside, same era.
The Combinatorial BLAS: Design, implementation, and applications
A. Buluç and J. R. Gilbert · 2011
Cited alongside, same era.
A framework for load balancing of tensor contraction expressions via dynamic task partitioning
P.-W. Lai, K. Stock, S. Rajbhandari, S. Krishnamoorthy, and P. Sadayappan · 2013
Later among the works it cites.
Elemental: A new framework for distributed memory dense matrix computations
J. Poulson, B. Marker, R. A. van de Geijn, J. R. Hammond, and N. A. Romero · 2013
Later among the works it cites.
Framework for distributed contractions of tensors with symmetry
S. Rajbhandari, A. Nikam, P.-W. Lai, K. Stock, S. Krishnamoorthy, and P. Sadayappan · 2013
Later among the works it cites.
Sparse matrix multiplication: The distributed block-compressed sparse row library
U. Borštnik, J. VandeVondele, V. Weber, and J. Hutter · 2014
Later among the works it cites.
A massively parallel tensor contraction framework for coupled-cluster computations
E. Solomonik, D. Matthews, J. R. Hammond, J. F. Stanton, and J. Demmel · 2014
Later among the works it cites.
Parallel scalability of Hartree–Fock calculations
E. Chow, X. Liu, M. Smelyanskiy, and J. R. Hammond · 2015
Closest in time.
Scalable Task-Based Algorithm for Multiplication of Block-Rank-Sparse Matrices
J. A. Calvin, C. A. Lewis, and E. F. Valeev · 2015
Closest in time.
https://www.nersc.gov/users/computational-systems/edison/configuration
NERSC description of Edison configuration · 2015
Closest in time.
Communication lower bounds for tensor contraction algorithms
E. Solomonik, J. Demmel, and T. Hoefler · 2015
Closest in time.