A
Alin Bostan
Researcher at French Institute for Research in Computer Science and Automation
Publications - 153
Citations - 2964
Alin Bostan is an academic researcher from French Institute for Research in Computer Science and Automation. The author has contributed to research in topics: Polynomial & Linear differential equation. The author has an hindex of 31, co-authored 142 publications receiving 2646 citations. Previous affiliations of Alin Bostan include University of Paris & Université Paris-Saclay.
Papers
More filters
Journal ArticleDOI
The complete generating function for Gessel walks is algebraic
Alin Bostan,Manuel Kauers +1 more
TL;DR: Gessel walks are lattice walks in the quarter plane as discussed by the authors which start at the origin of the set and consist only of steps chosen from the set, and they are an algebraic function.
Proceedings ArticleDOI
Tellegen's principle into practice
TL;DR: This article proposes explicit transposed versions of polynomial multiplication and division but also new faster algorithms for multipoint evaluation, interpolation and their transposes and reports on their implementation in Shoup's NTL C++ library.
Journal ArticleDOI
Polynomial evaluation and interpolation on special sets of points
Alin Bostan,Éric Schost +1 more
TL;DR: The particular cases when the sample points form an arithmetic or a geometric sequence are focused on, and applications to computations with linear differential operators and to polynomial matrix multiplication are discussed.
Journal ArticleDOI
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator
TL;DR: The best currently known upper bounds for factoring integers deterministically and for computing the Cartier-Manin operator of hyperelliptic curves are improved.
Journal ArticleDOI
Fast algorithms for computing isogenies between elliptic curves
TL;DR: A new algorithm is introduced that computes an isogeny of degree l (l different from the characteristic) in time quasi-linear with respect to l based on fast algorithms for power series expansion of the Weierstrass ℘-function and related functions.