nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A lower bound for permutation routing on two-dimensional bused meshes
|
Cheung, S. |
|
1993 |
45 |
5 |
p. 225-228 4 p. |
artikel |
2 |
A simple algorithm for enumerating longest distances in the plane
|
Dickerson, Matthew T. |
|
1993 |
45 |
5 |
p. 269-274 6 p. |
artikel |
3 |
Doubly lexical ordering of dense 0–1 matrices
|
Spinrad, Jeremy P. |
|
1993 |
45 |
5 |
p. 229-235 7 p. |
artikel |
4 |
On binary search trees
|
De Prisco, Roberto |
|
1993 |
45 |
5 |
p. 249-253 5 p. |
artikel |
5 |
On the maximum length of Huffman codes
|
Buro, Michael |
|
1993 |
45 |
5 |
p. 219-223 5 p. |
artikel |
6 |
Parallelizing Mallat algorithm for 2-D wavelet transforms
|
Lu, Jian |
|
1993 |
45 |
5 |
p. 255-259 5 p. |
artikel |
7 |
Quasi-boolean equivalence
|
Bijlsma, A. |
|
1993 |
45 |
5 |
p. 243-247 5 p. |
artikel |
8 |
Satisfiability of the smallest binary program
|
Hanschke, Philipp |
|
1993 |
45 |
5 |
p. 237-241 5 p. |
artikel |
9 |
The all-pairs quickest path problem
|
Lee, D.T. |
|
1993 |
45 |
5 |
p. 261-267 7 p. |
artikel |