| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An analytical evidence for Kalé's heuristic for the N queens problem
|
Oh, Sang Bong
|
|
1993
|
46 |
1 |
p. 51-54
4 p.
|
artikel
|
| 2 |
Complexity measures for concurrent programs based on information-theoretic metrics
|
Cha, Shin
|
|
1993
|
46 |
1 |
p. 43-50
8 p.
|
artikel
|
| 3 |
Editorial Board
|
|
|
1993
|
46 |
1 |
p. ii-
1 p.
|
artikel
|
| 4 |
Generational cyclic reference counting
|
Lins, Rafael D.
|
|
1993
|
46 |
1 |
p. 19-20
2 p.
|
artikel
|
| 5 |
Σ0 n -complete properties of programs and Martin-Löf randomness
|
Kobayashi, Kojiro
|
|
1993
|
46 |
1 |
p. 37-42
6 p.
|
artikel
|
| 6 |
New binary sequences with perfect staircase profile of linear complexity
|
Yang, Yi Xian
|
|
1993
|
46 |
1 |
p. 27-29
3 p.
|
artikel
|
| 7 |
Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors
|
Vaidyanathan, Ramachandran
|
|
1993
|
46 |
1 |
p. 31-36
6 p.
|
artikel
|
| 8 |
Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs
|
Yu, Ming-Shing
|
|
1993
|
46 |
1 |
p. 7-11
5 p.
|
artikel
|
| 9 |
Systolic partitioning algorithms
|
Megson, G.M.
|
|
1993
|
46 |
1 |
p. 13-18
6 p.
|
artikel
|
| 10 |
The edge Hamiltonian path problem is NP-complete for bipartite graphs
|
Lai, Ten-Hwang
|
|
1993
|
46 |
1 |
p. 21-26
6 p.
|
artikel
|
| 11 |
The towers of Hanoi problem with cyclic parallel moves
|
Wu, Jer-Shyan
|
|
1993
|
46 |
1 |
p. 1-6
6 p.
|
artikel
|
Tijdschrift beschrijving