| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An adversary-based lower bound for sorting
|
Atallah, Mikhail J.
|
|
1981
|
13 |
2 |
p. 55-57
3 p.
|
article
|
| 2 |
A note on ‘is shortest path problem not harder than matrix multiplication?’
|
Moran, Shlomo
|
|
1981
|
13 |
2 |
p. 85-86
2 p.
|
article
|
| 3 |
A shared-memory scheme for coalesced hashing
|
Vitter, Jeffrey Scott
|
|
1981
|
13 |
2 |
p. 77-79
3 p.
|
article
|
| 4 |
Author's reply to S. Moran's note on the shortest path problem
|
Romani, Francesco
|
|
1981
|
13 |
2 |
p. 87-
1 p.
|
article
|
| 5 |
NTS grammars and church–rosser systems
|
Book, Ronald V.
|
|
1981
|
13 |
2 |
p. 73-76
4 p.
|
article
|
| 6 |
On the average height of trees in digital search and dynamic hashing
|
Regnier, Mireille
|
|
1981
|
13 |
2 |
p. 64-66
3 p.
|
article
|
| 7 |
Optimal choice of discriminators in a balanced k-d binary search tree
|
Silva Filho, Ysmar V.
|
|
1981
|
13 |
2 |
p. 67-70
4 p.
|
article
|
| 8 |
Real-time queue operations in pure LISP
|
Hood, Robert
|
|
1981
|
13 |
2 |
p. 50-54
5 p.
|
article
|
| 9 |
Some remarks on one-pebble rectangular array acceptors
|
Nakamura, Akira
|
|
1981
|
13 |
2 |
p. 80-84
5 p.
|
article
|
| 10 |
The dynamic simulation of recursive and stack manipulating programs
|
Rytter, Wojciech
|
|
1981
|
13 |
2 |
p. 58-63
6 p.
|
article
|
| 11 |
The inclusion of DOL in multi-reset
|
Clerbout, Mireille
|
|
1981
|
13 |
2 |
p. 45-47
3 p.
|
article
|
| 12 |
The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities
|
Pan, V.Ya.
|
|
1981
|
13 |
2 |
p. 71-72
2 p.
|
article
|
| 13 |
Using duality for the synthesis of an optimal algorithm involving matrix multiplication
|
Makarov, O.M.
|
|
1981
|
13 |
2 |
p. 48-49
2 p.
|
article
|
Journal description