nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An active attack on protocols for server-aided RSA signature computation
|
Horng, Gwoboa |
|
1998 |
65 |
2 |
p. 71-73 3 p. |
artikel |
2 |
An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
|
Grabner, Peter J. |
|
1998 |
65 |
2 |
p. 89-93 5 p. |
artikel |
3 |
An improved algorithm for retrieving fuzzy information from two systems
|
Ait-Bouziad, Ahmed |
|
1998 |
65 |
2 |
p. 63-66 4 p. |
artikel |
4 |
A note on parallel complexity of maximum f-matching
|
Dessmark, Anders |
|
1998 |
65 |
2 |
p. 107-109 3 p. |
artikel |
5 |
Comparison of signature file models with superimposed coding
|
Dervos, D. |
|
1998 |
65 |
2 |
p. 101-106 6 p. |
artikel |
6 |
Enclosing k points in the smallest axis parallel rectangle
|
Segal, Michael |
|
1998 |
65 |
2 |
p. 95-99 5 p. |
artikel |
7 |
Improved solutions to the Steiner triple covering problem
|
Odijk, Michiel A. |
|
1998 |
65 |
2 |
p. 67-69 3 p. |
artikel |
8 |
Relating bends and size in orthogonal graph drawings
|
Biedl, Therese C. |
|
1998 |
65 |
2 |
p. 111-115 5 p. |
artikel |
9 |
The complexity of scheduling starting time dependent tasks with release times
|
Cheng, T.C.E. |
|
1998 |
65 |
2 |
p. 75-79 5 p. |
artikel |
10 |
The full quotient and its closure property for regular languages
|
Knapik, Teodor |
|
1998 |
65 |
2 |
p. 57-62 6 p. |
artikel |
11 |
The recognition of geodetically connected graphs
|
Chang, Jou-Ming |
|
1998 |
65 |
2 |
p. 81-88 8 p. |
artikel |