| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Acyclic domination on bipartite permutation graphs
|
Xu, Guangjun
|
|
2006
|
99 |
4 |
p. 139-144
6 p.
|
artikel
|
| 2 |
Analysis of improved signcryption scheme with key privacy
|
Tan, Chik How
|
|
2006
|
99 |
4 |
p. 135-138
4 p.
|
artikel
|
| 3 |
A new approximation algorithm for labeling points with circle pairs
|
Jiang, Minghui
|
|
2006
|
99 |
4 |
p. 125-129
5 p.
|
artikel
|
| 4 |
Editorial Board
|
|
|
2006
|
99 |
4 |
p. CO2-
1 p.
|
artikel
|
| 5 |
Fast generators for the Diffie–Hellman key agreement protocol and malicious standards
|
Tsaban, Boaz
|
|
2006
|
99 |
4 |
p. 145-148
4 p.
|
artikel
|
| 6 |
Finding and counting cliques and independent sets in r-uniform hypergraphs
|
Yuster, Raphael
|
|
2006
|
99 |
4 |
p. 130-134
5 p.
|
artikel
|
| 7 |
Improved constructions of secret sharing schemes by applying ( λ , ω ) -decompositions
|
van Dijk, Marten
|
|
2006
|
99 |
4 |
p. 154-157
4 p.
|
artikel
|
| 8 |
On obtaining the Boyer–Moore string-matching algorithm by partial evaluation
|
Danvy, Olivier
|
|
2006
|
99 |
4 |
p. 158-162
5 p.
|
artikel
|
| 9 |
Strong normalization proofs by CPS-translations
|
Ikeda, Satoshi
|
|
2006
|
99 |
4 |
p. 163-170
8 p.
|
artikel
|
| 10 |
The communication complexity of the Hamming distance problem
|
Huang, Wei
|
|
2006
|
99 |
4 |
p. 149-153
5 p.
|
artikel
|
Tijdschrift beschrijving