nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A deadlock-free communication kernel for loop architecture
|
Pramanik, P. |
|
1991 |
38 |
3 |
p. 157-161 5 p. |
artikel |
2 |
A div(n) depth Boolean circuit for smooth modular inverse
|
Mňuk, Michal |
|
1991 |
38 |
3 |
p. 153-156 4 p. |
artikel |
3 |
A new optimal distributed algorithm for the set intersection problem
|
Rajanarayanan, Subbiah |
|
1991 |
38 |
3 |
p. 143-148 6 p. |
artikel |
4 |
Circuits for computing the GCD of two polynomials over an algebraic number field
|
Langemyr, Lars |
|
1991 |
38 |
3 |
p. 129-134 6 p. |
artikel |
5 |
Computing the minimum Hausdorff distance between two point sets on a line under translation
|
Rote, Günter |
|
1991 |
38 |
3 |
p. 123-127 5 p. |
artikel |
6 |
Counting k-subsets and convex k-gons in the plane
|
Rote, Günter |
|
1991 |
38 |
3 |
p. 149-151 3 p. |
artikel |
7 |
Online matching with blocked input
|
Kao, Ming-Yang |
|
1991 |
38 |
3 |
p. 113-116 4 p. |
artikel |
8 |
On matroids and hierarchial graphs
|
Fernández-Baca, David |
|
1991 |
38 |
3 |
p. 117-121 5 p. |
artikel |
9 |
On the number of linear partitions of the (m, n)-grid
|
Acketa, Dragan M. |
|
1991 |
38 |
3 |
p. 163-168 6 p. |
artikel |
10 |
Self-adjusting multi-way search trees
|
Martel, Charles |
|
1991 |
38 |
3 |
p. 135-141 7 p. |
artikel |