Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Wilf, Herbert"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting permutations by their alternating runs
E. Rodney Canfield
,
Herbert S. Wilf
Journal of Combinatorial Theory Series A
115
(2), 2008, pp. 213-225
Some new aspects of the coupon collector's problem
Amy N. Myers
,
Herbert S. Wilf
SIAM Review
48
(3), 2006, pp. 549-565
Some new aspects of the coupon collector's problem
Amy N. Myers
,
Herbert S. Wilf
SIAM Journal on Discrete Mathematics
17
(1), 2003, pp. 1-17
The distributions of the entries of young tableaux
Brendan D. McKay
,
Jennifer Morse
,
Herbert S. Wilf
Journal of Combinatorial Theory Series A
97
(1), 2002, pp. 117-128
Averaging sequences, deranged mappings, and a problem of Lampert and Slater
Neil J. Calkin
,
E. Rodney Canfield
,
Herbert S. Wilf
Journal of Combinatorial Theory Series A
91
(1-2), 2000, pp. 171-190
Accelerated series for universal constants, by the WZ method
Herbert S. Wilf
Discrete Mathematics and Theoretical Computer Science
3
(4), 1999, pp. 155-158
The number of independent sets in a grid graph
Neil J. Calkin
,
Herbert S. Wilf
SIAM Journal on Discrete Mathematics
11
(1), 1998, pp. 54-60
A pentagonal number sieve
Sylvie Corteel
,
Carla D. Savage
,
Herbert S. Wilf
,
Doron Zeilberger
Journal of Combinatorial Theory Series A
82
(2), 1998, pp. 186-192
Counting pairs of lattice paths by intersections
Ira Gessel
,
Wayne Goddard
,
Walter Shur
,
Herbert S. Wilf
,
Lily Yen
Journal of Combinatorial Theory Series A
74
(2), 1996, pp. 173-187
Récents développements et problèmes dans le domaine de la génération aléatoire
Herbert S. Wilf
Theoretical Computer Science
159
(1), 1996, pp. 5-13
Five surprisingly simple complexities
Volker Strehl
,
Herbert S. Wilf
Journal Symbolic Computation
20
(5-6), 1995, pp. 725-729
The computer-aided discovery of a theorem about young tableaux
Herbert S. Wilf
Journal Symbolic Computation
20
(5-6), 1995, pp. 731-735
The asymptotic behavior of the Stirling numbers of the first kind
Herbert S. Wilf
Journal of Combinatorial Theory Series A
64
(2), 1993, pp. 344-349
Ascending subsequences of permutations and the shapes of tableaux
Herbert S. Wilf
Journal of Combinatorial Theory Series A
60
(1), 1992, pp. 155-157
Two algorithms for the sieve method
Herbert S. Wilf
Journal of Algorithms
12
, 1991, pp. 179-182
A bijection for ordered factorizations
Richard Garfield
,
Donald E. Knuth
,
Herbert S. Wilf
Journal of Combinatorial Theory Series A
54
, 1990, pp. 317-318
Bandwidths and profiles of trees
Andrew M. Odlyzko
,
Herbert S. Wilf
Journal of Combinatorial Theory Series B
42
(3), 1987, June, pp. 348-370
The distribution of prefix overlap in consecutive dictionary entries
Rodic Simion
,
Herbert S. Wilf
SIAM Journal on Algebraic Discrete Methods
7
, 1986, pp. 470-475
The number of maximal independent sets in a tree
Herbert S. Wilf
SIAM Journal on Algebraic Discrete Methods
7
, 1986, pp. 125-130
Spectral bounds for the clique and independence numbers of graphs
Herbert S. Wilf
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 113-117
Another probabilistic method in the theory of Young tableaux
Curtis Greene
,
Albert Nijenhuis
,
Herbert S. Wilf
Journal of Combinatorial Theory Series A
37
, 1984, pp. 127-135
Bijective methods in the theory of finite vector spaces
Albert Nijenhuis
,
Anita E. Solow
,
Herbert S. Wilf
Journal of Combinatorial Theory Series A
37
, 1984, pp. 80-84
The random selection of unlabeled graphs
John D. Dixon
,
Herbert S. Wilf
Journal of Algorithms
4
, 1983, pp. 205-213
Sieve equivalence in generalized partition theory
Herbert S. Wilf
Journal of Combinatorial Theory Series A
34
, 1983, pp. 80-89
Three problems in combinatorial asymptotics
Herbert S. Wilf
Journal of Combinatorial Theory Series A
35
, 1983, pp. 199-207
Seiten 1
2
>