Herbert S. Wilf

63 papers Journal 61

Year	Rank	Type	Title / Venue / Authors
2011	J	`jnl`	How to lose as little as possible. Ars Math. Contemp. Vittorio Addona, Stan Wagon, Herbert S. Wilf
2011	J	`jnl`	The Distribution of Run Lengths in Integer Compositions. Electron. J. Comb. Herbert S. Wilf
2009	J	`jnl`	Counting Nondecreasing Integer Sequences that Lie Below a Barrier. Electron. J. Comb. Robin Pemantle, Herbert S. Wilf
2008	J	`jnl`	Counting permutations by their alternating runs. J. Comb. Theory A E. Rodney Canfield, Herbert S. Wilf
2008	J	`jnl`	Extreme Palindromes. Am. Math. Mon. Kathy Q. Ji, Herbert S. Wilf
2006	J	`jnl`	BG-Ranks and 2-Cores. Electron. J. Comb. William Y. C. Chen, Kathy Q. Ji, Herbert S. Wilf
2006	J	`jnl`	Pattern avoidance in compositions and multiset permutations. Adv. Appl. Math. Carla D. Savage, Herbert S. Wilf
2006	J	`jnl`	Some New Aspects of the Coupon Collector's Problem. SIAM Rev. Amy N. Myers, Herbert S. Wilf
2005	J	`jnl`	Think Rationally: 11068. Am. Math. Mon. Herbert S. Wilf, Kenneth Schilling
2004	J	`jnl`	An Arc Cotangent Series: 10986. Am. Math. Mon. Herbert S. Wilf, Jan A. Grzesik
2004	J	`jnl`	Problem 11068. Am. Math. Mon. Herbert S. Wilf
2004	J	`jnl`	The Redheffer Matrix of a Partially Ordered Set. Electron. J. Comb. Herbert S. Wilf
2003	J	`jnl`	A Discontinuity in the Distribution of Fixed Point Sums. Electron. J. Comb. Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf
2003	J	`jnl`	Problem 10986. Am. Math. Mon. Herbert S. Wilf
2003	J	`jnl`	Some New Aspects of the Coupon Collector's Problem. SIAM J. Discret. Math. Amy N. Myers, Herbert S. Wilf
2002	—	`book`	Algorithms and complexity (2. ed.). Herbert S. Wilf
2002	J	`jnl`	In Memoriam: Rodica Simion (1955-2000). Adv. Appl. Math. Joseph E. Bonin, Joseph P. S. Kung, Herbert S. Wilf, Doron Zeilberger
2002	J	`jnl`	Longest Increasing Subsequences in Pattern-Restricted Permutations. Electron. J. Comb. Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
2002	J	`jnl`	The Distributions of the Entries of Young Tableaux. J. Comb. Theory A Brendan D. McKay, Jennifer Morse, Herbert S. Wilf
2002	J	`jnl`	The patterns of permutations. Discret. Math. Herbert S. Wilf
2002	J	`jnl`	Waiting for the Bus: 10866. Am. Math. Mon. Jerry Kazdan, Herbert S. Wilf, Darryl K. Nester
2001	J	`jnl`	Problem 10866. Am. Math. Mon. Jerry Kazdan, Herbert S. Wilf
2000	J	`jnl`	Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. J. Comb. Theory A Neil J. Calkin, E. Rodney Canfield, Herbert S. Wilf
2000	J	`jnl`	Recounting the Rationals. Am. Math. Mon. Neil J. Calkin, Herbert S. Wilf
1999	J	`jnl`	Accelerated series for universal constants, by the WZ method. Discret. Math. Theor. Comput. Sci. Herbert S. Wilf
1999	J	`jnl`	On the multiplicity of parts in a random partition. Random Struct. Algorithms Sylvie Corteel, Boris G. Pittel, Carla D. Savage, Herbert S. Wilf
1999	J	`jnl`	Permutation Patterns and Continued Fractions. Electron. J. Comb. Aaron Robertson, Herbert S. Wilf, Doron Zeilberger
1998	J	`jnl`	A Pentagonal Number Sieve. J. Comb. Theory A Sylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger
1998	J	`jnl`	Basis partitions. Discret. Math. Jennifer M. Nolan, Carla D. Savage, Herbert S. Wilf
1998	J	`jnl`	Lattice Walks in Zd and Permutations with No Long Ascending Subsequences. Electron. J. Comb. Ira M. Gessel, Jonathan Weinstein, Herbert S. Wilf
1998	J	`jnl`	The Number of Independent Sets in a Grid Graph. SIAM J. Discret. Math. Neil J. Calkin, Herbert S. Wilf
1997	J	`jnl`	When can the sum of (1/p)th of the binomial coefficients have closed form? Electron. J. Comb. Marko Petkovsek, Herbert S. Wilf
1996	J	`jnl`	A high-tech proof of the Mills-Robbins-Rumsey determinant formula. Electron. J. Comb. Marko Petkovsek, Herbert S. Wilf
1996	J	`jnl`	Counting Pairs of Lattice Paths by Intersections. J. Comb. Theory A Ira M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen
1996	J	`jnl`	Récents développements et problèmes dans le domaine de la génération aléatoire. Theor. Comput. Sci. Herbert S. Wilf
1995	J	`jnl`	Five Surprisingly Simple Complexities. J. Symb. Comput. Volker Strehl, Herbert S. Wilf
1995	J	`jnl`	The Computer-Aided Discovery of a Theorem about Young Tableaux. J. Symb. Comput. Herbert S. Wilf
1995	J	`jnl`	The Problem of the Kings. Electron. J. Comb. Herbert S. Wilf
1994	J	`jnl`	When are subset sums equidistributed modulo m? Electron. J. Comb. Stan Wagon, Herbert S. Wilf
1993	J	`jnl`	The Asymptotic Behavior of the Stirling Numbers of the First Kind. J. Comb. Theory A Herbert S. Wilf
1992	J	`jnl`	Ascending Subsequences of Permutations and the Shapes of Tableaux. J. Comb. Theory A Herbert S. Wilf
1991	J	`jnl`	Two Algorithms for the Sieve Method. J. Algorithms Herbert S. Wilf
1990	J	`jnl`	A bijection for ordered factorizations. J. Comb. Theory A Richard Garfield, Donald E. Knuth, Herbert S. Wilf
1987	J	`jnl`	Bandwidths and profiles of trees. J. Comb. Theory B Andrew M. Odlyzko, Herbert S. Wilf
1986	—	`book`	Algorithms and complexity. Herbert S. Wilf
1986	J	`jnl`	Spectral bounds for the clique and independence numbers of graphs. J. Comb. Theory B Herbert S. Wilf
1985	J	`jnl`	A Theoretical Analysis of Backtracking in the Graph Coloring Problem. J. Algorithms Edward A. Bender, Herbert S. Wilf
1984	J	`jnl`	Another Probabilistic Method in the Theory of Young Tableaux. J. Comb. Theory A Curtis Greene, Albert Nijenhuis, Herbert S. Wilf
1984	J	`jnl`	Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem. Inf. Process. Lett. Herbert S. Wilf
1984	J	`jnl`	Bijective Methods in the Theory of Finite Vector Spaces. J. Comb. Theory A Albert Nijenhuis, Anita E. Solow, Herbert S. Wilf
1983	J	`jnl`	Sieve Equivalence in Generalized Partition Theory. J. Comb. Theory A Herbert S. Wilf
1983	J	`jnl`	The Random Selection of Unlabeled Graphs. J. Algorithms John D. Dixon, Herbert S. Wilf
1983	J	`jnl`	Three Problems in Combinatorial Asymptotics. J. Comb. Theory A Herbert S. Wilf
1981	J	`jnl`	The Uniform Selection of Free Trees. J. Algorithms Herbert S. Wilf
1979	J	`jnl`	The Enumeration of Connected Graphs and Linked Diagrams. J. Comb. Theory A Albert Nijenhuis, Herbert S. Wilf
1978	J	`jnl`	A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane. J. ACM Herbert S. Wilf
1978	J	`jnl`	Averages by the Sieve Method. J. Comb. Theory A Herbert S. Wilf
1977	J	`jnl`	A note on P(-lambda; G). J. Comb. Theory B Herbert S. Wilf
1977	J	`jnl`	On the Sequential and Random Selection of Subspaces over a Finite Field. J. Comb. Theory A Eugenio Calabi, Herbert S. Wilf
1975	J	`jnl`	A Method and Two Algorithms on the Theory of Partitions. J. Comb. Theory A Albert Nijenhuis, Herbert S. Wilf
1975	J	`jnl`	On Eulerian Circuits and Words with Prescribed Adjacency Patterns. J. Comb. Theory A Joan P. Hutchinson, Herbert S. Wilf
1959	J	`jnl`	A Stability Criterion for Numerical Integration. J. ACM Herbert S. Wilf
1958	J	`jnl`	Tables for Automatic Computation. Commun. ACM Herbert S. Wilf