Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Elango, Venmugil
Rastello, Fabrice
Pouchet, Louis-Noël
Ramanujam, J.
and
Sadayappan, P.
2015.
On Characterizing the Data Access Complexity of Programs.
p.
567.
Elango, Venmugil
Rastello, Fabrice
Pouchet, Louis-Noël
Ramanujam, J.
and
Sadayappan, P.
2015.
On Characterizing the Data Access Complexity of Programs.
ACM SIGPLAN Notices,
Vol. 50,
Issue. 1,
p.
567.
Garg, Ankit
Gurvits, Leonid
Oliveira, Rafael
and
Wigderson, Avi
2017.
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling.
p.
397.
Garg, Ankit
Gurvits, Leonid
Oliveira, Rafael
and
Wigderson, Avi
2018.
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling.
Geometric and Functional Analysis,
Vol. 28,
Issue. 1,
p.
100.
Shi, Zuoshunhua
Wu, Di
and
Yan, Dunyan
2019.
On the Multilinear Fractional Integral Operators with Correlation Kernels.
Journal of Fourier Analysis and Applications,
Vol. 25,
Issue. 2,
p.
538.
O’Neill, Kevin
2020.
A variation on Hölder–Brascamp–Lieb inequalities.
Transactions of the American Mathematical Society,
Vol. 373,
Issue. 8,
p.
5467.
Chen, Anthony
Demmel, James
Dinh, Grace
Haberle, Mason
and
Holtz, Olga
2022.
Communication bounds for convolutional neural networks.
p.
1.
Satomi, Takashi
2024.
Inequality on the optimal constant of Young’s convolution inequality for locally compact groups and their closed subgroups.
Annali di Matematica Pura ed Applicata (1923 -),
Vol. 203,
Issue. 2,
p.
805.
Oki, Taihei
and
Soma, Tasuku
2025.
Algebraic Algorithms for Fractional Linear Matroid Parity via Noncommutative Rank.
SIAM Journal on Computing,
Vol. 54,
Issue. 1,
p.
134.