| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A fast algortihm for finding all shortest paths
|
Watanabe, Osamu
|
|
1981
|
13 |
1 |
p. 1-3
3 p.
|
artikel
|
| 2 |
An approach to the problems of routing optimization in the regions of intricate shape
|
Stoyan, Yu.G.
|
|
1981
|
13 |
1 |
p. 39-43
5 p.
|
artikel
|
| 3 |
A new class of C.F.L. for which the equivalence is decidable
|
Senizergues, G.
|
|
1981
|
13 |
1 |
p. 30-34
5 p.
|
artikel
|
| 4 |
Constructing full spanning trees for cubic graphs
|
Storer, James A.
|
|
1981
|
13 |
1 |
p. 8-11
4 p.
|
artikel
|
| 5 |
Degrees of constancy in programming languages
|
Gunn, Hamish I.E.
|
|
1981
|
13 |
1 |
p. 35-38
4 p.
|
artikel
|
| 6 |
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
|
Ibarra, Oscar H.
|
|
1981
|
13 |
1 |
p. 12-15
4 p.
|
artikel
|
| 7 |
Editorial Board
|
|
|
1981
|
13 |
1 |
p. IFC-
1 p.
|
artikel
|
| 8 |
Expected complexity of fast search with uniformly distributed data
|
Lewis, Gilbert N.
|
|
1981
|
13 |
1 |
p. 4-7
4 p.
|
artikel
|
| 9 |
Greedy binary search trees are nearly optimal
|
Korsh, James F.
|
|
1981
|
13 |
1 |
p. 16-19
4 p.
|
artikel
|
| 10 |
Hardware address translation for machines with a large virtual memory
|
Kamamohanarao, K.
|
|
1981
|
13 |
1 |
p. 23-29
7 p.
|
artikel
|
| 11 |
On the optimality of semidynamic routing schemes
|
Agrawala, Ashok K.
|
|
1981
|
13 |
1 |
p. 20-22
3 p.
|
artikel
|
Tijdschrift beschrijving