The following pages link to Bruno Salvy (Q192037):
Displayed 50 items.
- Multiple binomial sums (Q346550) (← links)
- Non-D-finite excursions in the quarter plane (Q392804) (← links)
- Algorithms for combinatorial structures: well-founded systems and Newton iterations (Q444909) (← links)
- Simultaneous modular reduction and Kronecker substitution for small finite fields (Q540334) (← links)
- Item:Q192037 (redirect page) (← links)
- On location and approximation of clusters of zeros: Case of embedding dimension one (Q870481) (← links)
- Effective bounds for P-recursive sequences (Q992808) (← links)
- Fast conversion algorithms for orthogonal polynomials (Q1044602) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- Non-commutative elimination in Ore algebras proves multivariate identities (Q1264426) (← links)
- Symbolic asymptotics: Functions of two variables, implicit functions (Q1264449) (← links)
- Symbolic asymptotics: Multiseries of inverse functions (Q1300629) (← links)
- Fast computation of some asymptotic functional inverses (Q1333160) (← links)
- Fast algorithms for zero-dimensional polynomial systems using duality (Q1422204) (← links)
- The Projective Noether Maple Package: Computing the dimension of a projective variety (Q1587230) (← links)
- Polynomial ideals for sandpiles and their Gröbner bases (Q1605301) (← links)
- Motif statistics. (Q1853502) (← links)
- Airy phenomena and analytic combinatorics of connected graphs (Q1883647) (← links)
- Asymptotic forms and algebraic differential equations (Q1911940) (← links)
- Effective asymptotics of linear recurrences with rational coefficients (Q1917520) (← links)
- Computer algebra libraries for combinatorial structures (Q1918485) (← links)
- On the complexity of solving quadratic Boolean systems (Q1931429) (← links)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
- Linear differential equations as a data structure (Q2329042) (← links)
- On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
- Lindelöf representations and (non-)holonomic sequences (Q2380433) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- On location and approximation of clusters of zeros of analytic functions (Q2505645) (← links)
- Effective scalar products of D-finite symmetric functions (Q2568968) (← links)
- On the non-holonomic character of logarithms, powers, and the \(n\)th prime function (Q2570990) (← links)
- Algebraic diagonals and walks: algorithms, bounds, complexity (Q2628311) (← links)
- (Q2767931) (← links)
- Algebraic Diagonals and Walks (Q2819741) (← links)
- Formulas for Continued Fractions (Q2819769) (← links)
- Chebyshev expansions for solutions of linear differential equations (Q2883795) (← links)
- A non-holonomic systems approach to special function identities (Q2883807) (← links)
- (Q2900352) (← links)
- (Q2900354) (← links)
- (Q2934694) (← links)
- Low complexity algorithms for linear recurrences (Q2958967) (← links)
- (Q2959885) (← links)
- (Q2959935) (← links)
- Creative telescoping for rational functions using the griffiths (Q2963221) (← links)
- Efficient Algorithms for Mixed Creative Telscoping (Q2985817) (← links)
- Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables (Q2985845) (← links)
- Measured limits and multiseries (Q3066404) (← links)
- GENERATING FUNCTIONS OF CHEBYSHEV-LIKE POLYNOMIALS (Q3067882) (← links)
- PHILIPPE FLAJOLET 1 December 1948 – 22 March 2011 (Q3103618) (← links)
- In memoriam: Philippe Flajolet, the father of analytic combinatorics (Q3117550) (← links)
- On integer Chebyshev polynomials (Q3127331) (← links)