nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A closure property of deterministic context-free languages
|
Choffrut, C. |
|
1981 |
12 |
1 |
p. 13-16 4 p. |
artikel |
2 |
Addendum
|
|
|
1981 |
12 |
1 |
p. 54- 1 p. |
artikel |
3 |
A family of codes commutatively equivalent to prefix codes
|
Mauceri, S. |
|
1981 |
12 |
1 |
p. 1-4 4 p. |
artikel |
4 |
A linear-time recognition algorithm for interval dags
|
Gabow, Harold N. |
|
1981 |
12 |
1 |
p. 20-22 3 p. |
artikel |
5 |
An algorithm for finding clique cut-sets
|
Whitesides, S.H. |
|
1981 |
12 |
1 |
p. 31-32 2 p. |
artikel |
6 |
An upper bound on the number of execution nodes for a distributed join
|
Ceri, S. |
|
1981 |
12 |
1 |
p. 46-48 3 p. |
artikel |
7 |
BOARD OF EDITORS
|
|
|
1981 |
12 |
1 |
p. ii- 1 p. |
artikel |
8 |
Bunch theory: A simple set theory for computer science
|
Hehner, Eric C.R. |
|
1981 |
12 |
1 |
p. 26-30 5 p. |
artikel |
9 |
Coffman-Graham scheduling of UET task systems with 0–1 resources
|
Lloyd, Errol L. |
|
1981 |
12 |
1 |
p. 40-45 6 p. |
artikel |
10 |
Master keys for group sharing
|
Denning, Dorothy E. |
|
1981 |
12 |
1 |
p. 23-25 3 p. |
artikel |
11 |
On a stable minimum storage merging algorithm
|
Dudzińki, Kreysztof |
|
1981 |
12 |
1 |
p. 5-8 4 p. |
artikel |
12 |
On generalized matching problems
|
Hell, P. |
|
1981 |
12 |
1 |
p. 33-35 3 p. |
artikel |
13 |
Scheduling periodically occurring tasks on multiple processors
|
Lawler, Eugene L. |
|
1981 |
12 |
1 |
p. 9-12 4 p. |
artikel |
14 |
Solving combinatorial search problems by intelligent backtracking
|
Bruynooghe, Maurice |
|
1981 |
12 |
1 |
p. 36-39 4 p. |
artikel |
15 |
Some principles for dynamizing decomposable searching problems
|
Overmars, Mark H. |
|
1981 |
12 |
1 |
p. 49-53 5 p. |
artikel |
16 |
The numerical instability of Bini's algorithm
|
Tsao, Nai-kuan |
|
1981 |
12 |
1 |
p. 17-19 3 p. |
artikel |