| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An introduction to randomized algorithms
|
Karp, Richard M.
|
|
1991
|
34 |
1-3 |
p. 165-201
37 p.
|
article
|
| 2 |
Author index
|
|
|
1991
|
34 |
1-3 |
p. 289-290
2 p.
|
article
|
| 3 |
Brick tabloids and the connection matrices between bases of symmetric functions
|
Eg̃eciog̃lu, Ömer
|
|
1991
|
34 |
1-3 |
p. 107-120
14 p.
|
article
|
| 4 |
Computation of the expected number of leaves in a tree having a given automorphism, and related topics
|
Bergeron, F.
|
|
1991
|
34 |
1-3 |
p. 49-66
18 p.
|
article
|
| 5 |
Constructive complexity
|
Abrahamson, Karl
|
|
1991
|
34 |
1-3 |
p. 3-16
14 p.
|
article
|
| 6 |
Editorial Board
|
|
|
1991
|
34 |
1-3 |
p. iii-iv
nvt p.
|
article
|
| 7 |
Generalized flags in finite Abelian p-groups
|
Butler, Lynne M.
|
|
1991
|
34 |
1-3 |
p. 67-81
15 p.
|
article
|
| 8 |
Improved bounds for harmonic-based bin packing algorithms
|
Richey, Michael B.
|
|
1991
|
34 |
1-3 |
p. 203-227
25 p.
|
article
|
| 9 |
Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice
|
Hibi, Takayuki
|
|
1991
|
34 |
1-3 |
p. 145-150
6 p.
|
article
|
| 10 |
Matchings and cycle covers in random digraphs
|
Gimbel, John
|
|
1991
|
34 |
1-3 |
p. 121-128
8 p.
|
article
|
| 11 |
On a unique tree representation for P 4-extendible graphs
|
Jamison, B.
|
|
1991
|
34 |
1-3 |
p. 151-164
14 p.
|
article
|
| 12 |
On doing Todd-Coxeter coset enumeration in parallel
|
Akl, S.
|
|
1991
|
34 |
1-3 |
p. 27-35
9 p.
|
article
|
| 13 |
Preface
|
Simion, Rodica
|
|
1991
|
34 |
1-3 |
p. 1-2
2 p.
|
article
|
| 14 |
q-functional equations and some partition identities
|
Agarwal, A.K.
|
|
1991
|
34 |
1-3 |
p. 17-26
10 p.
|
article
|
| 15 |
Reading list for the capital city conference on combinatorics and theoretical computer science (George Washington University, Washington, DC, May 22–26, 1989)
|
|
|
1991
|
34 |
1-3 |
p. 285-287
3 p.
|
article
|
| 16 |
Semigroup automaton structure by homomorphism and domain partition
|
Greenblatt, Bruce
|
|
1991
|
34 |
1-3 |
p. 129-143
15 p.
|
article
|
| 17 |
Some applications of algebra to combinatorics
|
Stanley, Richard P.
|
|
1991
|
34 |
1-3 |
p. 241-277
37 p.
|
article
|
| 18 |
The Mapmaker's dilemma
|
Beigel, Richard
|
|
1991
|
34 |
1-3 |
p. 37-48
12 p.
|
article
|
| 19 |
The maximum number of winning 2-sets
|
West, Douglas B.
|
|
1991
|
34 |
1-3 |
p. 279-284
6 p.
|
article
|
| 20 |
The Riordan group
|
Shapiro, Louis W.
|
|
1991
|
34 |
1-3 |
p. 229-239
11 p.
|
article
|
| 21 |
Threshold functions for local properties of graphs: triangles
|
Clark, L.H.
|
|
1991
|
34 |
1-3 |
p. 83-105
23 p.
|
article
|
Journal description