The following pages link to Herbert S. Wilf (Q648415):
Displayed 50 items.
- The distribution of run lengths in integer compositions (Q648416) (← links)
- A class of linear differential difference equations (Q773222) (← links)
- Backtrack: An O(1) expected time algorithm for the graph coloring problem (Q794430) (← links)
- Bijective methods in the theory of finite vector spaces (Q794645) (← links)
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)'') multisum/integral identities (Q811594) (← links)
- BG-ranks and 2-cores (Q870043) (← links)
- A bijection for ordered factorizations (Q914675) (← links)
- A short proof of Darboux's lemma (Q920228) (← links)
- Left-to-right maxima in words and multiset permutations (Q948881) (← links)
- Counting nondecreasing integer sequences that Lie below a barrier (Q1028841) (← links)
- Three problems in combinatorial asymptotics (Q1050342) (← links)
- Bandwidths and profiles of trees (Q1073038) (← links)
- Spectral bounds for the clique and independence numbers of graphs (Q1079582) (← links)
- Periodicities of partition functions and Stirling numbers modulo \(p\) (Q1085193) (← links)
- (Q1131142) (redirect page) (← links)
- The radius of univalence of certain entire functions (Q1131143) (← links)
- The enumeration of connected graphs and linked diagrams (Q1132893) (← links)
- Ascending subsequences of permutations and the shapes of tableaux (Q1186121) (← links)
- The distribution of the binomial coefficients modulo \(p\) (Q1187808) (← links)
- On Eulerian circuits and words with prescribed adjacency patterns (Q1213887) (← links)
- A method and two algorithms on the theory of partitions (Q1214419) (← links)
- On the sequential and random selection of subspaces over a finite field (Q1236529) (← links)
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects (Q1236548) (← links)
- A note on \(P(-\lambda;G)\) (Q1243734) (← links)
- Averages by the sieve method (Q1250815) (← links)
- A probabilistic proof of a formula for the number of Young tableaux of a given shape (Q1254319) (← links)
- A pentagonal number sieve (Q1268625) (← links)
- The number-theoretic content of the Jacobi triple product identity (Q1290735) (← links)
- Permutation patterns and continued fractions (Q1307018) (← links)
- The asymptotic behavior of the Stirling numbers of the first kind (Q1318373) (← links)
- On the coefficients in the Hardy-Ramanujan-Rademacher formula for \(p(n)\) (Q1345288) (← links)
- When are subset sums equidistributed modulo \(m\)? (Q1346722) (← links)
- The problem of the kings (Q1346737) (← links)
- Recent developments and problems in the domain of random generation (Q1351205) (← links)
- Basis partitions (Q1377732) (← links)
- When can the sum of \((1/p)\)th of the binomial coefficients have closed form (Q1378546) (← links)
- Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences (Q1379124) (← links)
- Identically distributed pairs of partition statistics (Q1580543) (← links)
- Averaging sequences, deranged mappings, and a problem of Lampert and Slater (Q1584653) (← links)
- The distributions of the entries of Young tableaux (Q1604574) (← links)
- The combinatorics of a three-line circulant determinant (Q1766468) (← links)
- The Redheffer matrix of a partially ordered set (Q1773154) (← links)
- Irreducible compositions and the first return to the origin of a random walk (Q1778038) (← links)
- Sieve equivalence in generalized partition theory (Q1835671) (← links)
- The patterns of permutations (Q1850035) (← links)
- Longest increasing subsequences in pattern-restricted permutations (Q1871367) (← links)
- A discontinuity in the distribution of fixed point sums (Q1871379) (← links)
- Counting pairs of lattice paths by intersections (Q1914007) (← links)
- Five surprisingly simple complexities (Q1918488) (← links)
- The computer-aided discovery of a theorem about Young tableaux (Q1918489) (← links)