Herbert S. Wilf (1931-2012)
Herbert S. Wilf (1931-2012)
Thomas A. Scott Emeritus Professor of Mathematics, University of Pennsylvania
Verified email at math.upenn.edu - Homepage
TitleCited byYear
generatingfunctionology
HS Wilf
AK Peters/CRC Press, 2005
19552005
Mathematical methods for digital computers
A Ralston, HS Wilf
1706*1960
Combinatorial algorithms: for computers and calculators
A Nijenhuis, HS Wilf
Elsevier, 2014
13162014
Uniqueness theorems for periodic functions
NJ Fine, HS Wilf
Proceedings of the American Mathematical Society 16 (1), 109-114, 1965
5431965
Handbook of combinatorics
RL Graham
Elsevier, 1995
5421995
Algorithms and complexity
HS Wilf
AK Peters/CRC Press, 2002
455*2002
An algorithmic proof theory for hypergeometric (ordinary and “q”) multisum/integral identities
HS Wilf, D Zeilberger
Inventiones mathematicae 108 (1), 575-633, 1992
4161992
Mathematics for the physical sciences
HS Wilf
Courier Corporation, 2013
3042013
An inequality for the chromatic number of a graph
G Szekeres, HS Wilf
Journal of Combinatorial Theory 4 (1), 1-3, 1968
2301968
The number of independent sets in a grid graph
NJ Calkin, HS Wilf
SIAM Journal on Discrete Mathematics 11 (1), 54-60, 1998
2151998
Combinatorial algorithms: an update
HS Wilf
SIAM, 1989
2111989
Recounting the rationals
N Calkin, HS Wilf
The American Mathematical Monthly 107 (4), 360-363, 2000
2022000
Rational functions certify combinatorial identities
HS Wilf, D Zeilberger
Journal of the american mathematical society 3 (1), 147-158, 1990
1841990
The eigenvalues of a graph and its chromatic number
HS Wilf
J. London Math. Soc 42 (1967), 330, 1967
1821967
A= BAK Peters
M Petkovšek, HS Wilf, D Zeilberger
Wellesley, MA, 1996
1801996
A probabilistic proof of a formula for the number of Young tableaux of a given shape
C Greene, A Nijenhuis, HS Wilf
Young Tableaux in Combinatorics, Invariant Theory, and Algebra, 17-22, 1982
1651982
Subordinating factor sequences for convex maps of the unit circle
HS Wilf
Proceedings of the American Mathematical Society 12 (5), 689-693, 1961
1641961
The interchange graph of a finite graph
A van Rooij, H Wilf
Acta Mathematica Hungarica 16 (3-4), 263-269, 1965
1441965
Mathematical methods for digital computers
K Enslein
John Wiley & Sons, 1977
1381977
Backtrack: an O (1) expected time algorithm for the graph coloring problem
HS Wilf
Information Processing Letters 18 (3), 119-121, 1984
1181984
The system can't perform the operation now. Try again later.
Articles 1–20