1 citations · 1 across the 2 of their papers we have counts for
4 papers
Fast Möbius and Zeta Transforms
Tommaso Pegolotti, Bastian Seifert, Markus Püschel
Möbius inversion of functions on partially ordered sets (posets) is a classical tool in combinatorics. For finite posets it consists of two, mutually inverse, linear…
Finite-Time In-Network Computation of Linear Transforms
Soummya Kar, Markus Püschel, José M. F. Moura
This paper focuses on finite-time in-network computation of linear transforms of distributed graph data. Finite-time transform computation problems are of interest in graph-based c…
Program Generation for Linear Algebra Using Multiple Layers of DSLs
Daniele G. Spampinato, Diego Fabregat-Traver, Markus Püschel +1
Numerical software in computational science and engineering often relies on highly-optimized building blocks from libraries such as BLAS and LAPACK, and while such libraries provid…
Program Generation for Small-Scale Linear Algebra Applications
Daniele G. Spampinato, Diego Fabregat-Traver, Paolo Bientinesi +1
We present SLinGen, a program generation system for linear algebra. The input to SLinGen is an application expressed mathematically in a linear-algebra-inspired language (LA) that…