nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Additive weights of a special class of nonuniformly distributed backtrack trees
|
Trier, Uwe |
|
1992 |
42 |
2 |
p. 67-76 10 p. |
artikel |
2 |
A LISP programming exercise
|
Van De Snepscheut, Jan L.A. |
|
1992 |
42 |
2 |
p. 103-108 6 p. |
artikel |
3 |
An almost-constant round interactive zero-knowledge proof
|
Burmester, Mike |
|
1992 |
42 |
2 |
p. 81-87 7 p. |
artikel |
4 |
An optimal algorithm for reconstructing a binary tree
|
Kamakoti, V. |
|
1992 |
42 |
2 |
p. 113-115 3 p. |
artikel |
5 |
A note on the reconstruction of a binary tree from its traversals
|
Gabrani, Naveen |
|
1992 |
42 |
2 |
p. 117-119 3 p. |
artikel |
6 |
Batch checking with applications to linear functions
|
Rubinfeld, Ronitt |
|
1992 |
42 |
2 |
p. 77-80 4 p. |
artikel |
7 |
Detecting embedded Horn structure in propositional logic
|
Chandru, V. |
|
1992 |
42 |
2 |
p. 109-111 3 p. |
artikel |
8 |
Optimal total exchange for a 3-D torus of processors
|
Plateau, Brigitte |
|
1992 |
42 |
2 |
p. 95-102 8 p. |
artikel |
9 |
Scheduling real-time computations with separation constraints
|
Han, Ching-Chih |
|
1992 |
42 |
2 |
p. 61-66 6 p. |
artikel |
10 |
The parallel complexity of coarsest set partition problems
|
Cho, Sang |
|
1992 |
42 |
2 |
p. 89-94 6 p. |
artikel |