nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A linear space algorithm for computing a longest common increasing subsequence
|
Sakai, Yoshifumi |
|
2006 |
99 |
5 |
p. 203-207 5 p. |
artikel |
2 |
Binary codes for locally homogeneous sequences
|
Moffat, Alistair |
|
2006 |
99 |
5 |
p. 175-180 6 p. |
artikel |
3 |
Boundedness undecidability for synchronized nets
|
Devillers, Raymond |
|
2006 |
99 |
5 |
p. 208-214 7 p. |
artikel |
4 |
Editorial Board
|
|
|
2006 |
99 |
5 |
p. CO2- 1 p. |
artikel |
5 |
Improved algorithm for finding next-to-shortest paths
|
Li, Shisheng |
|
2006 |
99 |
5 |
p. 192-194 3 p. |
artikel |
6 |
Minimum implicational basis for ∧-semidistributive lattices
|
Janssen, Philippe |
|
2006 |
99 |
5 |
p. 199-202 4 p. |
artikel |
7 |
On Quickselect, partial sorting and Multiple Quickselect
|
Kuba, Markus |
|
2006 |
99 |
5 |
p. 181-186 6 p. |
artikel |
8 |
On the multi-radius cover problem
|
Mestre, Julián |
|
2006 |
99 |
5 |
p. 195-198 4 p. |
artikel |
9 |
Real time scheduling with a budget: Parametric-search is better than binary search
|
Levin, Asaf |
|
2006 |
99 |
5 |
p. 187-191 5 p. |
artikel |
10 |
Tetravex is NP-complete
|
Takenaga, Yasuhiko |
|
2006 |
99 |
5 |
p. 171-174 4 p. |
artikel |