Herbert S. Wilf

According to our database, Herbert S. Wilf authored at least 62 papers between 1958 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2011

The Distribution of Run Lengths in Integer Compositions.

Herbert S. Wilf

Electron. J. Comb., 2011

How to lose as little as possible.

Vittorio Addona, Stan Wagon, Herbert S. Wilf

Ars Math. Contemp., 2011

2009

Counting Nondecreasing Integer Sequences that Lie Below a Barrier.

Robin Pemantle, Herbert S. Wilf

Electron. J. Comb., 2009

2008

Extreme Palindromes.

Kathy Q. Ji, Herbert S. Wilf

Am. Math. Mon., 2008

Counting permutations by their alternating runs.

E. Rodney Canfield, Herbert S. Wilf

J. Comb. Theory A, 2008

2006

Some New Aspects of the Coupon Collector's Problem.

Amy N. Myers, Herbert S. Wilf

SIAM Rev., 2006

BG-Ranks and 2-Cores.

William Y. C. Chen, Kathy Q. Ji, Herbert S. Wilf

Electron. J. Comb., 2006

Pattern avoidance in compositions and multiset permutations.

Carla D. Savage, Herbert S. Wilf

Adv. Appl. Math., 2006

2005

Think Rationally: 11068.

Herbert S. Wilf, Kenneth Schilling

Am. Math. Mon., 2005

2004

An Arc Cotangent Series: 10986.

Herbert S. Wilf, Jan A. Grzesik

Am. Math. Mon., 2004

Problem 11068.

Herbert S. Wilf

Am. Math. Mon., 2004

The Redheffer Matrix of a Partially Ordered Set.

Herbert S. Wilf

Electron. J. Comb., 2004

2003

Problem 10986.

Herbert S. Wilf

Am. Math. Mon., 2003

A Discontinuity in the Distribution of Fixed Point Sums.

Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf

Electron. J. Comb., 2003

2002

Waiting for the Bus: 10866.

Jerry Kazdan, Herbert S. Wilf, Darryl K. Nester

Am. Math. Mon., 2002

The Distributions of the Entries of Young Tableaux.

Brendan D. McKay, Jennifer Morse, Herbert S. Wilf

J. Comb. Theory A, 2002

The patterns of permutations.

Herbert S. Wilf

Discret. Math., 2002

Longest Increasing Subsequences in Pattern-Restricted Permutations.

Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf

Electron. J. Comb., 2002

In Memoriam: Rodica Simion (1955-2000).

Joseph E. Bonin, Joseph P. S. Kung, Herbert S. Wilf, Doron Zeilberger

Adv. Appl. Math., 2002

Algorithms and complexity (2. ed.).

Herbert S. Wilf

A K Peters, ISBN: 978-1-56881-178-9, 2002

2001

Problem 10866.

Jerry Kazdan, Herbert S. Wilf

Am. Math. Mon., 2001

2000

Recounting the Rationals.

Neil J. Calkin, Herbert S. Wilf

Am. Math. Mon., 2000

Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater.

Neil J. Calkin, E. Rodney Canfield, Herbert S. Wilf

J. Comb. Theory A, 2000

1999

On the multiplicity of parts in a random partition.

Sylvie Corteel, Boris G. Pittel, Carla D. Savage, Herbert S. Wilf

Random Struct. Algorithms, 1999

Accelerated series for universal constants, by the WZ method.

Herbert S. Wilf

Discret. Math. Theor. Comput. Sci., 1999

Permutation Patterns and Continued Fractions.

Aaron Robertson, Herbert S. Wilf, Doron Zeilberger

Electron. J. Comb., 1999

1998

The Number of Independent Sets in a Grid Graph.

Neil J. Calkin, Herbert S. Wilf

SIAM J. Discret. Math., 1998

A Pentagonal Number Sieve.

Sylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger

J. Comb. Theory A, 1998

Basis partitions.

Jennifer M. Nolan, Carla D. Savage, Herbert S. Wilf

Discret. Math., 1998

Lattice Walks in Zd and Permutations with No Long Ascending Subsequences.

Ira M. Gessel, Jonathan Weinstein, Herbert S. Wilf

Electron. J. Comb., 1998

1997

