Bruno Salvy

J. Symb. Comput., 2024

Effective Quadratic Error Bounds for Floating-Point Algorithms Computing the Hypotenuse Function.

[BibT_eX]

[DOI]

Jean-Michel Muller

CoRR, 2024

Optimal Experimental Design for Partially Observable Pure Birth Processes.

[BibT_eX]

[DOI]

CoRR, 2024

Positivity Certificates for Linear Recurrences.

[BibT_eX]

[DOI]

Alaa Ibrahim

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Minimization of differential equations and algebraic values of 𝐸-functions.

[BibT_eX]

[DOI]

Tanguy Rivoal

Math. Comput., October, 2023

2022

Absolute Root Separation.

[BibT_eX]

[DOI]

Exp. Math., 2022

2021

Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems.

[BibT_eX]

[DOI]

Stephen Melczer

J. Symb. Comput., 2021

2020

Computation of Tight Enclosures for Laplacian Eigenvalues.

[BibT_eX]

[DOI]

Joel Dahne

SIAM J. Sci. Comput., 2020

2019

Linear Differential Equations as a Data Structure.

[BibT_eX]

[DOI]

Found. Comput. Math., 2019

2018

Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017

Absolute Real Root Separation.

[BibT_eX]

[DOI]

Am. Math. Mon., 2017

Multiple binomial sums.

[BibT_eX]

[DOI]

Pierre Lairez

J. Symb. Comput., 2017

Algebraic diagonals and walks: Algorithms, bounds, complexity.

[BibT_eX]

[DOI]

J. Symb. Comput., 2017

2016

Efficient Algorithms for Mixed Creative Telescoping.

[BibT_eX]

[DOI]

CoRR, 2016

Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables.

[BibT_eX]

[DOI]

Stephen Melczer

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Efficient Algorithms for Mixed Creative Telscoping.

[BibT_eX]

[DOI]

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015

On the complexity of the F5 Gröbner basis algorithm.

[BibT_eX]

[DOI]

Magali Bardet

Jean-Charles Faugère

J. Symb. Comput., 2015

Formulas for Continued Fractions: An Automated Guess and Prove Approach.

[BibT_eX]

[DOI]

Sébastien Maulat

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

Algebraic Diagonals and Walks.

[BibT_eX]

[DOI]

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

2014

Non-D-finite excursions in the quarter plane.

[BibT_eX]

[DOI]

Kilian Raschel

J. Comb. Theory A, 2014

2013

On the complexity of solving quadratic Boolean systems.

[BibT_eX]

[DOI]

Magali Bardet

Jean-Charles Faugère

Pierre-Jean Spaenlehauer

J. Complex., 2013

Creative telescoping for rational functions using the griffiths: dwork method.

[BibT_eX]

[DOI]

Pierre Lairez

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

Algorithms for combinatorial structures: Well-founded systems and Newton iterations.

[BibT_eX]

[DOI]

Carine Pivoteau

Michèle Soria

J. Comb. Theory A, 2012

Power series solutions of singular (q)-differential equations.

[BibT_eX]

[DOI]

Muhammad F. I. Chowdhury

Romain Lebreton

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

Philippe Flajolet, the Father of Analytic Combinatorics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

In Memoriam: Philippe Flajolet The Father of Analytic Combinatorics.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Obituary. Philippe Flajolet.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

Simultaneous modular reduction and Kronecker substitution for small finite fields.

[BibT_eX]

[DOI]

Jean-Guillaume Dumas

Laurent Fousse

J. Symb. Comput., 2011

In memoriam: Philippe Flajolet, the father of analytic combinatorics.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

Philippe Flajolet (1948-2011).

[BibT_eX]

[DOI]

Bull. EATCS, 2011

Philippe Flajolet 1 December 1948 - 22 March 2011.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

Fast computation of common left multiples of linear ordinary differential operators.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2011

On Kahan's Rules for Determining Branch Cuts.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

2010

Effective bounds for P-recursive sequences.

[BibT_eX]

[DOI]

Marc Mezzarobba

J. Symb. Comput., 2010

Lindelöf Representations and (Non-)Holonomic Sequences.

[BibT_eX]

[DOI]

Stefan Gerhold

Electron. J. Comb., 2010

The Dynamic Dictionary of Mathematical Functions (DDMF).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software, 2010

Newton Iteration: From Numerics to Combinatorics, and Back.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

The Dynamic Dictionary of Mathematical Functions.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2009

Asymptotics of Canonical and Saturated RNA Secondary Structures.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2009

Generating functions of Chebyshev-like polynomials

[BibT_eX]

[DOI]

Khang Tran

CoRR, 2009

A non-holonomic systems approach to special function identities.

[BibT_eX]

[DOI]

Frédéric Chyzak

Manuel Kauers

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Chebyshev expansions for solutions of linear differential equations.

[BibT_eX]

[DOI]

Alexandre Benoît

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008

Fast algorithms for computing isogenies between elliptic curves.

[BibT_eX]

[DOI]

Math. Comput., 2008

A Proof of a Recurrence for Bessel Moments.

[BibT_eX]

[DOI]

Jonathan M. Borwein

Exp. Math., 2008

Fast Conversion Algorithms for Orthogonal Polynomials

[BibT_eX]

[DOI]

CoRR, 2008

