| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A linear-time algorithm for testing the truth of certain quantified Boolean formulas
|
Aspvall, Bengt
|
|
1982
|
14 |
4 |
p. 195-
1 p.
|
artikel
|
| 2 |
A lower bound for the time to assure interactive consistency
|
Fischer, Michael J.
|
|
1982
|
14 |
4 |
p. 183-186
4 p.
|
artikel
|
| 3 |
An extension to linear resolution with selection function
|
Minker, Jack
|
|
1982
|
14 |
4 |
p. 191-194
4 p.
|
artikel
|
| 4 |
An extension to trees of the Sardinas and Patterson algorithm
|
Franchi-Zannettacci, Paul
|
|
1982
|
14 |
4 |
p. 168-173
6 p.
|
artikel
|
| 5 |
Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort
|
Doberkat, Ernst E.
|
|
1982
|
14 |
4 |
p. 179-182
4 p.
|
artikel
|
| 6 |
Deterministic one-way simulation of two-way real-time cellular automata and its related problems
|
Umeo, Hiroshi
|
|
1982
|
14 |
4 |
p. 158-161
4 p.
|
artikel
|
| 7 |
Evaluation of a hierarchical bit-vector compression technique
|
Jakobsson, M.
|
|
1982
|
14 |
4 |
p. 147-149
3 p.
|
artikel
|
| 8 |
Generalized division for relational algebraic language
|
Demolombe, R.
|
|
1982
|
14 |
4 |
p. 174-178
5 p.
|
artikel
|
| 9 |
Monte Carlo estimation of numerical stability in fast algorithms for systems of bilinear forms
|
Beretta, Giordano
|
|
1982
|
14 |
4 |
p. 162-167
6 p.
|
artikel
|
| 10 |
Multidimensional tries used for associative searching
|
Orenstein, Jack A.
|
|
1982
|
14 |
4 |
p. 150-157
8 p.
|
artikel
|
| 11 |
The complexity of recognizing 3NF relation schemes
|
Jou, Jiann H.
|
|
1982
|
14 |
4 |
p. 187-190
4 p.
|
artikel
|
Tijdschrift beschrijving