Generating Functions
Generating Functions is a mathematical tool in combinatorics and probability theory that belongs to the class of formal power series, distinguished by its use of coefficients to encode sequences of numbers or probabilities for the purpose of solving enumeration and distribution problems.
10.2K
Publications
501.2K
Citations
9.7K
Authors
2.7K
Institutions
Publications per year
2017–2026
1.2K
10.2K
Table of Integrals, Series, and Products.
K. S. Kölbig, I. S. Gradshteyn, I.M. RYZHIK et al. · Mathematics of Computation · 1995 · 9.6K citations
Table of Integrals, Series and Products.
Y. L., I. S. Gradshteyn, I. M. Ryzhik · Mathematics of Computation · 1981 · 8.6K citations
Table of Integrals, Series, and Products
D. S., I. S. Gradshteyn, I.M. RYZHIK · Mathematics of Computation · 1966 · 8.2K citations
1–5 of 10.2K
9.7K
48
h-index
30
h-index
29
h-index
29
h-index
28
h-index
1–5 of 9.7K
2.7K

University of Victoria
Victoria, Canada
48 h-index
189 publications
8.4K citations

Centre National de la Recherche Scientifique
Paris, France
44 h-index
287 publications
10.6K citations
Massachusetts Institute of Technology
Cambridge, United States
40 h-index
104 publications
9.3K citations

Pennsylvania State University
State College, United States
36 h-index
143 publications
9.7K citations
University of California, Berkeley
Berkeley, United States
36 h-index
78 publications
11.5K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
32 h-index
78 publications
6.7K citations
Stanford University
Stanford, United States
30 h-index
70 publications
3K citations
Université de Montréal
Montreal, Canada
30 h-index
92 publications
5.1K citations
1–8 of 2.7K
TRAN · 195 publications · 9.5K citations
53
h-index
159 publications · 6.9K citations
46
h-index
DMJ · 118 publications · 6.9K citations
46
h-index
108 publications · 7.5K citations
44
h-index
MCOM · 138 publications · 52.7K citations
44
h-index
1–5