Bruno Salvy

Orcid: 0000-0002-4313-0679

According to our database1, Bruno Salvy authored at least 89 papers between 1988 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimal Experimental Design for Partially Observable Pure Birth Processes.
CoRR, 2024

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

Reduction-Based Creative Telescoping for Definite Summation of D-finite Functions.
CoRR, 2023

Positivity certificates for linear recurrences.
CoRR, 2023

2022
Absolute Root Separation.
Exp. Math., 2022

2021
Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems.
J. Symb. Comput., 2021

Faster Modular Composition.
CoRR, 2021

2020
Computation of Tight Enclosures for Laplacian Eigenvalues.
SIAM J. Sci. Comput., 2020

2019
Linear Differential Equations as a Data Structure.
Found. Comput. Math., 2019

2018
Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 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
Absolute Real Root Separation.
Am. Math. Mon., 2017

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

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

2016
Efficient Algorithms for Mixed Creative Telescoping.
CoRR, 2016

Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

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

2015
On the complexity of the F5 Gröbner basis algorithm.
J. Symb. Comput., 2015

Formulas for Continued Fractions: An Automated Guess and Prove Approach.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

Algebraic Diagonals and Walks.
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, Ser. A, 2014

2013
On the complexity of solving quadratic Boolean systems.
J. Complex., 2013

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

2012
Algorithms for combinatorial structures: Well-founded systems and Newton iterations.
J. Comb. Theory, Ser. A, 2012

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

2011
In Memoriam: Philippe Flajolet The Father of Analytic Combinatorics.
Random Struct. Algorithms, 2011

Obituary. Philippe Flajolet.
J. Symb. Comput., 2011

Simultaneous modular reduction and Kronecker substitution for small finite fields.
J. Symb. Comput., 2011

In memoriam: Philippe Flajolet, the father of analytic combinatorics.
RAIRO Theor. Informatics Appl., 2011

Philippe Flajolet (1948-2011).
Bull. EATCS, 2011

Philippe Flajolet 1 December 1948 - 22 March 2011.
Comb. Probab. Comput., 2011

Philippe Flajolet: the father of analytic combinatorics.
ACM Commun. Comput. Algebra, 2011

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

On Kahan's Rules for Determining Branch Cuts.
Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

2010
Effective bounds for P-recursive sequences.
J. Symb. Comput., 2010

Lindelöf Representations and (Non-)Holonomic Sequences.
Electron. J. Comb., 2010

The Dynamic Dictionary of Mathematical Functions (DDMF).
Proceedings of the Mathematical Software, 2010

Newton Iteration: From Numerics to Combinatorics, and Back.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

The Dynamic Dictionary of Mathematical Functions.
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2009
Asymptotics of Canonical and Saturated RNA Secondary Structures.
J. Bioinform. Comput. Biol., 2009

Generating functions of Chebyshev-like polynomials
CoRR, 2009

A non-holonomic systems approach to special function identities.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Chebyshev expansions for solutions of linear differential equations.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

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

A Proof of a Recurrence for Bessel Moments.
Exp. Math., 2008

Fast Conversion Algorithms for Orthogonal Polynomials
CoRR, 2008

Compressed Modular Matrix Multiplication
CoRR, 2008

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

2007
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One.
Found. Comput. Math., 2007

A Proof of a Recursion for Bessel Moments
CoRR, 2007

Fast computation of power series solutions of systems of differential equations.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

2005
Effective scalar products of D-finite symmetric functions.
J. Comb. Theory, Ser. A, 2005

On Location and Approximation of Clusters of Zeros of Analytic Functions.
Found. Comput. Math., 2005

On the Non-Holonomic Character of Logarithms, Powers, and the nth Prime Function.
Electron. J. Comb., 2005

D-finiteness: algorithms and applications.
Proceedings of the Symbolic and Algebraic Computation, 2005

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

2004
Airy Phenomena and Analytic Combinatorics of Connected Graphs.
Electron. J. Comb., 2004

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

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

ESF: an automatically generated encyclopedia of special functions.
Proceedings of the Symbolic and Algebraic Computation, 2003

2002
Motif statistics.
Theor. Comput. Sci., 2002

Polynomial ideals for sandpiles and their Gröbner bases.
Theor. Comput. Sci., 2002

2001
A Gröbner Free Alternative for Polynomial System Solving.
J. Complex., 2001

2000
The Projective Noether Maple Package: Computing the Dimension of a Projective Variety.
J. Symb. Comput., 2000

1999
Symbolic Asymptotics: Multiseries of Inverse Functions.
J. Symb. Comput., 1999

1998
Symbolic Asymptotics: Functions of Two Variables, Implicit Functions.
J. Symb. Comput., 1998

Non-Commutative Elimination in Ore Algebras Proves Multivariate Identities.
J. Symb. Comput., 1998

Euler Sums and Contour Integral Representations.
Exp. Math., 1998

1997
On integer Chebyshev polynomials.
Math. Comput., 1997

The SIGSAM challenges: symbolic asymptotics in practice.
SIGSAM Bull., 1997

1996
Effective asymptotics of linear recurrences with rational coefficients.
Discret. Math., 1996

Asymptotic Expansions of exp-log Functions.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995
Hypergeometrics and the Cost Structure of Quadtrees.
Random Struct. Algorithms, 1995

Asymptotic Forms and Algebraic Differential Equations.
J. Symb. Comput., 1995

Computer Algebra Libraries for Combinatorial Structures.
J. Symb. Comput., 1995

1994
GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable.
ACM Trans. Math. Softw., 1994

Fast Computation of Some Asymptotic Functional Inverses.
J. Symb. Comput., 1994

1993
A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean).
SIAM Rev., 1993

Efficient programming in Maple: a case study.
SIGSAM Bull., 1993

Finding all Hypergeometric Solutions of Linear Differential Equations.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

Full Partial Fraction Decomposition of Rational Functions.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1992
Asymptotic Expansions of Functional Inverses.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

Varieties of Increasing Trees.
Proceedings of the CAAP '92, 1992

1991
Automatic Average-Case Analysis of Algorithm.
Theor. Comput. Sci., 1991

Examples of automatic asymptotic expansions.
SIGSAM Bull., 1991

1988
Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer.
Proceedings of the Applied Algebra, 1988


  Loading...