Herbert Wilf | Academic Influence

Herbert Wilf's AcademicInfluence.com Rankings

Herbert Wilf

Mathematics

#345

World Rank

#725

Historical Rank

#166

USA Rank

Measure Theory

#539

World Rank

#754

Historical Rank

#223

USA Rank

mathematics Degrees

Download Badge

Mathematics

Herbert Wilf's Degrees

PhD Mathematics University of Pennsylvania
Bachelors Mathematics City College of New York

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Herbert Wilf Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Herbert Saul Wilf was an American mathematician, specializing in combinatorics and graph theory. He was the Thomas A. Scott Professor of Mathematics in Combinatorial Analysis and Computing at the University of Pennsylvania. He wrote numerous books and research papers. Together with Neil Calkin he founded The Electronic Journal of Combinatorics in 1994 and was its editor-in-chief until 2001.

(See a Problem?)

Herbert Wilf's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Mathematical Methods for Digital Computers (1960) (1107)
Uniqueness theorems for periodic functions (1965) (489)
Algorithms and Complexity (1997) (440)
An algorithmic proof theory for hypergeometric (ordinary and “q”) multisum/integral identities (1992) (431)
Generating functionology (1990) (370)
Statistical Methods for Digital Computers. (1980) (229)
An inequality for the chromatic number of a graph (1968) (215)
generatingfunctionology: Third Edition (1990) (197)
The Number of Independent Sets in a Grid Graph (1998) (191)
Recounting the Rationals (2000) (191)
The Eigenvalues of a Graph and Its Chromatic Number (1967) (173)
Rational functions certify combinatorial identities (1990) (172)
Subordinating factor sequences for convex maps of the unit circle (1961) (164)
Spectral bounds for the clique and independence numbers of graphs (1986) (157)
Combinatorial Algorithms: An Update (1987) (155)
Direct Solutions of Sparse Network Equations by Optimally Ordered Triangular Factorization (1967) (147)
A probabilistic proof of a formula for the number of Young tableaux of a given shape (1979) (140)
A Circle-of-Lights Algorithm for the “Money-Changing Problem” (1978) (116)
On the Permanent of a Doubly Stochastic Matrix (1966) (112)
Algorithms and Complexity (2010) (109)
The interchange graph of a finite graph (1965) (107)
Mathematics for the Physical Sciences (1976) (104)
The number of maximal independent sets in a tree (1986) (103)
The power of a prime that divides a generalized binomial coefficient. (1989) (100)
Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem (1984) (95)
A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects (1977) (88)
Representations of integers by linear forms in nonnegative integers (1972) (85)
The patterns of permutations (2002) (84)
A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane (1978) (61)
Permutation Patterns and Continued Fractions (1999) (58)
Three Problems in Combinatorial Asymptotics (1983) (53)
A Theoretical Analysis of Backtracking in the Graph Coloring Problem (1985) (53)
Acyclic Digraphs and Eigenvalues of O,1 Matrices (2003) (51)
The Disk with the College Education. (1982) (51)
The Asymptotic Behavior of the Stirling Numbers of the First Kind (1993) (50)
Exactness conditions in numerical quadrature (1964) (48)
Finite Sections of Some Classical Inequalities (1970) (48)
Another Probabilistic Method in the Theory of Young Tableaux (1984) (47)
On the multiplicity of parts in a random partition (1999) (47)
Some New Aspects of the Coupon Collector's Problem (2003) (47)
Longest Increasing Subsequences in Pattern-Restricted Permutations (2003) (44)
The Enumeration of Connected Graphs and Linked Diagrams (1979) (44)
Hadamard determinants Möbius functions, and the chromatic number of a graph (1968) (43)
The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometri (1994) (43)
Towards computerized proofs of identities (1990) (40)
Pattern avoidance in compositions and multiset permutations (2005) (37)
The Random Selection of Unlabeled Graphs (1983) (36)
Lectures on Integer Partitions (2009) (36)
Functional iteration and the Josephus problem (1991) (36)
How to do monthly problems with your computer (1997) (35)
Rational function certification of multisum/integral/``$q$'' identities (1992) (34)
Periodicities of Partition Functions and Stirling Numbers modulo p (1987) (33)
Lattice Walks in Zd and Permutations with No Long Ascending Subsequences (1997) (32)
On Eulerian Circuits and Words with Prescribed Adjacency Patterns (1975) (31)
The Uniform Selection of Free Trees (1981) (30)
The Distributions of the Entries of Young Tableaux (2000) (29)
What is an Answer (1982) (29)
A Pentagonal Number Sieve (1998) (28)
Some Examples of Combinatorial Averaging (1985) (28)
The radius of univalence of certain entire functions (1962) (27)
The Editor's Corner: n Coins in a Fountain (1988) (27)
A Stability Criterion for Numerical Integration (1959) (26)
A class of linear differential-difference equations. (1960) (26)
The Editor's Corner: The White Screen Problem (1989) (25)
A Greeting; and a View of Riemann's Hypothesis (1987) (24)
Counting permutations by their alternating runs (2008) (24)
The combinatorics of a three-line circulant determinant (2003) (24)
There’s plenty of time for evolution (2010) (23)
The asymptotics of $e^{P\left( z \right)}$ and the number of elements of each order in $S_n$ (1986) (22)
Some applications of the inequality of arithmetic and geometric means to polynomial equations (1963) (21)
Perron-Frobenius theory and the zeros of polynomials (1961) (21)
A mechanical counting method and combinatorial applications (1968) (21)
Mathematical Methods for Digital Computers, Volume II. (1968) (20)
Bijective Methods in the Theory of Finite Vector Spaces (1984) (20)
Ascending Subsequences of Permutations and the Shapes of Tableaux (1992) (20)
A Method and Two Algorithms on the Theory of Partitions (1975) (19)
The Distribution of Run Lengths in Integer Compositions (2011) (18)
Small eigenvalues of large Hankel matrices (1966) (18)
On the Sequential and Random Selection of Subspaces over a Finite Field (1977) (18)
The distribution of the binomial coefficients modulo p (1992) (17)
The Redheffer Matrix of a Partially Ordered Set (2004) (17)
Bandwidths and profiles of trees (1985) (16)
On Hilbert's inequality in $n$ dimensions (1962) (16)
A short proof of Darboux's lemma (1989) (15)
Maximally Stable Numerical Integration (1960) (14)
MATRIX INVERSION BY THE ANNIHILATION OF RANK (1959) (14)
Combinatorics, Geometry and Probability: On Crossing Numbers, and some Unsolved Problems (1997) (14)
Refining the Stern Diatomic Sequence (2010) (13)
A high-tech proof of the Mills-Robbins-Rumsey determinant formula (1995) (13)
Binary partitions of integers and Stern-Brocot-like trees (2009) (13)
Sieve Equivalence in Generalized Partition Theory (1983) (13)
Accelerated series for universal constants, by the WZ method (1999) (13)
East Side, West Side . . . - an introduction to combinatorial families-with Maple programming (1999) (12)
Mathematical aspects of electrical network analysis (1971) (12)
Closed form summation of C-finite sequences (2004) (12)
Computing the distribution of the maximum in balls-and-boxes problems with application to clusters of disease cases (2006) (12)
The Problem of the Kings (1994) (11)
On Finite Sections of the Classical Inequalities (1962) (11)
A Unified Setting for Selection Algorithms (II) (1978) (11)
A Bijection in the Theory of Derangements (1984) (11)
A Footnote on Two Proofs of the Bieberbach-De Branges Theorem (1994) (11)
A NOTE ON PARTITIONS AND COMPOSITIONS DEFINED BY INEQUALITIES (2005) (11)
Irreducible compositions and the first return to the origin of a random walk (2004) (11)
On the Growth of Restricted Integer Partition Functions (2010) (11)
THE POSSIBILITY OF TSCHEBYCHEFF QUADRATURE ON INFINITE INTERVALS. (1961) (10)
The method of characteristics, and "problem 89" of Graham, Knuth and Patashnik (2004) (10)
Searching the Web with Eigenvectors (2002) (10)
Basis partitions (1998) (9)
On a conjecture of Ira Gessel (2008) (9)
Five Surprisingly Simple Complexities (1995) (9)
On Dirichlet series and Toeplitz forms (1964) (9)
Statistical Methods for Digital Computers, Volume III (1979) (9)
On the outstanding elements of permutations (1995) (9)
Left-to-right maxima in words and multiset permutations (2007) (9)
BG-Ranks and 2-Cores (2006) (8)
A combinatorial determinant (1998) (8)
The argument of an entire function (1961) (8)
When are subset sums equidistributed modulo m? (1994) (8)
Identically Distributed Pairs of Partition Statistics (2000) (8)
Counting Pairs of Lattice Paths by Intersections (1994) (8)
The variance of the Stirling cycle numbers (2005) (7)
The stability of smoothing by least squares (1964) (7)
Surveys in Combinatorics, 1989: The ‘Snake Oil’ method for proving combinatorial identities (1989) (6)
On the Coefficients in the Hardy-Ramanujan-Rademacher Formula for p(n) (1995) (6)
Regularly spaced subsums of integer partitions (2003) (6)
Strings, substrings, and the nearest integer function (1988) (6)
Review of Mathematical Methods for Digital Computers, Vol. 2 (1967) (6)
Averages by the Sieve Method (1978) (6)
The Editor's Corner: Strings, Substrings, and the ‘Nearest Integer’ Function (1987) (6)
Patterns and Fractions (1999) (6)
Algorithms and complexity (2. ed.) (2002) (6)
Problems: 10578-10584 (1997) (6)
Mathematics : An Experimental Science (5)
When can the sum of (1/p)th of the binomial coefficients have closed form? (1996) (5)
WHITTAKER'S CONSTANT FOR LACUNARY ENTIRE FUNCTIONS (1963) (5)
How to lose as little as possible (2010) (5)
Ranking Rooted Trees, and a Graceful Application (1989) (5)
The number-theoretic content of the Jacobi triple product identity. (2001) (5)
An Algorithm-Inspired Proof of the Spectral Theorem in E n (1981) (5)
On a conjecture of ryser and minc (1970) (4)
The Joint Distribution of Descent and Major Index over Restricted Sets of Permutations (2007) (4)
Problems: 10585-10591 (1997) (4)
Budan’s theorem for a class of entire functions (1962) (4)
WZ-STYLE CERTIFICATION AND SISTER CELINE'S TECHNIQUE FOR ABEL-TYPE SUMS (2007) (4)
Extreme Palindromes (2006) (4)
Finite lists of obstructions (1987) (4)
Errata to: “Small eigenvalues of large Hankel matrices” (1968) (4)
Another probabilistic formula in the theory of Young tableaux (1984) (3)
A Discontinuity in the Distribution of Fixed Point Sums (2003) (3)
Random Permutation of n Letters (RANPER) (1978) (3)
On the zeros of Riesz' function in the analytic theory of numbers (1964) (3)
Combinatorial families that are exponentially far from being listable in Gray code sequence (1999) (3)
Counting permutations by their runs up and down (2006) (3)
Symbolic manipulation and algorithms in the curriculum of the first two years (1983) (3)
Self-esteem in Mathematicians (1990) (3)
A note on P(− λ; G) (1977) (3)
The distribution of longest run lengths in integer compositions (2009) (3)
Chapter 1 – Introductory ideas and examples (1994) (3)
The Computer-Aided Discovery of a Theorem about Young Tableaux (1995) (3)
Mathematical Methods for Digital Computers, Vol. III: Statistical Methods for Digital Computers. (1977) (3)
Programming for a digital computer in the FORTRAN language (1971) (2)
The Backtrack Method (BACKTR) (1978) (2)
Iterative Methods for the Solution of Equations (J. F. Traub) (1966) (2)
Almost Diagonal Matrices (1960) (2)
A bijection for ordered factorizations (1990) (2)
Mathematical methods for digital computers - Volumes 1 and 2 (1967) (2)
An Integrated Two-Year Curriculum—Report of a Workshop (1983) (2)
Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater (2000) (2)
CONGRUENCE PROBLEMS INVOLVING STIRLING NUMBERS OF THE FIRST KIND Rhodes Peek (1991) (2)
MONTE CARLO SOLVES REACTOR PROBLEMS (1957) (2)
Counting Nondecreasing Integer Sequences that Lie Below a Barrier (2009) (2)
Next Partition of an n -Set (NEXEQU) (1978) (2)
On a conjecture in the theory of permanents (1970) (2)
Introductory Ideas and Examples (1990) (2)
An open formula for the numerical integration of first order differential equations (1957) (1)
Two Algorithms for the Sieve Method (1991) (1)
Sequencing, Ranking, and Selection Algorithms in General Combinatorial Families (SELECT) (1978) (1)
View of Riemann's hypothesis (1986) (1)
On the Monotonicity of Certain Riesz Means (1962) (1)
The white screen problem (1989) (1)
Curve-Fitting Matrices (1958) (1)
Boundary values in chromatic graph theory (1973) (1)
The distribution of the binomial coe cients modulo pRichard (1)
Analytic and Asymptotic Methods (1990) (1)
Errata: The stability of smoothing by least squares (1966) (1)
Calculations relating to a conjecture of Pólya and Schoenberg (1963) (1)
Chapter 2 – Series (1990) (1)
Tex: A Non-Review (1986) (1)
Can there be “ research in mathematical education ” ? (1)
The exponential distributed (1987) (1)
Divisibility properties of the permanent function (1968) (1)
The Editor's Corner: The Quest for Normality (1988) (1)
Spanning Forest of a Graph (SPANFO) (1978) (1)
Ascending subsequences of permutations and Young tableaux (1992) (1)
Boundary values in the four color problem (1973) (1)
The distribution of prefix overlap in consecutive dictionary entries (1986) (1)
The "Why-Don't-You-Just...?" Barrier in Discrete Algorithms (1979) (1)
The Network Flow Problem (2002) (0)
Next Subset of an n -Set (NEXSUB/LEXSUB) (1978) (0)
Wilson's Theorem in Disguise: 10578 (1999) (0)
Composition of Power Series (POWSER) (1978) (0)
Triangular Numbering in Partially Ordered Sets (TRIANG) (1978) (0)
Chapter 4 – Applications of generating functions (1994) (0)
Hypergeometric Identities Associated with Statistics on Words (2013) (0)
Random k -Subset of an n -Set (RANKSB) (1978) (0)
Sections of Toeplitz and Hilbert Forms (1970) (0)
Cards, Decks, and Hands: The Exponential Formula (1990) (0)
Labeled Trees (LBLTRE) (1978) (0)
The Transmission of Neutrons in Multilayered Slab Geometry (1959) (0)
An Infinite Product: 10595 (1998) (0)
Next Composition of n into k Parts (NEXCOM) (1978) (0)
Chromatic Polynomial of a Graph (CHROMP) (1978) (0)
Chapter 5 – Analytic and asymptotic methods (1994) (0)
Young Tableaux (NEXYTB/RANYTB) (1978) (0)
Think Rationally: 11068 (2005) (0)
FOUR-COLORING SIX-REGULAR GRAPHS ON THE TORUS KAREN L. COLLINS AND JOAN P. HUTCHINSON Dedicated to Herbert S. Wilf in honor of his 65th birthday, and to (1999) (0)
We show that the probability that two permutations of $n$ letters have the same number of cycles is \[\sim \frac{1}{2\sqrt{\pi\log{n}}}.\] (2005) (0)
O ct 2 01 2 SOME REMARKS ON THE JOINT DISTRIBUTION OF DESCENTS AND INVERSE DESCENTS MIRKÓ VISONTAI In memoriam (2014) (0)
7. Listing Free Trees (1989) (0)
Look who's talking: Using transactional analysis in the writing of effective screenplay dialogue (2017) (0)
Random Subset of an n -Set (RANSUB) (1978) (0)
Newton Forms of a Polynomial (POLY) (1978) (0)
Invert a Triangular Array (INVERT) (1978) (0)
Connections Through a Matrix (2000) (0)
A pr 2 00 0 Identically Distributed Pairs of Partition Statistics (2000) (0)
Numerical Integration of the Transport Equation with No Angular Truncation (1960) (0)
8. Generating Random Graphs (1989) (0)
3. Variations on the Theme (1989) (0)
Problems: 10211-10219 (1992) (0)
COMBINATORICS MT454 / MT5454 (2012) (0)
Induced Markov chains and the permanent function (1972) (0)
2�a+b startingatthesamepoint(a+1;b+1)andmovingasabove:inthistheanswerissimply apa+1qb+1. Inparticular,thespecialcasethatoriginallyinteresteduswasthecaseoftwowalkers 2.NachumDershowitzandSchmuelZaks,Enumerationoforderedtrees,DiscreteMath. 1.W.N.Bailey,Gene (0)
Chapter 3 – Cards, Decks, and Hands: The Exponential Formula (1994) (0)
Random Partition of an n -Set (RANEQU) (1978) (0)
Applications of Generating Functions (1990) (0)
Random Partition of an Integer n (RANPAR) (1978) (0)
Calculus and linear algebra (1966) (0)
Colloquium in combinatorial theory, Rome (1974) (0)
The Möbius Function (MOBIUS) (1978) (0)
The Cycle Structure of a Permutation (CYCLES) (1978) (0)
On a Conjecture of Ira Gessel Marko Petkovšek (2008) (0)
6. Random Selection of Free Trees (1989) (0)
Renumbering Rows and Columns of an Array (RENUMB) (1978) (0)
Advanced Problems: 6637-6639 (1990) (0)
Using Maple and Mathematica (2005) (0)
Sorting (HPSORT/EXHEAP) (1978) (0)
Next Partition of Integer n (NEXPAR) (1978) (0)
1. The Original Gray Code (1989) (0)
Concerning the Theory of Control Sheets (1959) (0)
What this Book Is About (2002) (0)
The Permanent Function (PERMAN) (1978) (0)
Next k -Subset of an n -Set (NEXKSB/NXKSRD) (1978) (0)
Hints and Solutions for Selected Problems (2002) (0)
GLOBAL POSITIONING SYSTEM READOUT OF RECOMMENDED ALTTUDE IN AIRCRAFT LANDING PATTERN ( 76 ) Inventor : (2017) (0)
A note on P(-lambda; G) (1977) (0)
Random Composition of n into k Parts (RANCOM) (1978) (0)
On ‘Uniformly Filled’ Determinants (1990) (0)
Tree of Minimal Length (MINSPT) (1978) (0)
Newton's Method. (1971) (0)
A ug 2 00 3 Regularly Spaced Subsums of Integer Partitions (2003) (0)
Book Review: Algebraic graph theory@@@Book Review: Combinatorial theory seminar (1975) (0)
Next Permutation of n Letters (NEXPER) (1978) (0)
Review: Norman Biggs, Algebraic graph theory, and Jacobus H. van Lint, Combinatorial theory seminar (1975) (0)
2 2 Se p 19 98 A combinatorial determinant (1998) (0)
4. Choosing 2-Samples (1989) (0)
American Mathematical Society Edited by with the Cooperation of Index to Volume 15 [december Cohomology of Groups in Arbitrary Categories (0)
Network Flows (NETFLO) (1978) (0)
Proceedings of the Japan-US joint seminar on discrete algorithms and complexity (1987) (0)
Problems for Solution: E1091-E1095 (1953) (0)
Elementary Problems: E3457-E3462 (1991) (0)
TICS ON A CONJECTURE OF RYSElt AND MINC (1970) (0)
2. Other Gray Codes (1989) (0)
5. Listing Rooted Trees (1989) (0)
An Arc Cotangent Series: 10986 (2004) (0)
The “Why-Don't-You-Just…?” Barrier in Discrete Algorithms (1979) (0)
Random Unlabeled Rooted Trees (RANRUT) (1978) (0)
Problem 10866 (2001) (0)
Algorithms in the Theory of Numbers (2002) (0)
Correction to “The ‘Why-Don't-You-Just…?’ Barrier in Discrete Algorithms” (1979) (0)
Waiting for the Bus: 10866 (2002) (0)
In Memoriam: Rodica Simion (1955-2000) (2002) (0)
The Editor's Corner: The Exponential Distribution (1987) (0)
VIII.5 Mathematics: An Experimental Science (2010) (0)
An open formula for the numerical integration of first order differential equations. II (1958) (0)
Tables for automatic computation (1958) (0)

This paper list is powered by the following services:

Other Resources About Herbert Wilf

en.wikipedia.org

What Schools Are Affiliated With Herbert Wilf?

Herbert Wilf is affiliated with the following schools:

Image Attributions

Image Source for Herbert Wilf