| 2008 |
|---|
| 46 | EE | E. Rodney Canfield,
Herbert S. Wilf:
Counting permutations by their alternating runs.
J. Comb. Theory, Ser. A 115(2): 213-225 (2008) |
| 2006 |
|---|
| 45 | EE | William Y. C. Chen,
Kathy Q. Ji,
Herbert S. Wilf:
BG-Ranks and 2-Cores.
Electr. J. Comb. 13(1): (2006) |
| 2003 |
|---|
| 44 | EE | Edward A. Bender,
E. Rodney Canfield,
L. Bruce Richmond,
Herbert S. Wilf:
A Discontinuity in the Distribution of Fixed Point Sums.
Electr. J. Comb. 10: (2003) |
| 43 | EE | Amy N. Myers,
Herbert S. Wilf:
Some New Aspects of the Coupon Collector's Problem.
SIAM J. Discrete Math. 17(1): 1-17 (2003) |
| 2002 |
|---|
| 42 | EE | Herbert S. Wilf:
The patterns of permutations.
Discrete Mathematics 257(2-3): 575-583 (2002) |
| 41 | EE | Emeric Deutsch,
A. J. Hildebrand,
Herbert S. Wilf:
Longest Increasing Subsequences in Pattern-Restricted Permutations.
Electr. J. Comb. on(2): (2002) |
| 40 | EE | Brendan D. McKay,
Jennifer Morse,
Herbert S. Wilf:
The Distributions of the Entries of Young Tableaux.
J. Comb. Theory, Ser. A 97(1): 117-128 (2002) |
| 2000 |
|---|
| 39 | EE | Neil J. Calkin,
E. Rodney Canfield,
Herbert S. Wilf:
Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater.
J. Comb. Theory, Ser. A 91(1-2): 171-190 (2000) |
| 1999 |
|---|
| 38 | EE | Herbert S. Wilf:
Accelerated series for universal constants, by the WZ method.
Discrete Mathematics & Theoretical Computer Science 3(4): 189-192 (1999) |
| 37 | EE | Aaron Robertson,
Herbert S. Wilf,
Doron Zeilberger:
Permutation Patterns and Continued Fractions.
Electr. J. Comb. 6: (1999) |
| 36 | | Sylvie Corteel,
Boris Pittel,
Carla D. Savage,
Herbert S. Wilf:
On the multiplicity of parts in a random partition.
Random Struct. Algorithms 14(2): 185-197 (1999) |
| 1998 |
|---|
| 35 | EE | Jennifer M. Nolan,
Carla D. Savage,
Herbert S. Wilf:
Basis partitions.
Discrete Mathematics 179(1-3): 277-283 (1998) |
| 34 | EE | Ira M. Gessel,
Jonathan Weinstein,
Herbert S. Wilf:
Lattice Walks in Zd and Permutations with No Long Ascending Subsequences.
Electr. J. Comb. 5: (1998) |
| 33 | EE | Sylvie Corteel,
Carla D. Savage,
Herbert S. Wilf,
Doron Zeilberger:
A Pentagonal Number Sieve.
J. Comb. Theory, Ser. A 82(2): 186-192 (1998) |
| 32 | EE | Neil J. Calkin,
Herbert S. Wilf:
The Number of Independent Sets in a Grid Graph.
SIAM J. Discrete Math. 11(1): 54-60 (1998) |
| 1997 |
|---|
| 31 | EE | Marko Petkovsek,
Herbert S. Wilf:
When can the sum of (1/p)th of the binomial coefficients have closed form?
Electr. J. Comb. 4(2): (1997) |
| 1996 |
|---|
| 30 | EE | Marko Petkovsek,
Herbert S. Wilf:
A high-tech proof of the Mills-Robbins-Rumsey determinant formula.
Electr. J. Comb. 3(2): (1996) |
| 29 | EE | Ira M. Gessel,
Wayne Goddard,
Walter Shur,
Herbert S. Wilf,
Lily Yen:
Counting Pairs of Lattice Paths by Intersections.
J. Comb. Theory, Ser. A 74(2): 173-187 (1996) |
| 28 | EE | Herbert S. Wilf:
Récents développements et problèmes dans le domaine de la génération aléatoire.
Theor. Comput. Sci. 159(1): 5-13 (1996) |
| 1995 |
|---|
| 27 | EE | Herbert S. Wilf:
The Problem of the Kings.
Electr. J. Comb. 2: (1995) |
| 26 | | Volker Strehl,
Herbert S. Wilf:
Five Surprisingly Simple Complexities.
J. Symb. Comput. 20(5/6): 725-729 (1995) |
| 25 | | Herbert S. Wilf:
The Computer-Aided Discovery of a Theorem about Young Tableaux.
J. Symb. Comput. 20(5/6): 731-735 (1995) |
| 1994 |
|---|
| 24 | EE | Stan Wagon,
Herbert S. Wilf:
When are subset sums equidistributed modulo m?
Electr. J. Comb. 1: (1994) |
| 1993 |
|---|
| 23 | | Herbert S. Wilf:
The Asymptotic Behavior of the Stirling Numbers of the First Kind.
J. Comb. Theory, Ser. A 64(2): 344-349 (1993) |
| 1992 |
|---|
| 22 | | Herbert S. Wilf:
Ascending Subsequences of Permutations and the Shapes of Tableaux.
J. Comb. Theory, Ser. A 60(1): 155-157 (1992) |
| 1991 |
|---|
| 21 | | Herbert S. Wilf:
Two Algorithms for the Sieve Method.
J. Algorithms 12(1): 179-182 (1991) |
| 1990 |
|---|
| 20 | EE | Richard Garfield,
Donald E. Knuth,
Herbert S. Wilf:
A bijection for ordered factorizations.
J. Comb. Theory, Ser. A 54(2): 317-318 (1990) |
| 1987 |
|---|
| 19 | EE | Andrew M. Odlyzko,
Herbert S. Wilf:
Bandwidths and profiles of trees.
J. Comb. Theory, Ser. B 42(3): 348-370 (1987) |
| 1986 |
|---|
| 18 | EE | Herbert S. Wilf:
Spectral bounds for the clique and independence numbers of graphs.
J. Comb. Theory, Ser. B 40(1): 113-117 (1986) |
| 1985 |
|---|
| 17 | | Edward A. Bender,
Herbert S. Wilf:
A Theoretical Analysis of Backtracking in the Graph Coloring Problem.
J. Algorithms 6(2): 275-282 (1985) |
| 1984 |
|---|
| 16 | | Herbert S. Wilf:
Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem.
Inf. Process. Lett. 18(3): 119-121 (1984) |
| 15 | | Albert Nijenhuis,
Anita E. Solow,
Herbert S. Wilf:
Bijective Methods in the Theory of Finite Vector Spaces.
J. Comb. Theory, Ser. A 37(1): 80-84 (1984) |
| 14 | | Curtis Greene,
Albert Nijenhuis,
Herbert S. Wilf:
Another Probabilistic Method in the Theory of Young Tableaux.
J. Comb. Theory, Ser. A 37(2): 127-135 (1984) |
| 1983 |
|---|
| 13 | | John D. Dixon,
Herbert S. Wilf:
The Random Selection of Unlabeled Graphs.
J. Algorithms 4(3): 205-213 (1983) |
| 12 | | Herbert S. Wilf:
Sieve Equivalence in Generalized Partition Theory.
J. Comb. Theory, Ser. A 34(1): 80-89 (1983) |
| 11 | | Herbert S. Wilf:
Three Problems in Combinatorial Asymptotics.
J. Comb. Theory, Ser. A 35(2): 199-207 (1983) |
| 1981 |
|---|
| 10 | | Herbert S. Wilf:
The Uniform Selection of Free Trees.
J. Algorithms 2(2): 204-207 (1981) |
| 1979 |
|---|
| 9 | | Albert Nijenhuis,
Herbert S. Wilf:
The Enumeration of Connected Graphs and Linked Diagrams.
J. Comb. Theory, Ser. A 27(3): 356-359 (1979) |
| 1978 |
|---|
| 8 | EE | Herbert S. Wilf:
A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane.
J. ACM 25(3): 415-420 (1978) |
| 7 | | Herbert S. Wilf:
Averages by the Sieve Method.
J. Comb. Theory, Ser. A 24(3): 256-260 (1978) |
| 1977 |
|---|
| 6 | | Eugenio Calabi,
Herbert S. Wilf:
On the Sequential and Random Selection of Subspaces over a Finite Field.
J. Comb. Theory, Ser. A 22(1): 107-109 (1977) |
| 5 | EE | Herbert S. Wilf:
A note on P(-lambda; G).
J. Comb. Theory, Ser. B 22(3): 296 (1977) |
| 1975 |
|---|
| 4 | | Joan P. Hutchinson,
Herbert S. Wilf:
On Eulerian Circuits and Words with Prescribed Adjacency Patterns.
J. Comb. Theory, Ser. A 18(1): 80-87 (1975) |
| 3 | | Albert Nijenhuis,
Herbert S. Wilf:
A Method and Two Algorithms on the Theory of Partitions.
J. Comb. Theory, Ser. A 18(2): 219-222 (1975) |
| 1959 |
|---|
| 2 | EE | Herbert S. Wilf:
A Stability Criterion for Numerical Integration.
J. ACM 6(3): 363-365 (1959) |
| 1958 |
|---|
| 1 | | Herbert S. Wilf:
Tables for Automatic Computation.
Commun. ACM 1(1): 8-11 (1958) |
