Alin Bostan

Orcid: 0000-0003-3798-9281

According to our database1, Alin Bostan authored at least 79 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Minimization of differential equations and algebraic values of 𝐸-functions.
Math. Comput., October, 2023

Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials.
Adv. Appl. Math., September, 2023

Fast computation of the <i>N</i>-th term of a <i>q</i>-holonomic sequence and applications.
J. Symb. Comput., 2023

A sharper multivariate Christol's theorem with applications to diagonals and Hadamard products.
CoRR, 2023

Algebraic solutions of linear differential equations: an arithmetic approach.
CoRR, 2023

On the $q$-Analogue of Pólya's Theorem.
Electron. J. Comb., 2023

Beating binary powering for polynomial matrices.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Fast Algorithms for Discrete Differential Equations.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
On some combinatorial sequences associated to invariant theory.
Eur. J. Comb., 2022

Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems.
CoRR, 2022

Algorithms for Discrete Differential Equations of Order 1.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021
On an Integral Identity.
Am. Math. Mon., 2021

Improved algorithms for left factorial residues.
Inf. Process. Lett., 2021

A Simple and Fast Algorithm for Computing the <i>N</i>-th Term of a Linearly Recurrent Sequence.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Computer Algebra in the Service of Enumerative Combinatorics.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Subresultants of (<i>x</i>-<i>α</i>)<sup><i>m</i></sup> and (<i>x</i>-<i>β</i>)<sup><i>n</i></sup>, Jacobi polynomials and complexity.
J. Symb. Comput., 2020

Fast Computation of the N-th Term of a q-Holonomic Sequence and Applications.
CoRR, 2020

A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence.
CoRR, 2020

Stieltjes Moment Sequences for Pattern-Avoiding Permutations.
Electron. J. Comb., 2020

The Sage package comb_walks for walks in the quarter plane.
ACM Commun. Comput. Algebra, 2020

Computing the N-th term of a q-holonomic sequence.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
On sequences associated to the invariant theory of rank two simple Lie algebras.
CoRR, 2019

2018
Subresultants of (x-α)<sup>m</sup> and (x-β)<sup>n</sup>, Jacobi polynomials and complexity.
CoRR, 2018

Fast Coefficient Computation for Algebraic Power Series in Positive Characteristic.
CoRR, 2018

Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017
On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms.
SIAM J. Matrix Anal. Appl., 2017

Multiple binomial sums.
J. Symb. Comput., 2017

Algebraic diagonals and walks: Algorithms, bounds, complexity.
J. Symb. Comput., 2017

Hypergeometric expressions for generating functions of walks with small steps in the quarter plane.
Eur. J. Comb., 2017

Computer Algebra for Lattice path Combinatorics. (Calcul Formel pour la Combinatoire des Marches).
, 2017

2016
Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields.
Math. Comput., 2016

Efficient Algorithms for Mixed Creative Telescoping.
CoRR, 2016

Fast computation of the $N$th term of an algebraic series in positive characteristic.
CoRR, 2016

Efficient Algorithms for Mixed Creative Telscoping.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Computation of the Similarity Class of the p-Curvature.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
Algebraic Diagonals and Walks.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

A Fast Algorithm for Computing the P-curvature.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014
Non-D-finite excursions in the quarter plane.
J. Comb. Theory A, 2014

A fast algorithm for computing the characteristic polynomial of the p-curvature.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Computing necessary integrability conditions for planar parametrized homogeneous potentials.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013
Creative telescoping for rational functions using the griffiths: dwork method.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Complexity estimates for two uncoupling algorithms.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Hermite reduction and creative telescoping for hyperexponential functions.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
A Binomial-like Matrix Equation.
Am. Math. Mon., 2012

Power series solutions of singular (q)-differential equations.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Quasi-optimal Multiplication of Linear Differential Operators.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Homotopy techniques for multiplication modulo triangular sets.
J. Symb. Comput., 2011

Explicit formula for the generating series of diagonal 3D rook paths
CoRR, 2011

Fast computation of common left multiples of linear ordinary differential operators.
ACM Commun. Comput. Algebra, 2011

2010
Wronskians and Linear Independence.
Am. Math. Mon., 2010

Rational-functions telescopers: blending creative telescoping with hermite reduction.
ACM Commun. Comput. Algebra, 2010

Complexity of creative telescoping for bivariate rational functions.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009
A simple and fast algorithm for computing exponentials of power series.
Inf. Process. Lett., 2009

The complete Generating Function for Gessel Walks is Algebraic
CoRR, 2009

Generating functions of Chebyshev-like polynomials
CoRR, 2009

Homotopy methods for multiplication modulo triangular sets
CoRR, 2009

Fast algorithms for differential equations in positive characteristic.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008
Solving structured linear systems with large displacement rank.
Theor. Comput. Sci., 2008

Fast algorithms for computing isogenies between elliptic curves.
Math. Comput., 2008

Fast Conversion Algorithms for Orthogonal Polynomials
CoRR, 2008

Power series composition and change of basis.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

Products of ordinary differential operators by evaluation and interpolation.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator.
SIAM J. Comput., 2007

Fast computation of power series solutions of systems of differential equations.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Solving toeplitz- and vandermonde-like linear systems with large displacement rank.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Differential equations for algebraic functions.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006
Fast computation of special resultants.
J. Symb. Comput., 2006

Low complexity algorithms for linear recurrences.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Using fast matrix multiplication to solve structured linear systems.
Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005
Polynomial evaluation and interpolation on special sets of points.
J. Complex., 2005

Fast algorithms for polynomial solutions of linear differential equations.
Proceedings of the Symbolic and Algebraic Computation, 2005

2004
On the complexities of multipoint evaluation and interpolation.
Theor. Comput. Sci., 2004

Complexity issues in bivariate polynomial factorization.
Proceedings of the Symbolic and Algebraic Computation, 2004

2003
Algorithmique efficace pour des opérations de base en calcul formel. (Fast algorithms for basic operations in computer algebra).
PhD thesis, 2003

Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality.
Appl. Algebra Eng. Commun. Comput., 2003

Tellegen's principle into practice.
Proceedings of the Symbolic and Algebraic Computation, 2003

Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves.
Proceedings of the Finite Fields and Applications, 2003


  Loading...