Compressed Modular Matrix Multiplication

[BibT_eX]

[DOI]

Jean-Guillaume Dumas

Laurent Fousse

CoRR, 2008

Power series composition and change of basis.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007

On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One.

[BibT_eX]

[DOI]

Marc Giusti

Grégoire Lecerf

Jean-Claude Yakoubsohn

Found. Comput. Math., 2007

A Proof of a Recursion for Bessel Moments

[BibT_eX]

[DOI]

Jonathan M. Borwein

CoRR, 2007

Fast computation of power series solutions of systems of differential equations.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Differential equations for algebraic functions.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006

Fast computation of special resultants.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

Low complexity algorithms for linear recurrences.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005

Effective scalar products of D-finite symmetric functions.

[BibT_eX]

[DOI]

Frédéric Chyzak

Marni Mishna

J. Comb. Theory A, 2005

On Location and Approximation of Clusters of Zeros of Analytic Functions.

[BibT_eX]

[DOI]

Marc Giusti

Grégoire Lecerf

Jean-Claude Yakoubsohn

Found. Comput. Math., 2005

On the Non-Holonomic Character of Logarithms, Powers, and the nth Prime Function.

[BibT_eX]

[DOI]

Stefan Gerhold

Electron. J. Comb., 2005

D-finiteness: algorithms and applications.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2005

Fast algorithms for polynomial solutions of linear differential equations.

[BibT_eX]

[DOI]

Thomas Cluzeau

Proceedings of the Symbolic and Algebraic Computation, 2005

2004

Airy Phenomena and Analytic Combinatorics of Connected Graphs.

[BibT_eX]

[DOI]

Gilles Schaeffer

Electron. J. Comb., 2004

Complexity issues in bivariate polynomial factorization.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2003

ESF: an automatically generated encyclopedia of special functions.

[BibT_eX]

[DOI]

Ludovic Meunier

Proceedings of the Symbolic and Algebraic Computation, 2003

2002

Motif statistics.

[BibT_eX]

[DOI]

Pierre Nicodème

Theor. Comput. Sci., 2002

Polynomial ideals for sandpiles and their Gröbner bases.

[BibT_eX]

[DOI]

Robert Cori

Dominique Rossin

Theor. Comput. Sci., 2002

2001

A Gröbner Free Alternative for Polynomial System Solving.

[BibT_eX]

[DOI]

Marc Giusti

Grégoire Lecerf

J. Complex., 2001

2000

The Projective Noether Maple Package: Computing the Dimension of a Projective Variety.

[BibT_eX]

[DOI]

J. Symb. Comput., 2000

1999

Symbolic Asymptotics: Multiseries of Inverse Functions.

[BibT_eX]

[DOI]

J. Symb. Comput., 1999

1998

Symbolic Asymptotics: Functions of Two Variables, Implicit Functions.

[BibT_eX]

[DOI]

J. Symb. Comput., 1998

Non-Commutative Elimination in Ore Algebras Proves Multivariate Identities.

[BibT_eX]

[DOI]

Frédéric Chyzak

J. Symb. Comput., 1998

Euler Sums and Contour Integral Representations.

[BibT_eX]

[DOI]

Exp. Math., 1998

1997

On integer Chebyshev polynomials.

[BibT_eX]

[DOI]

Laurent Habsieger

Math. Comput., 1997

The SIGSAM challenges: symbolic asymptotics in practice.

[BibT_eX]

[DOI]

SIGSAM Bull., 1997

1996

Effective asymptotics of linear recurrences with rational coefficients.

[BibT_eX]

[DOI]

Xavier Gourdon

Discret. Math., 1996

Asymptotic Expansions of exp-log Functions.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995

Hypergeometrics and the Cost Structure of Quadtrees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

Asymptotic Forms and Algebraic Differential Equations.

[BibT_eX]

[DOI]

J. Symb. Comput., 1995

Computer Algebra Libraries for Combinatorial Structures.

[BibT_eX]

[DOI]

J. Symb. Comput., 1995

1994

GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable.

[BibT_eX]

[DOI]

Paul Zimmermann

ACM Trans. Math. Softw., 1994

Fast Computation of Some Asymptotic Functional Inverses.

[BibT_eX]

[DOI]

J. Symb. Comput., 1994

1993

A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean).

[BibT_eX]

[DOI]

Helmut Prodinger

SIAM Rev., 1993

Efficient programming in Maple: a case study.

[BibT_eX]

[DOI]

SIGSAM Bull., 1993

Finding all Hypergeometric Solutions of Linear Differential Equations.

[BibT_eX]

[DOI]

Marko Petkovsek

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

Full Partial Fraction Decomposition of Rational Functions.

[BibT_eX]

[DOI]

Manuel Bronstein

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1992

Asymptotic Expansions of Functional Inverses.

[BibT_eX]

[DOI]

Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

Varieties of Increasing Trees.

[BibT_eX]

[DOI]

François Bergeron

Proceedings of the CAAP '92, 1992

1991

Automatic Average-Case Analysis of Algorithm.

[BibT_eX]

[DOI]

Paul Zimmermann

Theor. Comput. Sci., 1991

Examples of automatic asymptotic expansions.

[BibT_eX]

[DOI]

SIGSAM Bull., 1991

1988

Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer.

[BibT_eX]

[DOI]