Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Herbert S. Wilf
2010 – today
- 2011
[j56]Herbert S. Wilf: The Distribution of Run Lengths in Integer Compositions. Electr. J. Comb. 18(2) (2011)
2000 – 2009
- 2009
- [j55]Robin Pemantle, Herbert S. Wilf: Counting Nondecreasing Integer Sequences that Lie Below a Barrier. Electr. J. Comb. 16(1) (2009)
- 2008
- [j54]E. Rodney Canfield, Herbert S. Wilf: Counting permutations by their alternating runs. J. Comb. Theory, Ser. A 115(2): 213-225 (2008)
- [j53]Kathy Q. Ji, Herbert S. Wilf: Extreme Palindromes. The American Mathematical Monthly 115(5): 447-451 (2008)
- 2006
- [j52]William Y. C. Chen, Kathy Q. Ji, Herbert S. Wilf: BG-Ranks and 2-Cores. Electr. J. Comb. 13(1) (2006)
- 2005
- [j51]Herbert S. Wilf, Kenneth Schilling: Think Rationally: 11068. The American Mathematical Monthly 112(9): 844-845 (2005)
- 2004
- [j50]
- [j49]
- [j48]Herbert S. Wilf, J. A. Grzesik: An Arc Cotangent Series: 10986. The American Mathematical Monthly 111(7): 632 (2004)
- 2003
- [j47]Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf: A Discontinuity in the Distribution of Fixed Point Sums. Electr. J. Comb. 10 (2003)
- [j46]Amy N. Myers, Herbert S. Wilf: Some New Aspects of the Coupon Collector's Problem. SIAM J. Discrete Math. 17(1): 1-17 (2003)
- [j45]
- 2002
- [b2]Herbert S. Wilf: Algorithms and complexity (2. ed.). A K Peters 2002, ISBN 978-1-56881-178-9, pp. I-IX, 1-219
- [j44]Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf: Longest Increasing Subsequences in Pattern-Restricted Permutations. Electr. J. Comb. on(2) (2002)
- [j43]
- [j42]Brendan D. McKay, Jennifer Morse, Herbert S. Wilf: The Distributions of the Entries of Young Tableaux. J. Comb. Theory, Ser. A 97(1): 117-128 (2002)
- [j41]Jerry Kazdan, Herbert S. Wilf, Darryl K. Nester: Waiting for the Bus: 10866. The American Mathematical Monthly 109(7): 669 (2002)
- 2001
- [j40]
- 2000
- [j39]Neil J. Calkin, E. Rodney Canfield, Herbert S. Wilf: Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. J. Comb. Theory, Ser. A 91(1-2): 171-190 (2000)
1990 – 1999
- 1999
- [j38]Aaron Robertson, Herbert S. Wilf, Doron Zeilberger: Permutation Patterns and Continued Fractions. Electr. J. Comb. 6 (1999)
- [j37]Herbert S. Wilf: Accelerated series for universal constants, by the WZ method. Discrete Mathematics & Theoretical Computer Science 3(4): 189-192 (1999)
- [j36]Sylvie Corteel, Boris Pittel, Carla D. Savage, Herbert S. Wilf: On the multiplicity of parts in a random partition. Random Struct. Algorithms 14(2): 185-197 (1999)
- 1998
- [j35]Ira M. Gessel, Jonathan Weinstein, Herbert S. Wilf: Lattice Walks in Zd and Permutations with No Long Ascending Subsequences. Electr. J. Comb. 5 (1998)
- [j34]Jennifer M. Nolan, Carla D. Savage, Herbert S. Wilf: Basis partitions. Discrete Mathematics 179(1-3): 277-283 (1998)
- [j33]Sylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger: A Pentagonal Number Sieve. J. Comb. Theory, Ser. A 82(2): 186-192 (1998)
- [j32]Neil J. Calkin, Herbert S. Wilf: The Number of Independent Sets in a Grid Graph. SIAM J. Discrete Math. 11(1): 54-60 (1998)
- 1997
- [j31]Marko Petkovsek, Herbert S. Wilf: When can the sum of (1/p)th of the binomial coefficients have closed form? Electr. J. Comb. 4(2) (1997)
- 1996
- [j30]Marko Petkovsek, Herbert S. Wilf: A high-tech proof of the Mills-Robbins-Rumsey determinant formula. Electr. J. Comb. 3(2) (1996)
- [j29]Ira M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen: Counting Pairs of Lattice Paths by Intersections. J. Comb. Theory, Ser. A 74(2): 173-187 (1996)
- [j28]Herbert S. Wilf: Récents développements et problèmes dans le domaine de la génération aléatoire. Theor. Comput. Sci. 159(1): 5-13 (1996)
- 1995
- [j27]
- [j26]Volker Strehl, Herbert S. Wilf: Five Surprisingly Simple Complexities. J. Symb. Comput. 20(5/6): 725-729 (1995)
- [j25]Herbert S. Wilf: The Computer-Aided Discovery of a Theorem about Young Tableaux. J. Symb. Comput. 20(5/6): 731-735 (1995)
- 1994
- [j24]Stan Wagon, Herbert S. Wilf: When are subset sums equidistributed modulo m? Electr. J. Comb. 1 (1994)
- 1993
- [j23]Herbert S. Wilf: The Asymptotic Behavior of the Stirling Numbers of the First Kind. J. Comb. Theory, Ser. A 64(2): 344-349 (1993)
- 1992
- [j22]Herbert S. Wilf: Ascending Subsequences of Permutations and the Shapes of Tableaux. J. Comb. Theory, Ser. A 60(1): 155-157 (1992)
- 1991
- [j21]
- 1990
- [j20]Richard Garfield, Donald E. Knuth, Herbert S. Wilf: A bijection for ordered factorizations. J. Comb. Theory, Ser. A 54(2): 317-318 (1990)
1980 – 1989
- 1987
- [j19]Andrew M. Odlyzko, Herbert S. Wilf: Bandwidths and profiles of trees. J. Comb. Theory, Ser. B 42(3): 348-370 (1987)
- 1986
- [b1]Herbert S. Wilf: Algorithms and complexity. Prentice Hall 1986, ISBN 978-0-13-021973-2, pp. I-VI, 1-231
- [j18]Herbert S. Wilf: Spectral bounds for the clique and independence numbers of graphs. J. Comb. Theory, Ser. B 40(1): 113-117 (1986)
- 1985
- [j17]Edward A. Bender, Herbert S. Wilf: A Theoretical Analysis of Backtracking in the Graph Coloring Problem. J. Algorithms 6(2): 275-282 (1985)
- 1984
- [j16]Herbert S. Wilf: Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem. Inf. Process. Lett. 18(3): 119-121 (1984)
- [j15]Albert Nijenhuis, Anita E. Solow, Herbert S. Wilf: Bijective Methods in the Theory of Finite Vector Spaces. J. Comb. Theory, Ser. A 37(1): 80-84 (1984)
- [j14]Curtis Greene, Albert Nijenhuis, Herbert S. Wilf: Another Probabilistic Method in the Theory of Young Tableaux. J. Comb. Theory, Ser. A 37(2): 127-135 (1984)
- 1983
- [j13]John D. Dixon, Herbert S. Wilf: The Random Selection of Unlabeled Graphs. J. Algorithms 4(3): 205-213 (1983)
- [j12]Herbert S. Wilf: Sieve Equivalence in Generalized Partition Theory. J. Comb. Theory, Ser. A 34(1): 80-89 (1983)
- [j11]Herbert S. Wilf: Three Problems in Combinatorial Asymptotics. J. Comb. Theory, Ser. A 35(2): 199-207 (1983)
- 1981
- [j10]
1970 – 1979
- 1979
- [j9]Albert Nijenhuis, Herbert S. Wilf: The Enumeration of Connected Graphs and Linked Diagrams. J. Comb. Theory, Ser. A 27(3): 356-359 (1979)
- 1978
- [j8]Herbert S. Wilf: A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane. J. ACM 25(3): 415-420 (1978)
- [j7]
- 1977
- [j6]Eugenio Calabi, Herbert S. Wilf: On the Sequential and Random Selection of Subspaces over a Finite Field. J. Comb. Theory, Ser. A 22(1): 107-109 (1977)
- [j5]
- 1975
- [j4]Joan P. Hutchinson, Herbert S. Wilf: On Eulerian Circuits and Words with Prescribed Adjacency Patterns. J. Comb. Theory, Ser. A 18(1): 80-87 (1975)
- [j3]Albert Nijenhuis, Herbert S. Wilf: A Method and Two Algorithms on the Theory of Partitions. J. Comb. Theory, Ser. A 18(2): 219-222 (1975)
1950 – 1959
- 1959
- [j2]
- 1958
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-19 19:28 CEST by the dblp team