activity
20032026
most citedOn the Complexity of Solving Quadratic Boolean Systems

93 citations · 692 across the 41 of their papers we have counts for

collaborators
Showing 2009Show all

6 papers · 1 filter

q-bio.QM2009★ 13 cited

Asymptotics of Canonical and Saturated RNA Secondary Structures

Peter Clote, Evangelos Kranakis, Danny Krizanc +1

It is a classical result of Stein and Waterman that the asymptotic number of RNA secondary structures is . In this paper, we study combinatorial asymp…

cs.SC2009

Generating functions of Chebyshev-like polynomials

Alin Bostan, Bruno Salvy, Khang Tran

In this short note, we give simple proofs of several results and conjectures formulated by Stolarsky and Tran concerning generating functions of some families of Chebyshev-like pol…

cs.SC2009★ 10 cited

Chebyshev Expansions for Solutions of Linear Differential Equations

Alexandre Benoit, Bruno Salvy

A Chebyshev expansion is a series in the basis of Chebyshev polynomials of the first kind. When such a series solves a linear differential equation, its coefficients satisfy a line…

math.CO2009

Lindelöf Representations and (Non-)Holonomic Sequences

Philippe Flajolet, Stefan Gerhold, Bruno Salvy

Various sequences that possess explicit analytic expressions can be analysed asymptotically through integral representations due to Lindelöf, which belong to an attractive but some…

cs.SC2009★ 20 cited

A Non-Holonomic Systems Approach to Special Function Identities

Frédéric Chyzak, Manuel Kauers, Bruno Salvy

We extend Zeilberger's approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals inv…

cs.SC2009★ 44 cited

Effective Bounds for P-Recursive Sequences

Marc Mezzarobba, Bruno Salvy

We describe an algorithm that takes as input a complex sequence given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a…