nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on an improved bisection algorithm
|
Bui, T. |
|
1980 |
10 |
1 |
p. 35-36 2 p. |
artikel |
2 |
A note on universal classes of hash functions
|
Sarwate, Dilip V. |
|
1980 |
10 |
1 |
p. 41-45 5 p. |
artikel |
3 |
A space efficient algorithm for the monotone planar circuit value problem
|
Goldschlager, Leslie M. |
|
1980 |
10 |
1 |
p. 25-27 3 p. |
artikel |
4 |
A 2.5 times optimal algorithm for packing in two dimensions
|
Sleator, Daniel D.K.D.B. |
|
1980 |
10 |
1 |
p. 37-40 4 p. |
artikel |
5 |
Conflict-free access of arrays — a counter example
|
Deb, Ashoke |
|
1980 |
10 |
1 |
p. 20- 1 p. |
artikel |
6 |
Editorial Board
|
|
|
1980 |
10 |
1 |
p. ii- 1 p. |
artikel |
7 |
Finding linear and circular sequences of minimal and maximal total adjacency
|
Rayward-Smith, V.J. |
|
1980 |
10 |
1 |
p. 9-13 5 p. |
artikel |
8 |
List scheduling bounds for uet systems with resources
|
Lloyd, Errol L. |
|
1980 |
10 |
1 |
p. 28-31 4 p. |
artikel |
9 |
Mixed transitivity for functional and multivalued dependencies in database relations
|
Zaniolo, Carlo |
|
1980 |
10 |
1 |
p. 32-34 3 p. |
artikel |
10 |
Once more on storage for consecutive retrieval
|
Truszczyński, Mirosław |
|
1980 |
10 |
1 |
p. 21-24 4 p. |
artikel |
11 |
On the relationship between son-trees and symmetric binary b-trees
|
Olivié, H. |
|
1980 |
10 |
1 |
p. 4-8 5 p. |
artikel |
12 |
Testing the universal instance assumption
|
Honeyman, Peter |
|
1980 |
10 |
1 |
p. 14-19 6 p. |
artikel |
13 |
The denotational semantics of sequential machines
|
Gordon, Michael J.C. |
|
1980 |
10 |
1 |
p. 1-3 3 p. |
artikel |