no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A data structure for dynamic trees
|
Sleator, Daniel D. |
|
1983 |
26 |
3 |
p. 362-391 30 p. |
article |
2 |
An asymptotically optimal layout for the shuffle—exchange graph
|
Kleitman, Daniel |
|
1983 |
26 |
3 |
p. 339-361 23 p. |
article |
3 |
Author index for volume 26
|
|
|
1983 |
26 |
3 |
p. 472- 1 p. |
article |
4 |
A view of computability on term algebras
|
Venkataraman, K.N. |
|
1983 |
26 |
3 |
p. 410-471 62 p. |
article |
5 |
Editors' foreword
|
Demillo, Richard |
|
1983 |
26 |
3 |
p. 279- 1 p. |
article |
6 |
Groups, the Theory of ends, and context-free languages
|
Muller, David E. |
|
1983 |
26 |
3 |
p. 295-310 16 p. |
article |
7 |
Lower bounds for the cycle detection problem
|
Fich, Faith E. |
|
1983 |
26 |
3 |
p. 392-409 18 p. |
article |
8 |
Polynomial time computations in models of ET
|
Joseph, Deborah |
|
1983 |
26 |
3 |
p. 311-338 28 p. |
article |
9 |
Time-space-optimal string matching
|
Galil, Zvi |
|
1983 |
26 |
3 |
p. 280-294 15 p. |
article |