Herbert S. Wilf - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 63 from 63

2011

How to lose as little as possibleVittorio Addona, Stan Wagon, Herbert S. Wilf. arsmc, 4(1):29-62, 2011. [doi]

The Distribution of Run Lengths in Integer CompositionsHerbert S. Wilf. combinatorics, 18(2), 2011. [doi]

2009

Counting Nondecreasing Integer Sequences that Lie Below a BarrierRobin Pemantle, Herbert S. Wilf. combinatorics, 16(1), 2009. [doi]

2008

Counting permutations by their alternating runsE. Rodney Canfield, Herbert S. Wilf. JCT, 115(2):213-225, 2008. [doi]

Extreme PalindromesKathy Q. Ji, Herbert S. Wilf. tamm, 115(5):447-451, 2008. [doi]

2006

BG-Ranks and 2-CoresWilliam Y. C. Chen, Kathy Q. Ji, Herbert S. Wilf. combinatorics, 13(1), 2006. [doi]

Some New Aspects of the Coupon Collector's ProblemAmy N. Myers, Herbert S. Wilf. siamrev, 48(3):549-565, 2006. [doi]

Pattern avoidance in compositions and multiset permutationsCarla D. Savage, Herbert S. Wilf. aam, 36(2):194-201, 2006. [doi]

2005

Think Rationally: 11068Herbert S. Wilf, Kenneth Schilling. tamm, 112(9):844-845, 2005. [doi]

2004

Problem 11068Herbert S. Wilf. tamm, 111(3):259, 2004. [doi]

The Redheffer Matrix of a Partially Ordered SetHerbert S. Wilf. combinatorics, 11(2), 2004. [doi]

An Arc Cotangent Series: 10986Herbert S. Wilf, J. A. Grzesik. tamm, 111(7):632, 2004. [doi]

2003

A Discontinuity in the Distribution of Fixed Point SumsEdward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf. combinatorics, 10, 2003. [doi]

Some New Aspects of the Coupon Collector s ProblemAmy N. Myers, Herbert S. Wilf. siamdm, 17(1):1-17, 2003. [doi]

Problem 10986Herbert S. Wilf. tamm, 110(1):58, 2003. [doi]

2002

In Memoriam: Rodica Simion (1955-2000)Joseph E. Bonin, Joseph P. S. Kung, Herbert S. Wilf, Doron Zeilberger. aam, 28(3-4):279, 2002. [doi]

Longest Increasing Subsequences in Pattern-Restricted PermutationsEmeric Deutsch, A. J. Hildebrand, Herbert S. Wilf. combinatorics, on(2), 2002. [doi]

Waiting for the Bus: 10866Jerry Kazdan, Herbert S. Wilf, Darryl K. Nester. tamm, 109(7):669, 2002. [doi]

The Distributions of the Entries of Young TableauxBrendan D. McKay, Jennifer Morse, Herbert S. Wilf. JCT, 97(1):117-128, 2002. [doi]

The patterns of permutationsHerbert S. Wilf. DM, 257(2-3):575-583, 2002. [doi]

Algorithms and complexity (2. ed.)Herbert S. Wilf. A K Peters, 2002.

2001

Problem 10866Jerry Kazdan, Herbert S. Wilf. tamm, 108(4):371, 2001. [doi]

2000

Averaging Sequences, Deranged Mappings, and a Problem of Lampert and SlaterNeil J. Calkin, E. Rodney Canfield, Herbert S. Wilf. JCT, 91(1-2):171-190, 2000. [doi]

Recounting the RationalsNeil J. Calkin, Herbert S. Wilf. tamm, 107(4):360-363, 2000. [doi]

1999

On the multiplicity of parts in a random partitionSylvie Corteel, Boris Pittel, Carla D. Savage, Herbert S. Wilf. rsa, 14(2):185-197, 1999.

Permutation Patterns and Continued FractionsAaron Robertson, Herbert S. Wilf, Doron Zeilberger. combinatorics, 6, 1999. [doi]

Accelerated series for universal constants, by the WZ methodHerbert S. Wilf. dmtcs, 3(4):189-192, 1999. [doi]

1998

The Number of Independent Sets in a Grid GraphNeil J. Calkin, Herbert S. Wilf. siamdm, 11(1):54-60, 1998. [doi]

A Pentagonal Number SieveSylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger. JCT, 82(2):186-192, 1998. [doi]

Lattice Walks in Zd and Permutations with No Long Ascending SubsequencesIra M. Gessel, Jonathan Weinstein, Herbert S. Wilf. combinatorics, 5, 1998. [doi]

