1. Algebraic diagonals and walks: Algorithms, bounds, complexity. (November 2017) Authors: Bostan, Alin; Dumont, Louis; Salvy, Bruno Journal: Journal of symbolic computation Issue: Volume 83(2017) Page Start: 68 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems. (March 2021) Authors: Melczer, Stephen; Salvy, Bruno Journal: Journal of symbolic computation Issue: Volume 103(2021) Page Start: 234 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Multiple binomial sums. (May 2017) Authors: Bostan, Alin; Lairez, Pierre; Salvy, Bruno Journal: Journal of symbolic computation Issue: Volume 80:Part 2(2017) Page Start: 351 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. On the complexity of the F5 Gröbner basis algorithm. (September 2015) Authors: Bardet, Magali; Faugère, Jean-Charles; Salvy, Bruno Journal: Journal of symbolic computation Issue: Volume 70(2015) Page Start: 49 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