52 results on '"Sprugnoli, Renzo"'
Search Results
2. Orthogonal Polynomials
3. Characterization of Riordan Arrays by Special Sequences
4. Extraction of Coefficients and Generating Functions
5. The Riordan Group
6. Introduction
7. The Riordan Group and Applications
8. Generalized Riordan Arrays
9. Extensions of the Riordan Group
10. Combinatorial Sums and Inversions
11. Tablatures for Stringed Instruments and Generating Functions
12. Proving a Class of Hypergeometric Identities by means of Generating Functions
13. Modified Binary Searching for Static Tables
14. The area determined by underdiagonal lattice paths
15. Directed column-convex polyominoes by recurrence relations
16. Corrigendum to “Arithmetic into geometric progressions through Riordan arrays” [Discrete Math. 340 (2) (2017) 160–174]
17. Arithmetic into geometric progressions through Riordan arrays
18. Some inverse limit approaches to the Riordan group
19. Data mining models for student careers
20. On some properties of (a,b)-trees
21. The Use of Computers in Editing Medieval Baptismal Records in Pisa (1457-1509)
22. Tree structures handling by aps
23. Algebraic and combinatorial properties of simple, coloured walks
24. Complementary Riordan arrays
25. Identities induced by Riordan arrays
26. Combinatorial sums through Riordan arrays
27. Mixed succession rules: The commutative case
28. Sequence characterization of Riordan arrays
29. Combinatorial sums and implicit Riordan arrays
30. Negation of binomial coefficients
31. The Method of Coefficients
32. Combinatorial inversions and implicit Riordan arrays
33. The Cauchy numbers
34. Modified binary searching for static tables
35. Fountains and histograms
36. A strip-like tiling algorithm
37. Some statistics on Dyck paths
38. Strip tiling and regular grammars
39. Underdiagonal lattice paths with unrestricted steps
40. Left-inversion of combinatorial sums
41. On Some Alternative Characterizations of Riordan Arrays
42. Polyominoes defined by their vertical and horizontal projections
43. A uniform model for the storage utilization of B-tree-like structures
44. Riordan arrays and the Abel-Gould identity
45. Riordan arrays and combinatorial sums
46. The generation of binary trees as a numerical problem
47. Counting labels in binary trees
48. On the Approximation of Catalan Numbers and Other Quantities
49. On the allocation of binary trees to secondary storage
50. Perfect hashing functions
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.