UB Paderborn / Katalog / Suche / in CDI

An algorithmic proof theory for hypergeometric (ordinary and q') multisum/integral identities

Inventiones mathematicae, 1992-12, Vol.108 (3), p.575-633

1992

Link zum Volltext

Verfügbarkeit prüfen

The number of independent sets in a grid graph

SIAM journal on discrete mathematics, 1998-02, Vol.11 (1), p.54-60

1998

Link zum Volltext

Verfügbarkeit prüfen

Spectral bounds for the clique and independence numbers of graphs

Journal of combinatorial theory. Series B, 1986-02, Vol.40 (1), p.113-117

Wilf, Herbert S

1986

Link zum Volltext

Verfügbarkeit prüfen

The patterns of permutations

Discrete mathematics, 2002-11, Vol.257 (2), p.575-583

Wilf, Herbert S.

2002

Link zum Volltext

Verfügbarkeit prüfen

The asymptotic behavior of the stirling numbers of the first kind

Journal of combinatorial theory. Series A, 1993-11, Vol.64 (2), p.344-349

Wilf, Herbert S

1993

Link zum Volltext

Verfügbarkeit prüfen

The number of maximal independent sets in a tree

SIAM journal on algebraic and discrete methods, 1986, Vol.7 (1), p.125-130

WILF, H. S

1986

Link zum Volltext

Verfügbarkeit prüfen

Ascending subsequences of permutations and Young tableaux

Advances in applied probability, 1992-12, Vol.24 (4), p.772-773

Wilf, H. S.

1992

Link zum Volltext

Verfügbarkeit prüfen

Combinatorial Algorithms: For Computers and Calculators

2, 1978

Link zum Volltext

Verfügbarkeit prüfen

Ascending subsequences of permutations and the shapes of tableaux

Journal of combinatorial theory. Series A, 1992-05, Vol.60 (1), p.155-157

Wilf, Herbert S

1992

Link zum Volltext

Verfügbarkeit prüfen

Backtrack: An O(1) expected time algorithm for the graph coloring problem

Information processing letters, 1984-03, Vol.18 (3), p.119-121

Wilf, Herbert S.

1984

Link zum Volltext

Verfügbarkeit prüfen

Functional iteration and the Josephus problem

Glasgow mathematical journal, 1991-05, Vol.33 (2), p.235-240

1991

Link zum Volltext

Verfügbarkeit prüfen

Strings, substrings, and the «nearest integer» function

The American mathematical monthly, 1987-11, Vol.94 (9), p.855-860

WILF, H. S

1987

Link zum Volltext

Verfügbarkeit prüfen

Pattern avoidance in compositions and multiset permutations

Advances in applied mathematics, 2006-02, Vol.36 (2), p.194-201

2006

Link zum Volltext

Verfügbarkeit prüfen

The Redheffer Matrix of a Partially Ordered Set

The Electronic journal of combinatorics, 2004-11, Vol.11 (2)

Wilf, Herbert S.

2004

Link zum Volltext

Verfügbarkeit prüfen

The Eigenvalues of a Graph and Its Chromatic Number

Journal of the London Mathematical Society, 1967, Vol.s1-42 (1), p.330-332

Wilf, H. S.

1967

Link zum Volltext

Verfügbarkeit prüfen

Recounting the Rationals

The American mathematical monthly, 2000-04, Vol.107 (4), p.360

2000

Link zum Volltext

Verfügbarkeit prüfen

Periodicities of partition functions and stirling numbers modulo p

Journal of number theory, 1987-03, Vol.25 (3), p.308-312

1987

Link zum Volltext

Verfügbarkeit prüfen

Another probabilistic method in the theory of young tableaux

Journal of combinatorial theory. Series A, 1984-01, Vol.37 (2), p.127-135

1984

Link zum Volltext

Verfügbarkeit prüfen

A bijection for ordered factorizations

Journal of combinatorial theory. Series A, 1990-07, Vol.54 (2), p.317-318

1990

Link zum Volltext

Verfügbarkeit prüfen

Some new aspects of the coupon collector's problem

SIAM journal on discrete mathematics, 2003-01, Vol.17 (1), p.1-17

2003

Link zum Volltext

Verfügbarkeit prüfen

A theoretical analysis of backtracking in the graph coloring problem

Journal of algorithms, 1985-01, Vol.6 (2), p.275-282

1985

Link zum Volltext

Verfügbarkeit prüfen

The combinatorics of a three-line circulant determinant

Israel journal of mathematics, 2004-01, Vol.143 (1), p.141-156

2004

Link zum Volltext

Verfügbarkeit prüfen

Bijective methods in the theory of finite vector spaces

Journal of combinatorial theory. Series A, 1984-01, Vol.37 (1), p.80-84

1984

Link zum Volltext

Verfügbarkeit prüfen

The random selection of unlabeled graphs

Journal of algorithms, 1983-01, Vol.4 (3), p.205-213

1983

Link zum Volltext

Verfügbarkeit prüfen

Concerning the Theory of Control Sheets

Nuclear science and engineering, 1959-02, Vol.5 (2), p.137-138

Wilf, H. S.

1959

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

An algorithmic proof theory for hypergeometric (ordinary and q') multisum/integral identities

The number of independent sets in a grid graph

Spectral bounds for the clique and independence numbers of graphs

The patterns of permutations

The asymptotic behavior of the stirling numbers of the first kind

The number of maximal independent sets in a tree

Ascending subsequences of permutations and Young tableaux

Combinatorial Algorithms: For Computers and Calculators

Ascending subsequences of permutations and the shapes of tableaux

Backtrack: An O(1) expected time algorithm for the graph coloring problem

Functional iteration and the Josephus problem

Strings, substrings, and the «nearest integer» function

Pattern avoidance in compositions and multiset permutations

The Redheffer Matrix of a Partially Ordered Set

The Eigenvalues of a Graph and Its Chromatic Number

Recounting the Rationals

Periodicities of partition functions and stirling numbers modulo p

Another probabilistic method in the theory of young tableaux

A bijection for ordered factorizations

Some new aspects of the coupon collector's problem

A theoretical analysis of backtracking in the graph coloring problem

The combinatorics of a three-line circulant determinant

Bijective methods in the theory of finite vector spaces

The random selection of unlabeled graphs

Concerning the Theory of Control Sheets

Suchergebnisse filtern