no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Approximate algorithms for the knapsack problem on parallel computers
|
Gopalakrishnan, P.S. |
|
1991 |
91 |
2 |
p. 155-171 17 p. |
article |
2 |
Author index for volume 91
|
|
|
1991 |
91 |
2 |
p. 274- 1 p. |
article |
3 |
Computing the order of centralizers in linear groups
|
Rónyai, Lajos |
|
1991 |
91 |
2 |
p. 172-176 5 p. |
article |
4 |
Connectivity vs. reachability
|
Chrobak, M. |
|
1991 |
91 |
2 |
p. 177-188 12 p. |
article |
5 |
Parallel random access machines with bounded memory wordsize
|
Bellantoni, Stephen J. |
|
1991 |
91 |
2 |
p. 259-273 15 p. |
article |
6 |
Simultaneity is harder than agreement
|
Coan, Brian A. |
|
1991 |
91 |
2 |
p. 205-231 27 p. |
article |
7 |
Telescopic mappings in typed lambda calculus
|
de Bruijn, N.G. |
|
1991 |
91 |
2 |
p. 189-204 16 p. |
article |
8 |
Using information systems to solve recursive domain equations
|
Larsen, Kim Guldstrand |
|
1991 |
91 |
2 |
p. 232-258 27 p. |
article |