| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A semantics of sequence diagrams
|
Cho, Seung Mo
|
|
2002
|
84 |
3 |
p. 125-130
6 p.
|
artikel
|
| 2 |
Board of Editors
|
|
|
2002
|
84 |
3 |
p. IFC-
1 p.
|
artikel
|
| 3 |
Efficient generation of plane trees
|
Nakano, Shin-ichi
|
|
2002
|
84 |
3 |
p. 167-172
6 p.
|
artikel
|
| 4 |
Erratum to “Pancyclicity of recursive circulant graphs”
|
Araki, Tom
|
|
2002
|
84 |
3 |
p. 173-
1 p.
|
artikel
|
| 5 |
How to decrypt or even substitute DES-encrypted messages in 228 steps
|
Biham, Eli
|
|
2002
|
84 |
3 |
p. 117-124
8 p.
|
artikel
|
| 6 |
Minimum feedback vertex set and acyclic coloring
|
Fertin, Guillaume
|
|
2002
|
84 |
3 |
p. 131-139
9 p.
|
artikel
|
| 7 |
On the minimal information to encode timestamps in distributed computations
|
Baldoni, Roberto
|
|
2002
|
84 |
3 |
p. 159-166
8 p.
|
artikel
|
| 8 |
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency
|
Kleine Büning, Hans
|
|
2002
|
84 |
3 |
p. 147-151
5 p.
|
artikel
|
| 9 |
Priority algorithms for makespan minimization in the subset model
|
Regev, Oded
|
|
2002
|
84 |
3 |
p. 153-157
5 p.
|
artikel
|
| 10 |
Tight upper bound on the number of edges in a bipartite K 3,3-free or K 5-free graph with an application
|
Chen, Zhi-Zhong
|
|
2002
|
84 |
3 |
p. 141-145
5 p.
|
artikel
|
Tijdschrift beschrijving