nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fast VLSI conversion between binary and residue systems
|
Alia, G. |
|
1984 |
18 |
3 |
p. 141-145 5 p. |
artikel |
2 |
Algebraic approach to p-adic conversion of rational numbers
|
Miola, Alfonso |
|
1984 |
18 |
3 |
p. 167-171 5 p. |
artikel |
3 |
Algorithms for adaptive Huffman codes
|
Cormack, Gordon V. |
|
1984 |
18 |
3 |
p. 159-165 7 p. |
artikel |
4 |
An O(n) algorithm for the linear multiple choice knapsack problem and related problems
|
Zemel, Eitan |
|
1984 |
18 |
3 |
p. 123-128 6 p. |
artikel |
5 |
A note on border rank
|
Lickteig, Thomas |
|
1984 |
18 |
3 |
p. 173-178 6 p. |
artikel |
6 |
A technique for developing loop invariants
|
Remmers, John H. |
|
1984 |
18 |
3 |
p. 137-139 3 p. |
artikel |
7 |
Backtrack: An O(1) expected time algorithm for the graph coloring problem
|
Wilf, Herbert S. |
|
1984 |
18 |
3 |
p. 119-121 3 p. |
artikel |
8 |
Experiments with a fast string searching algorithm
|
Møller-Nielsen, Peter |
|
1984 |
18 |
3 |
p. 129-135 7 p. |
artikel |
9 |
On computing the determinant in small parallel time using a small number of processors
|
Berkowitz, Stuart J. |
|
1984 |
18 |
3 |
p. 147-150 4 p. |
artikel |
10 |
Pattern Matching Machine implementation of a fast test for unique decipherability
|
Apostolico, A. |
|
1984 |
18 |
3 |
p. 155-158 4 p. |
artikel |
11 |
The critical complexity of graph properties
|
Turán, György |
|
1984 |
18 |
3 |
p. 151-153 3 p. |
artikel |