Basis partitionsJennifer M. Nolan, Carla D. Savage, Herbert S. Wilf. DM, 179(1-3):277-283, 1998. [doi]

1997

When can the sum of (1/p)th of the binomial coefficients have closed form?Marko Petkovsek, Herbert S. Wilf. combinatorics, 4(2), 1997. [doi]

1996

Counting Pairs of Lattice Paths by IntersectionsIra M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen. JCT, 74(2):173-187, 1996. [doi]

A high-tech proof of the Mills-Robbins-Rumsey determinant formulaMarko Petkovsek, Herbert S. Wilf. combinatorics, 3(2), 1996. [doi]

Récents développements et problèmes dans le domaine de la génération aléatoireHerbert S. Wilf. TCS, 159(1):5-13, 1996. [doi]

1995

Five Surprisingly Simple ComplexitiesVolker Strehl, Herbert S. Wilf. JSC, 20(5/6):725-729, 1995.

The Problem of the KingsHerbert S. Wilf. combinatorics, 2, 1995. [doi]

The Computer-Aided Discovery of a Theorem about Young TableauxHerbert S. Wilf. JSC, 20(5/6):731-735, 1995.

1994

When are subset sums equidistributed modulo m?Stan Wagon, Herbert S. Wilf. combinatorics, 1, 1994. [doi]

1993

The Asymptotic Behavior of the Stirling Numbers of the First KindHerbert S. Wilf. JCT, 64(2):344-349, 1993.

1992

Ascending Subsequences of Permutations and the Shapes of TableauxHerbert S. Wilf. JCT, 60(1):155-157, 1992.

1991

Two Algorithms for the Sieve MethodHerbert S. Wilf. jal, 12(1):179-182, 1991.

1990

A bijection for ordered factorizationsRichard Garfield, Donald E. Knuth, Herbert S. Wilf. JCT, 54(2):317-318, 1990. [doi]

1987

Bandwidths and profiles of treesAndrew M. Odlyzko, Herbert S. Wilf. JCT, 42(3):348-370, 1987. [doi]

1986

Spectral bounds for the clique and independence numbers of graphsHerbert S. Wilf. JCT, 40(1):113-117, 1986. [doi]

Algorithms and complexityHerbert S. Wilf. Prentice Hall, 1986.

1985

A Theoretical Analysis of Backtracking in the Graph Coloring ProblemEdward A. Bender, Herbert S. Wilf. jal, 6(2):275-282, 1985.

1984

Another Probabilistic Method in the Theory of Young TableauxCurtis Greene, Albert Nijenhuis, Herbert S. Wilf. JCT, 37(2):127-135, 1984.

Bijective Methods in the Theory of Finite Vector SpacesAlbert Nijenhuis, Anita E. Solow, Herbert S. Wilf. JCT, 37(1):80-84, 1984.

Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring ProblemHerbert S. Wilf. ipl, 18(3):119-121, 1984.

1983

The Random Selection of Unlabeled GraphsJohn D. Dixon, Herbert S. Wilf. jal, 4(3):205-213, 1983.

Three Problems in Combinatorial AsymptoticsHerbert S. Wilf. JCT, 35(2):199-207, 1983.

Sieve Equivalence in Generalized Partition TheoryHerbert S. Wilf. JCT, 34(1):80-89, 1983.

1981

The Uniform Selection of Free TreesHerbert S. Wilf. jal, 2(2):204-207, 1981.

1979

The Enumeration of Connected Graphs and Linked DiagramsAlbert Nijenhuis, Herbert S. Wilf. JCT, 27(3):356-359, 1979.

1978

Averages by the Sieve MethodHerbert S. Wilf. JCT, 24(3):256-260, 1978.

A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex PlaneHerbert S. Wilf. JACM, 25(3):415-420, 1978. [doi]

1977

On the Sequential and Random Selection of Subspaces over a Finite FieldEugenio Calabi, Herbert S. Wilf. JCT, 22(1):107-109, 1977.

A note on P(-lambda; G)Herbert S. Wilf. JCT, 22(3):296, 1977. [doi]

1975

On Eulerian Circuits and Words with Prescribed Adjacency PatternsJoan P. Hutchinson, Herbert S. Wilf. JCT, 18(1):80-87, 1975.

A Method and Two Algorithms on the Theory of PartitionsAlbert Nijenhuis, Herbert S. Wilf. JCT, 18(2):219-222, 1975.

1959

A Stability Criterion for Numerical IntegrationHerbert S. Wilf. JACM, 6(3):363-365, 1959. [doi]

1958

Tables for Automatic ComputationHerbert S. Wilf. CACM, 1(1):8-11, 1958.

Sign in or sign up to see more results.

runs on WebDSL