Fetching the paper…
Reading the bibliography…
Efficiently executing convolutional neural nets (CNNs) is important in many machine-learning tasks.
Lattice Theory
G. Birkhoff · 1963
Earlier work this paper cites.
Multiparametric linear programming
Tomas Gal and Josef Nedoma · 1972
Earlier work this paper cites.
I/O complexity: the red blue pebble game
X. Hong and H. T. Kung · 1981
Earlier work this paper cites.
Geometric algorithm for multiparametric linear programming
F. Borrelli, A. Bemporad, and M. Morari · 2003
Earlier work this paper cites.
Communication lower bounds for distributed-memory matrix multiplication
D. Irony, S. Toledo, and A. Tiskin · 2004
Earlier work this paper cites.
Getting Up to Speed: The Future of Supercomputing
Susan L. Graham, Marc Snir, and Cynthia A. Patterson, editors · 2005
Earlier work this paper cites.
A method for obtaining continuous solutions to multiparametric linear programs
Jørgen Spjøtvold, Petter Tøndel, and Tor A. Johansen · 2005
Earlier work this paper cites.
Multiparametric linear programming with applications to control
C.N. Jones, M. Baric, and M. Morari · 2007
Cited alongside, same era.
S. Valdimarsson · 2010
Cited alongside, same era.
Minimizing communication in numerical linear algebra
G. Ballard, J. Demmel, O. Holtz, and O. Schwartz · 2011
Cited alongside, same era.
The Future of Computing Performance: Game Over or Next Level?
Samuel H. Fuller and Lynette I. Millett, editors · 2011
Cited alongside, same era.
Graph expansion and communication costs of fast matrix multiplication
G. Ballard, J. Demmel, O. Holtz, and O. Schwartz · 2012
Cited alongside, same era.
Communication lower bounds and optimal algorithms for programs that reference arrays - part 1
Communication lower bounds and optimal algorithms for programs that reference arrays - part 1
M. Christ, J. Demmel, N. Knight, T. Scanlon, and K. Yelick · 2013
Later among the works it cites.
On Holder-Brascamp-Lieb inequalities for torsion-free discrete Abelian groups
M. Christ, J. Demmel, N. Knight, T. Scanlon, and K. Yelick · 2015
Later among the works it cites.
Communication-Optimal Loop Nests
N. Knight · 2015
Later among the works it cites.
An I/O-Complexity Lower Bound for All Recursive Matrix Multiplication Algorithms by Path-Routing
J. Scott · 2015
Later among the works it cites.
Parallelepipeds obtaining HBL lower bounds
A. Rusciano and J. Demmel · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Christ, J. Demmel, N. Knight, T. Scanlon, and K. Yelick · 2013
Cited alongside, same era.
Imagenet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton · 2017
Later among the works it cites.