Fetching the paper…
Reading the bibliography…
The movement of data (communication) between levels of a memory hierarchy, or between parallel processors on a network, can greatly dominate the cost of computation, so algorithms that minimize communication are of interest.
An inequality related to the isoperimetric inequality
L.H. Loomis and H. Whitney · 1949
Earlier work this paper cites.
A decision method for elementary algebra and geometry
A. Tarski · 1951
Earlier work this paper cites.
Measure Theory
P.R. Halmos · 1974
Earlier work this paper cites.
Quantifier elimination for real closed fields by cylindrical algebraic decomposition
G.E. Collins · 1975
Earlier work this paper cites.
I/O complexity: the red-blue pebble game
J.-W. Hong and H.T. Kung · 1981
Earlier work this paper cites.
Interpolation of Operators
C. Bennett and R.C. Sharpley · 1988
Earlier work this paper cites.
Communication complexity of PRAMs
A. Aggarwal, A.K. Chandra, and M. Snir · 1990
Earlier work this paper cites.
Hilbert’s Tenth Problem
Y. Matiyasevich · 1993
Earlier work this paper cites.
The bulk-synchronous parallel random access machine
A. Tiskin · 1998
Cited alongside, same era.
Memory-efficient matrix multiplication in the BSP model
W.F. McColl and A. Tiskin · 1999
Cited alongside, same era.
Communication lower bounds for distributed-memory matrix multiplication
D. Irony, S. Toledo, and A. Tiskin · 2004
Cited alongside, same era.
Getting up to Speed: the Future of Supercomputing
S.L. Graham, M. Snir, and C.A. Patterson, editors · 2005
Cited alongside, same era.
Murphy’s law in algebraic geometry: badly-behaved deformation spaces
R. Vakil · 2006
Cited alongside, same era.
Communication-efficient parallel generic pairwise elimination
A. Tiskin · 2007
Cited alongside, same era.
S.I. Valdimarsson · 2010
Later among the works it cites.
Communication bounds for heterogeneous architectures
G. Ballard, J. Demmel, and A. Gearhart · 2011
Later among the works it cites.
Minimizing communication in numerical linear algebra
G. Ballard, J. Demmel, O. Holtz, and O. Schwartz · 2011
Later among the works it cites.
The Future of Computing Performance: Game Over or Next Level?
S.H. Fuller and L.I. Millett, editors · 2011
Later among the works it cites.
Improving communication performance in dense linear algebra via topology aware collectives
E. Solomonik, A. Bhatele, and J. Demmel · 2011
Later among the works it cites.
Communication-optimal parallel 2.5D matrix multiplication and
E. Solomonik and J. Demmel · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Finite bounds for Hölder-Brascamp-Lieb multilinear inequalities
J. Bennett, A. Carbery, M. Christ, and T. Tao · 2010
Cited alongside, same era.
Defining
J. Koenigsmann · 2010
Cited alongside, same era.
Later among the works it cites.
Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds
G. Ballard, J. Demmel, O. Holtz, B. Lipshitz, and O. Schwartz · 2012
Later among the works it cites.
A communication-optimal
M. Driscoll, E. Georganas, P. Koanantakool, E. Solomonik, and K. Yelick · 2012
Later among the works it cites.