nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fast algorithm for computing a longest common increasing subsequence
|
Yang, I-Hsuan |
|
2005 |
93 |
5 |
p. 249-253 5 p. |
artikel |
2 |
Alternators in read/write atomicity
|
Kulkarni, Sandeep S. |
|
2005 |
93 |
5 |
p. 207-215 9 p. |
artikel |
3 |
An improved GA and a novel PSO-GA-based hybrid algorithm
|
Shi, X.H. |
|
2005 |
93 |
5 |
p. 255-261 7 p. |
artikel |
4 |
Approximating the Maximum Agreement Forest on k trees
|
Chataigner, Frédéric |
|
2005 |
93 |
5 |
p. 239-244 6 p. |
artikel |
5 |
A syntactic commutativity format for SOS
|
Mousavi, MohammadReza |
|
2005 |
93 |
5 |
p. 217-223 7 p. |
artikel |
6 |
Board of Editors
|
|
|
2005 |
93 |
5 |
p. CO2- 1 p. |
artikel |
7 |
Fault diameter of Cartesian product graphs
|
Xu, Min |
|
2005 |
93 |
5 |
p. 245-248 4 p. |
artikel |
8 |
Generating anomalous elliptic curves
|
Leprévost, Franck |
|
2005 |
93 |
5 |
p. 225-230 6 p. |
artikel |
9 |
On computing minimum ( s , t ) -cuts in digraphs
|
Nagamochi, Hiroshi |
|
2005 |
93 |
5 |
p. 231-237 7 p. |
artikel |