93 citations · 692 across the 41 of their papers we have counts for
4 papers · 1 filter
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform severa…
Fast Conversion Algorithms for Orthogonal Polynomials
Alin Bostan, Bruno Salvy, Éric Schost
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduce…
Power Series Composition and Change of Basis
Alin Bostan, Bruno Salvy, Éric Schost
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, ...). Composition is a more complex task. We isolate a large cl…
Compressed Modular Matrix Multiplication
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
We propose to store several integers modulo a small prime into a single machine word. Modular addition is performed by addition and possibly subtraction of a word containing severa…