The complexity of matrix multiplication is measured in terms of 𝜔, the smallest real number
such that two 𝑛× 𝑛 matrices can be multiplied using 𝑂 (𝑛 𝜔+ 𝜖) field operations for all 𝜖> 0; …

Constant delay enumeration for conjunctive queries Page 1 Constant Delay Enumeration for
Conjunctive Queries — a Tutorial Christoph Berkholz Fabian Gerhardt Nicole Schweikardt …

Biomedical imaging is unequivocally dependent on the ability to reconstruct interpretable
and high-quality images from acquired sensor data. This reconstruction process is pivotal …

The Handbook of Linear Algebra provides comprehensive coverage of linear algebra
concepts, applications, and computational software packages in an easy-to-use handbook …

A large class of problems in symbolic computation can be expressed as the task of
computing some polynomials; and arithmetic circuits form the most standard model for …

Medical ultrasound imaging relies heavily on high-quality signal processing to provide
reliable and interpretable image reconstructions. Conventionally, reconstruction algorithms …

We present parallel and sequential dense QR factorization algorithms that are both optimal
(up to polylogarithmic factors) in the amount of communication they perform and just as …

Photonic computation has garnered huge attention due to its great potential to accelerate
artificial neural network tasks at much higher clock rate to digital electronic alternatives …

Let A and B two n× n matrices over a ring R (eg, the reals or the integers) each containing at
most m nonzero elements. We present a new algorithm that multiplies A and B using O (m …

Abstract In Demmel et al.(Numer. Math. 106 (2), 199–224, 2007) we showed that a large
class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that …