default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHerbert S. Wilf
Person information
- affiliation: University of Pennsylvania, Philadelphia, PA, USA
- award (2002): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j61]Vittorio Addona, Stan Wagon, Herbert S. Wilf:
How to lose as little as possible. Ars Math. Contemp. 4(1): 29-62 (2011)- [j60]Herbert S. Wilf:
The Distribution of Run Lengths in Integer Compositions. Electron. J. Comb. 18(2) (2011)
2000 – 2009
- 2009
- [j59]Robin Pemantle, Herbert S. Wilf:
Counting Nondecreasing Integer Sequences that Lie Below a Barrier. Electron. J. Comb. 16(1) (2009) - 2008
- [j58]E. Rodney Canfield, Herbert S. Wilf:
Counting permutations by their alternating runs. J. Comb. Theory A 115(2): 213-225 (2008) - [j57]Kathy Q. Ji, Herbert S. Wilf:
Extreme Palindromes. Am. Math. Mon. 115(5): 447-451 (2008) - 2006
- [j56]Carla D. Savage, Herbert S. Wilf:
Pattern avoidance in compositions and multiset permutations. Adv. Appl. Math. 36(2): 194-201 (2006) - [j55]William Y. C. Chen, Kathy Q. Ji, Herbert S. Wilf:
BG-Ranks and 2-Cores. Electron. J. Comb. 13(1) (2006) - [j54]Amy N. Myers, Herbert S. Wilf:
Some New Aspects of the Coupon Collector's Problem. SIAM Rev. 48(3): 549-565 (2006) - 2005
- [j53]Herbert S. Wilf, Kenneth Schilling:
Think Rationally: 11068. Am. Math. Mon. 112(9): 844-845 (2005) - 2004
- [j52]Herbert S. Wilf:
The Redheffer Matrix of a Partially Ordered Set. Electron. J. Comb. 11(2) (2004) - [j51]Herbert S. Wilf:
Problem 11068. Am. Math. Mon. 111(3): 259 (2004) - [j50]Herbert S. Wilf, Jan A. Grzesik:
An Arc Cotangent Series: 10986. Am. Math. Mon. 111(7): 632 (2004) - 2003
- [j49]Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf:
A Discontinuity in the Distribution of Fixed Point Sums. Electron. J. Comb. 10 (2003) - [j48]Amy N. Myers, Herbert S. Wilf:
Some New Aspects of the Coupon Collector's Problem. SIAM J. Discret. Math. 17(1): 1-17 (2003) - [j47]Herbert S. Wilf:
Problem 10986. Am. Math. Mon. 110(1): 58 (2003) - 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 - [j46]Joseph E. Bonin, Joseph P. S. Kung, Herbert S. Wilf, Doron Zeilberger:
In Memoriam: Rodica Simion (1955-2000). Adv. Appl. Math. 28(3-4): 279 (2002) - [j45]Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf:
Longest Increasing Subsequences in Pattern-Restricted Permutations. Electron. J. Comb. 9(2) (2002) - [j44]Herbert S. Wilf:
The patterns of permutations. Discret. Math. 257(2-3): 575-583 (2002) - [j43]Brendan D. McKay, Jennifer Morse, Herbert S. Wilf:
The Distributions of the Entries of Young Tableaux. J. Comb. Theory A 97(1): 117-128 (2002) - [j42]Jerry Kazdan, Herbert S. Wilf, Darryl K. Nester:
Waiting for the Bus: 10866. Am. Math. Mon. 109(7): 669 (2002) - 2001
- [j41]Jerry Kazdan, Herbert S. Wilf:
Problem 10866. Am. Math. Mon. 108(4): 371 (2001) - 2000
- [j40]Neil J. Calkin
, E. Rodney Canfield, Herbert S. Wilf:
Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. J. Comb. Theory A 91(1-2): 171-190 (2000) - [j39]Neil J. Calkin, Herbert S. Wilf:
Recounting the Rationals. Am. Math. Mon. 107(4): 360-363 (2000)
1990 – 1999
- 1999
- [j38]Aaron Robertson, Herbert S. Wilf, Doron Zeilberger:
Permutation Patterns and Continued Fractions. Electron. J. Comb. 6 (1999) - [j37]Herbert S. Wilf:
Accelerated series for universal constants, by the WZ method. Discret. Math. Theor. Comput. Sci. 3(4): 189-192 (1999) - [j36]Sylvie Corteel, Boris G. 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. Electron. J. Comb. 5 (1998) - [j34]Jennifer M. Nolan, Carla D. Savage, Herbert S. Wilf:
Basis partitions. Discret. Math. 179(1-3): 277-283 (1998) - [j33]Sylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger:
A Pentagonal Number Sieve. J. Comb. Theory A 82(2): 186-192 (1998) - [j32]Neil J. Calkin, Herbert S. Wilf:
The Number of Independent Sets in a Grid Graph. SIAM J. Discret. 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? Electron. J. Comb. 4(2) (1997) - 1996
- [j30]Marko Petkovsek, Herbert S. Wilf:
A high-tech proof of the Mills-Robbins-Rumsey determinant formula. Electron. 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 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]Herbert S. Wilf:
The Problem of the Kings. Electron. J. Comb. 2 (1995) - [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? Electron. J. Comb. 1 (1994) - 1993
- [j23]Herbert S. Wilf:
The Asymptotic Behavior of the Stirling Numbers of the First Kind. J. Comb. Theory A 64(2): 344-349 (1993) - 1992
- [j22]Herbert S. Wilf:
Ascending Subsequences of Permutations and the Shapes of Tableaux. J. Comb. Theory A 60(1): 155-157 (1992) - 1991
- [j21]Herbert S. Wilf:
Two Algorithms for the Sieve Method. J. Algorithms 12(1): 179-182 (1991) - 1990
- [j20]Richard Garfield, Donald E. Knuth, Herbert S. Wilf:
A bijection for ordered factorizations. J. Comb. Theory A 54(2): 317-318 (1990)
1980 – 1989
- 1987
- [j19]Andrew M. Odlyzko, Herbert S. Wilf:
Bandwidths and profiles of trees. J. Comb. Theory 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 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 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 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 A 34(1): 80-89 (1983) - [j11]Herbert S. Wilf:
Three Problems in Combinatorial Asymptotics. J. Comb. Theory A 35(2): 199-207 (1983) - 1981
- [j10]Herbert S. Wilf:
The Uniform Selection of Free Trees. J. Algorithms 2(2): 204-207 (1981)
1970 – 1979
- 1979
- [j9]Albert Nijenhuis, Herbert S. Wilf:
The Enumeration of Connected Graphs and Linked Diagrams. J. Comb. Theory 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]Herbert S. Wilf:
Averages by the Sieve Method. J. Comb. Theory A 24(3): 256-260 (1978) - 1977
- [j6]Eugenio Calabi, Herbert S. Wilf:
On the Sequential and Random Selection of Subspaces over a Finite Field. J. Comb. Theory A 22(1): 107-109 (1977) - [j5]Herbert S. Wilf:
A note on P(-lambda; G). J. Comb. Theory B 22(3): 296 (1977) - 1975
- [j4]Joan P. Hutchinson, Herbert S. Wilf:
On Eulerian Circuits and Words with Prescribed Adjacency Patterns. J. Comb. Theory 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 A 18(2): 219-222 (1975)
1950 – 1959
- 1959
- [j2]Herbert S. Wilf:
A Stability Criterion for Numerical Integration. J. ACM 6(3): 363-365 (1959) - 1958
- [j1]Herbert S. Wilf:
Tables for Automatic Computation. Commun. ACM 1(1): 8-11 (1958)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
