According to our database
1,
Herbert S. Wilf
authored at least 62 papers
between 1958 and 2011.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2011
The Distribution of Run Lengths in Integer Compositions.
Electron. J. Comb., 2011
How to lose as little as possible.
Ars Math. Contemp., 2011
2009
Counting Nondecreasing Integer Sequences that Lie Below a Barrier.
Electron. J. Comb., 2009
2008
Counting permutations by their alternating runs.
J. Comb. Theory, Ser. A, 2008
2006
Pattern avoidance in compositions and multiset permutations.
Adv. Appl. Math., 2006
2005
2004
An Arc Cotangent Series: 10986.
Am. Math. Mon., 2004
The Redheffer Matrix of a Partially Ordered Set.
Electron. J. Comb., 2004
2003
Some New Aspects of the Coupon Collector's Problem.
SIAM J. Discret. Math., 2003
A Discontinuity in the Distribution of Fixed Point Sums.
Electron. J. Comb., 2003
2002
Waiting for the Bus: 10866.
Am. Math. Mon., 2002
The Distributions of the Entries of Young Tableaux.
J. Comb. Theory, Ser. A, 2002
The patterns of permutations.
Discret. Math., 2002
Longest Increasing Subsequences in Pattern-Restricted Permutations.
Electron. J. Comb., 2002
In Memoriam: Rodica Simion (1955-2000).
Adv. Appl. Math., 2002
Algorithms and complexity (2. ed.).
A K Peters, ISBN: 978-1-56881-178-9, 2002
2001
2000
Recounting the Rationals.
Am. Math. Mon., 2000
Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater.
J. Comb. Theory, Ser. A, 2000
1999
On the multiplicity of parts in a random partition.
Random Struct. Algorithms, 1999
Accelerated series for universal constants, by the WZ method.
Discret. Math. Theor. Comput. Sci., 1999
Permutation Patterns and Continued Fractions.
Electron. J. Comb., 1999
1998
The Number of Independent Sets in a Grid Graph.
SIAM J. Discret. Math., 1998
A Pentagonal Number Sieve.
J. Comb. Theory, Ser. A, 1998
Lattice Walks in Zd and Permutations with No Long Ascending Subsequences.
Electron. J. Comb., 1998
1997
When can the sum of (1/p)th of the binomial coefficients have closed form?
Electron. J. Comb., 1997
1996
Récents développements et problèmes dans le domaine de la génération aléatoire.
Theor. Comput. Sci., 1996
Counting Pairs of Lattice Paths by Intersections.
J. Comb. Theory, Ser. A, 1996
A high-tech proof of the Mills-Robbins-Rumsey determinant formula.
Electron. J. Comb., 1996
1995
The Computer-Aided Discovery of a Theorem about Young Tableaux.
J. Symb. Comput., 1995
Five Surprisingly Simple Complexities.
J. Symb. Comput., 1995
The Problem of the Kings.
Electron. J. Comb., 1995
1994
When are subset sums equidistributed modulo m?
Electron. J. Comb., 1994
1993
The Asymptotic Behavior of the Stirling Numbers of the First Kind.
J. Comb. Theory, Ser. A, 1993
1992
Ascending Subsequences of Permutations and the Shapes of Tableaux.
J. Comb. Theory, Ser. A, 1992
1991
Two Algorithms for the Sieve Method.
J. Algorithms, 1991
1990
A bijection for ordered factorizations.
J. Comb. Theory, Ser. A, 1990
1987
Bandwidths and profiles of trees.
J. Comb. Theory, Ser. B, 1987
1986
Spectral bounds for the clique and independence numbers of graphs.
J. Comb. Theory, Ser. B, 1986
Algorithms and complexity.
Prentice Hall, ISBN: 978-0-13-021973-2, 1986
1985
A Theoretical Analysis of Backtracking in the Graph Coloring Problem.
J. Algorithms, 1985
1984
Bijective Methods in the Theory of Finite Vector Spaces.
J. Comb. Theory, Ser. A, 1984
Another Probabilistic Method in the Theory of Young Tableaux.
J. Comb. Theory, Ser. A, 1984
Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem.
Inf. Process. Lett., 1984
1983
Sieve Equivalence in Generalized Partition Theory.
J. Comb. Theory, Ser. A, 1983
Three Problems in Combinatorial Asymptotics.
J. Comb. Theory, Ser. A, 1983
The Random Selection of Unlabeled Graphs.
J. Algorithms, 1983
1981
The Uniform Selection of Free Trees.
J. Algorithms, 1981
1979
The Enumeration of Connected Graphs and Linked Diagrams.
J. Comb. Theory, Ser. A, 1979
1978
Averages by the Sieve Method.
J. Comb. Theory, Ser. A, 1978
A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane.
J. ACM, 1978
1977
J. Comb. Theory, Ser. B, 1977
On the Sequential and Random Selection of Subspaces over a Finite Field.
J. Comb. Theory, Ser. A, 1977
1975
A Method and Two Algorithms on the Theory of Partitions.
J. Comb. Theory, Ser. A, 1975
On Eulerian Circuits and Words with Prescribed Adjacency Patterns.
J. Comb. Theory, Ser. A, 1975
1959
A Stability Criterion for Numerical Integration.
J. ACM, 1959
1958
Tables for Automatic Computation.
Commun. ACM, 1958
