default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlin Bostan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j30]Gerold Alsmeyer, Alin Bostan, Kilian Raschel
, Thomas Simon:
Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials. Adv. Appl. Math. 150: 102555 (2023)- [j29]Alin Bostan, Sergey Yurkevich:
On the $q$-Analogue of Pólya's Theorem. Electron. J. Comb. 30(2) (2023) - [j28]Alin Bostan, Sergey Yurkevich:
Fast computation of the N-th term of a q-holonomic sequence and applications. J. Symb. Comput. 115: 96-123 (2023) - [j27]Alin Bostan, Tanguy Rivoal, Bruno Salvy:
Minimization of differential equations and algebraic values of 𝐸-functions. Math. Comput. 93(347): 1427-1472 (2023) - [c33]Alin Bostan, Vincent Neiger, Sergey Yurkevich:
Beating binary powering for polynomial matrices. ISSAC 2023: 70-79 - [c32]Alin Bostan, Hadrien Notarantonio, Mohab Safey El Din:
Fast Algorithms for Discrete Differential Equations. ISSAC 2023: 80-89 - [i48]Alin Bostan, Vincent Neiger, Sergey Yurkevich:
Beating binary powering for polynomial matrices. CoRR abs/2302.04299 (2023) - [i47]Alin Bostan, Hadrien Notarantonio, Mohab Safey El Din:
Fast Algorithms for Discrete Differential Equations. CoRR abs/2302.06203 (2023) - [i46]Alin Bostan, Xavier Caruso, Julien Roques:
Algebraic solutions of linear differential equations: an arithmetic approach. CoRR abs/2304.05061 (2023) - [i45]Boris Adamczewski, Alin Bostan, Xavier Caruso:
A sharper multivariate Christol's theorem with applications to diagonals and Hadamard products. CoRR abs/2306.02640 (2023) - 2022
- [j26]Alin Bostan, Jordan Tirrell, Bruce W. Westbury, Yi Zhang:
On some combinatorial sequences associated to invariant theory. Eur. J. Comb. 105: 103554 (2022) - [c31]Alin Bostan, Frédéric Chyzak, Hadrien Notarantonio, Mohab Safey El Din:
Algorithms for Discrete Differential Equations of Order 1. ISSAC 2022: 101-110 - [i44]Alin Bostan, Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din:
Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems. CoRR abs/2203.10021 (2022) - [i43]Alin Bostan, Tanguy Rivoal, Bruno Salvy:
Minimization of differential equations and algebraic values of E-functions. CoRR abs/2209.01827 (2022) - 2021
- [j25]Vladica Andrejic, Alin Bostan, Milos Tatarevic:
Improved algorithms for left factorial residues. Inf. Process. Lett. 167: 106078 (2021) - [j24]Alin Bostan, Fernando Chamizo, Mikael Persson Sundqvist:
On an Integral Identity. Am. Math. Mon. 128(8): 737-743 (2021) - [c30]Alin Bostan:
Computer Algebra in the Service of Enumerative Combinatorics. ISSAC 2021: 1-8 - [c29]Alin Bostan, Ryuhei Mori:
A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence. SOSA 2021: 118-132 - [i42]Alin Bostan, Jordan Tirrell, Bruce W. Westbury, Yi Zhang:
On some combinatorial sequences associated to invariant theory. CoRR abs/2110.13753 (2021) - 2020
- [j23]Antonio Jiménez-Pastor, Alin Bostan, Frédéric Chyzak, Pierre Lairez:
The Sage package comb_walks for walks in the quarter plane. ACM Commun. Comput. Algebra 54(2): 30-38 (2020) - [j22]Alin Bostan, Andrew Elvey Price, Anthony John Guttmann, Jean-Marie Maillard:
Stieltjes Moment Sequences for Pattern-Avoiding Permutations. Electron. J. Comb. 27(4): 4 (2020) - [j21]Alin Bostan, Teresa Krick, Ágnes Szántó, Marcelo Valdettaro:
Subresultants of (x-α)m and (x-β)n, Jacobi polynomials and complexity. J. Symb. Comput. 101: 330-351 (2020) - [c28]Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud:
Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. ICALP 2020: 114:1-114:16 - [c27]Alin Bostan:
Computing the N-th term of a q-holonomic sequence. ISSAC 2020: 46-53 - [i41]Alin Bostan, Andrew Elvey Price, Anthony John Guttmann, Jean-Marie Maillard:
Stieltjes moment sequences for pattern-avoiding permutations. CoRR abs/2001.00393 (2020) - [i40]Alin Bostan, Ryuhei Mori:
A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence. CoRR abs/2008.08822 (2020) - [i39]Alin Bostan, Sergey Yurkevich:
Fast Computation of the N-th Term of a q-Holonomic Sequence and Applications. CoRR abs/2012.08656 (2020)
2010 – 2019
- 2019
- [i38]Vladica Andrejic, Alin Bostan, Milos Tatarevic:
Improved algorithms for left factorial residues. CoRR abs/1904.09196 (2019) - [i37]Alin Bostan, Jordan Tirrell, Bruce W. Westbury, Yi Zhang:
On sequences associated to the invariant theory of rank two simple Lie algebras. CoRR abs/1911.10288 (2019) - 2018
- [c26]Alin Bostan, Frédéric Chyzak, Pierre Lairez, Bruno Salvy:
Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions. ISSAC 2018: 95-102 - [i36]Alin Bostan, Frédéric Chyzak, Pierre Lairez, Bruno Salvy:
Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions. CoRR abs/1805.03445 (2018) - [i35]Alin Bostan, Xavier Caruso, Gilles Christol, Philippe Dumas:
Fast Coefficient Computation for Algebraic Power Series in Positive Characteristic. CoRR abs/1806.06543 (2018) - [i34]Alin Bostan, Teresa Krick, Ágnes Szántó, Marcelo Valdettaro:
Subresultants of (x-α)m and (x-β)n, Jacobi polynomials and complexity. CoRR abs/1812.11789 (2018) - 2017
- [b2]Alin Bostan:
Computer Algebra for Lattice path Combinatorics. (Calcul Formel pour la Combinatoire des Marches). Paris 13 University, France, 2017 - [j20]Alin Bostan, Frédéric Chyzak, Mark van Hoeij, Manuel Kauers, Lucien Pech:
Hypergeometric expressions for generating functions of walks with small steps in the quarter plane. Eur. J. Comb. 61: 242-275 (2017) - [j19]Alin Bostan, Pierre Lairez, Bruno Salvy:
Multiple binomial sums. J. Symb. Comput. 80: 351-386 (2017) - [j18]Alin Bostan, Louis Dumont, Bruno Salvy:
Algebraic diagonals and walks: Algorithms, bounds, complexity. J. Symb. Comput. 83: 68-92 (2017) - [j17]Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, Éric Schost:
On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms. SIAM J. Matrix Anal. Appl. 38(3): 733-775 (2017) - [i33]Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, Éric Schost:
On matrices with displacement structure: generalized operators and faster algorithms. CoRR abs/1703.03734 (2017) - 2016
- [j16]Alin Bostan, Guillaume Chèze, Thomas Cluzeau, Jacques-Arthur Weil:
Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields. Math. Comput. 85(299): 1393-1425 (2016) - [c25]Alin Bostan, Xavier Caruso, Éric Schost:
Computation of the Similarity Class of the p-Curvature. ISSAC 2016: 111-118 - [c24]Alin Bostan, Gilles Christol, Philippe Dumas:
Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field. ISSAC 2016: 119-126 - [c23]Alin Bostan, Louis Dumont, Bruno Salvy:
Efficient Algorithms for Mixed Creative Telscoping. ISSAC 2016: 127-134 - [i32]Alin Bostan, Gilles Christol, Philippe Dumas:
Fast computation of the $N$th term of an algebraic series in positive characteristic. CoRR abs/1602.00545 (2016) - [i31]Alin Bostan, Louis Dumont, Bruno Salvy:
Efficient Algorithms for Mixed Creative Telescoping. CoRR abs/1605.05082 (2016) - [i30]Alin Bostan, Xavier Caruso, Éric Schost:
Computation of the Similarity Class of the p-Curvature. CoRR abs/1605.06126 (2016) - [i29]Alin Bostan, Frédéric Chyzak, Mark van Hoeij, Manuel Kauers, Lucien Pech:
Hypergeometric Expressions for Generating Functions of Walks with Small Steps in the Quarter Plane. CoRR abs/1606.02982 (2016) - 2015
- [c22]Alin Bostan, Xavier Caruso, Éric Schost:
A Fast Algorithm for Computing the P-curvature. ISSAC 2015: 69-76 - [c21]Alin Bostan, Louis Dumont, Bruno Salvy:
Algebraic Diagonals and Walks. ISSAC 2015: 77-84 - [i28]Alin Bostan, Xavier Caruso, Éric Schost:
A Fast Algorithm for Computing the p-Curvature. CoRR abs/1506.05645 (2015) - [i27]Alin Bostan, Louis Dumont, Bruno Salvy:
Algebraic Diagonals and Walks. CoRR abs/1510.04080 (2015) - [i26]Alin Bostan, Louis Dumont, Bruno Salvy:
Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity. CoRR abs/1510.04526 (2015) - [i25]Alin Bostan, Pierre Lairez, Bruno Salvy:
Multiple binomial sums. CoRR abs/1510.07487 (2015) - 2014
- [j15]Alin Bostan, Kilian Raschel, Bruno Salvy:
Non-D-finite excursions in the quarter plane. J. Comb. Theory A 121: 45-63 (2014) - [c20]Alin Bostan, Xavier Caruso, Éric Schost:
A fast algorithm for computing the characteristic polynomial of the p-curvature. ISSAC 2014: 59-66 - [c19]Alin Bostan, Thierry Combot, Mohab Safey El Din:
Computing necessary integrability conditions for planar parametrized homogeneous potentials. ISSAC 2014: 67-74 - [i24]Alin Bostan, Xavier Caruso, Éric Schost:
A fast algorithm for computing the characteristic polynomial of the p-curvature. CoRR abs/1405.5341 (2014) - [i23]Alin Bostan, Thierry Combot, Mohab Safey El Din:
Computing necessary integrability conditions for planar parametrized homogeneous potentials. CoRR abs/1405.5342 (2014) - 2013
- [c18]Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li, Guoce Xin:
Hermite reduction and creative telescoping for hyperexponential functions. ISSAC 2013: 77-84 - [c17]Alin Bostan, Frédéric Chyzak, Elie de Panafieu:
Complexity estimates for two uncoupling algorithms. ISSAC 2013: 85-92 - [c16]Alin Bostan, Pierre Lairez, Bruno Salvy:
Creative telescoping for rational functions using the griffiths: dwork method. ISSAC 2013: 93-100 - [i22]Alin Bostan, Pierre Lairez, Bruno Salvy:
Creative telescoping for rational functions using the Griffiths-Dwork method. CoRR abs/1301.4313 (2013) - [i21]Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li, Guoce Xin:
Hermite Reduction and Creative Telescoping for Hyperexponential Functions. CoRR abs/1301.5038 (2013) - [i20]Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li:
Complexity of Creative Telescoping for Bivariate Rational Functions. CoRR abs/1301.5045 (2013) - [i19]Alin Bostan, Frédéric Chyzak, Elie de Panafieu:
Complexity Estimates for Two Uncoupling Algorithms. CoRR abs/1301.5414 (2013) - [i18]Alin Bostan, Éric Schost:
A simple and fast algorithm for computing exponentials of power series. CoRR abs/1301.5804 (2013) - [i17]Alin Bostan, Guillaume Chèze, Thomas Cluzeau, Jacques-Arthur Weil:
Efficient Algorithms for Computing Rational First Integrals and Darboux Polynomials of Planar Polynomial Vector Fields. CoRR abs/1310.2778 (2013) - 2012
- [j14]Alin Bostan, Thierry Combot:
A Binomial-like Matrix Equation. Am. Math. Mon. 119(7): 593-597 (2012) - [c15]Alexandre Benoît, Alin Bostan, Joris van der Hoeven:
Quasi-optimal Multiplication of Linear Differential Operators. FOCS 2012: 524-530 - [c14]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Ziming Li:
Fast computation of common left multiples of linear ordinary differential operators. ISSAC 2012: 99-106 - [c13]Alin Bostan, Bruno Salvy, Muhammad F. I. Chowdhury, Éric Schost, Romain Lebreton:
Power series solutions of singular (q)-differential equations. ISSAC 2012: 107-114 - [i16]Alin Bostan, Frédéric Chyzak, Ziming Li, Bruno Salvy:
Fast Computation of Common Left Multiples of Linear Ordinary Differential Operators. CoRR abs/1205.0879 (2012) - [i15]Alin Bostan, Muhammad F. I. Chowdhury, Romain Lebreton, Bruno Salvy, Éric Schost:
Power Series Solutions of Singular (q)-Differential Equations. CoRR abs/1205.3414 (2012) - [i14]Alexandre Benoît, Alin Bostan, Joris van der Hoeven:
Quasi-optimal multiplication of linear differential operators. CoRR abs/1208.3639 (2012) - 2011
- [j13]Alin Bostan, Frédéric Chyzak, Ziming Li, Bruno Salvy:
Fast computation of common left multiples of linear ordinary differential operators. ACM Commun. Comput. Algebra 45(1/2): 111-112 (2011) - [j12]Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, Éric Schost:
Homotopy techniques for multiplication modulo triangular sets. J. Symb. Comput. 46(12): 1378-1402 (2011) - [i13]Alin Bostan, Frédéric Chyzak, Mark van Hoeij, Lucien Pech:
Explicit formula for the generating series of diagonal 3D rook paths. CoRR abs/1105.4456 (2011) - 2010
- [j11]Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li:
Rational-functions telescopers: blending creative telescoping with hermite reduction. ACM Commun. Comput. Algebra 44(1/2): 9-10 (2010) - [j10]Alin Bostan, Philippe Dumas:
Wronskians and Linear Independence. Am. Math. Mon. 117(8): 722-727 (2010) - [c12]Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li:
Complexity of creative telescoping for bivariate rational functions. ISSAC 2010: 203-210
2000 – 2009
- 2009
- [j9]Alin Bostan, Éric Schost:
A simple and fast algorithm for computing exponentials of power series. Inf. Process. Lett. 109(13): 754-756 (2009) - [c11]Alin Bostan, Éric Schost:
Fast algorithms for differential equations in positive characteristic. ISSAC 2009: 47-54 - [i12]Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, Éric Schost:
Homotopy methods for multiplication modulo triangular sets. CoRR abs/0901.3657 (2009) - [i11]Alin Bostan, Éric Schost:
Fast algorithms for differential equations in positive characteristic. CoRR abs/0901.3843 (2009) - [i10]Alin Bostan, Bruno Salvy, Khang Tran:
Generating functions of Chebyshev-like polynomials. CoRR abs/0907.0291 (2009) - [i9]Alin Bostan, Manuel Kauers:
The complete Generating Function for Gessel Walks is Algebraic. CoRR abs/0909.1965 (2009) - 2008
- [j8]Alin Bostan, François Morain, Bruno Salvy, Éric Schost:
Fast algorithms for computing isogenies between elliptic curves. Math. Comput. 77(263): 1755-1778 (2008) - [j7]Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
Solving structured linear systems with large displacement rank. Theor. Comput. Sci. 407(1-3): 155-181 (2008) - [c10]Alin Bostan, Frédéric Chyzak, Nicolas Le Roux:
Products of ordinary differential operators by evaluation and interpolation. ISSAC 2008: 23-30 - [c9]Alin Bostan, Bruno Salvy, Éric Schost:
Power series composition and change of basis. ISSAC 2008: 269-276 - [i8]Alin Bostan, Frédéric Chyzak, Nicolas Le Roux:
Products of Ordinary Differential Operators by Evaluation and Interpolation. CoRR abs/0804.2181 (2008) - [i7]Alin Bostan, Bruno Salvy, Éric Schost:
Power Series Composition and Change of Basis. CoRR abs/0804.2337 (2008) - [i6]Alin Bostan, Bruno Salvy, Éric Schost:
Fast Conversion Algorithms for Orthogonal Polynomials. CoRR abs/0804.2373 (2008) - 2007
- [j6]Alin Bostan, Pierrick Gaudry, Éric Schost:
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator. SIAM J. Comput. 36(6): 1777-1806 (2007) - [c8]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost:
Differential equations for algebraic functions. ISSAC 2007: 25-32 - [c7]Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
Solving toeplitz- and vandermonde-like linear systems with large displacement rank. ISSAC 2007: 33-40 - [c6]Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic:
Fast computation of power series solutions of systems of differential equations. SODA 2007: 1012-1021 - [i5]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost:
Differential Equations for Algebraic Functions. CoRR abs/cs/0703121 (2007) - 2006
- [j5]Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
Solving structured linear systems of large displacement rank. ACM Commun. Comput. Algebra 40(2): 42-44 (2006) - [j4]Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost:
Fast computation of special resultants. J. Symb. Comput. 41(1): 1-29 (2006) - [c5]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Thomas Cluzeau:
Low complexity algorithms for linear recurrences. ISSAC 2006: 31-38 - [i4]Éric Schost, Alin Bostan, Claude-Pierre Jeannerod:
Using fast matrix multiplication to solve structured linear systems. Challenges in Symbolic Computation Software 2006 - [i3]Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic:
Fast computation of power series solutions of systems of differential equations. CoRR abs/cs/0604101 (2006) - [i2]Alin Bostan, Frédéric Chyzak, Bruno Salvy, Thomas Cluzeau:
Low Complexity Algorithms for Linear Recurrences. CoRR abs/cs/0605068 (2006) - [i1]Alin Bostan, Bruno Salvy, François Morain, Éric Schost:
Fast algorithms for computing isogenies between elliptic curves. CoRR abs/cs/0609020 (2006) - 2005
- [j3]Alin Bostan, Éric Schost:
Polynomial evaluation and interpolation on special sets of points. J. Complex. 21(4): 420-446 (2005) - [c4]Alin Bostan, Thomas Cluzeau, Bruno Salvy:
Fast algorithms for polynomial solutions of linear differential equations. ISSAC 2005: 45-52 - 2004
- [j2]Alin Bostan, Éric Schost:
On the complexities of multipoint evaluation and interpolation. Theor. Comput. Sci. 329(1-3): 223-235 (2004) - [c3]Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, B. Wiebelt:
Complexity issues in bivariate polynomial factorization. ISSAC 2004: 42-49 - 2003
- [b1]Alin Bostan:
Algorithmique efficace pour des opérations de base en calcul formel. (Fast algorithms for basic operations in computer algebra). École Polytechnique, Palaiseau, France, 2003 - [j1]Alin Bostan, Bruno Salvy, Éric Schost:
Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality. Appl. Algebra Eng. Commun. Comput. 14(4): 239-272 (2003) - [c2]Alin Bostan, Pierrick Gaudry, Éric Schost:
Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves. International Conference on Finite Fields and Applications 2003: 40-58 - [c1]Alin Bostan, Grégoire Lecerf, Éric Schost:
Tellegen's principle into practice. ISSAC 2003: 37-44
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