When can the sum of (1/p)th of the binomial coefficients have closed form?

Marko Petkovsek, Herbert S. Wilf

Electron. J. Comb., 1997

1996

Récents développements et problèmes dans le domaine de la génération aléatoire.

Herbert S. Wilf

Theor. Comput. Sci., 1996

Counting Pairs of Lattice Paths by Intersections.

Ira M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen

J. Comb. Theory A, 1996

A high-tech proof of the Mills-Robbins-Rumsey determinant formula.

Marko Petkovsek, Herbert S. Wilf

Electron. J. Comb., 1996

1995

The Computer-Aided Discovery of a Theorem about Young Tableaux.

Herbert S. Wilf

J. Symb. Comput., 1995

Five Surprisingly Simple Complexities.

Volker Strehl, Herbert S. Wilf

J. Symb. Comput., 1995

The Problem of the Kings.

Herbert S. Wilf

Electron. J. Comb., 1995

1994

When are subset sums equidistributed modulo m?

Stan Wagon, Herbert S. Wilf

Electron. J. Comb., 1994

1993

The Asymptotic Behavior of the Stirling Numbers of the First Kind.

Herbert S. Wilf

J. Comb. Theory A, 1993

1992

Ascending Subsequences of Permutations and the Shapes of Tableaux.

Herbert S. Wilf

J. Comb. Theory A, 1992

1991

Two Algorithms for the Sieve Method.

Herbert S. Wilf

J. Algorithms, 1991

1990

A bijection for ordered factorizations.

Richard Garfield, Donald E. Knuth, Herbert S. Wilf

J. Comb. Theory A, 1990

1987

Bandwidths and profiles of trees.

Andrew M. Odlyzko, Herbert S. Wilf

J. Comb. Theory B, 1987

1986

Spectral bounds for the clique and independence numbers of graphs.

Herbert S. Wilf

J. Comb. Theory B, 1986

Algorithms and complexity.

Herbert S. Wilf

Prentice Hall, ISBN: 978-0-13-021973-2, 1986

1985

A Theoretical Analysis of Backtracking in the Graph Coloring Problem.

Edward A. Bender, Herbert S. Wilf

J. Algorithms, 1985

1984

Bijective Methods in the Theory of Finite Vector Spaces.

Albert Nijenhuis, Anita E. Solow, Herbert S. Wilf

J. Comb. Theory A, 1984

Another Probabilistic Method in the Theory of Young Tableaux.

Curtis Greene, Albert Nijenhuis, Herbert S. Wilf

J. Comb. Theory A, 1984

Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem.

Herbert S. Wilf

Inf. Process. Lett., 1984

1983

Sieve Equivalence in Generalized Partition Theory.

Herbert S. Wilf

J. Comb. Theory A, 1983

Three Problems in Combinatorial Asymptotics.

Herbert S. Wilf

J. Comb. Theory A, 1983

The Random Selection of Unlabeled Graphs.

John D. Dixon, Herbert S. Wilf

J. Algorithms, 1983

1981

The Uniform Selection of Free Trees.

Herbert S. Wilf

J. Algorithms, 1981

1979

The Enumeration of Connected Graphs and Linked Diagrams.

Albert Nijenhuis, Herbert S. Wilf

J. Comb. Theory A, 1979

1978

Averages by the Sieve Method.

Herbert S. Wilf

J. Comb. Theory A, 1978

A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane.

Herbert S. Wilf

J. ACM, 1978

1977

A note on P(-lambda; G).

Herbert S. Wilf

J. Comb. Theory B, 1977

On the Sequential and Random Selection of Subspaces over a Finite Field.

Eugenio Calabi, Herbert S. Wilf

J. Comb. Theory A, 1977

1975

A Method and Two Algorithms on the Theory of Partitions.

Albert Nijenhuis, Herbert S. Wilf

J. Comb. Theory A, 1975

On Eulerian Circuits and Words with Prescribed Adjacency Patterns.

Joan P. Hutchinson, Herbert S. Wilf

J. Comb. Theory A, 1975

1959

A Stability Criterion for Numerical Integration.

Herbert S. Wilf

J. ACM, 1959

1958

Tables for Automatic Computation.

Herbert S. Wilf

Commun. ACM, 1958