nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on the inapproximability of correlation clustering
|
Tan, Jinsong |
|
2008 |
108 |
5 |
p. 331-335 5 p. |
artikel |
2 |
A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL
|
Lange, Martin |
|
2008 |
108 |
5 |
p. 308-312 5 p. |
artikel |
3 |
Editorial Board
|
|
|
2008 |
108 |
5 |
p. IFC- 1 p. |
artikel |
4 |
Embedding a family of meshes into twisted cubes
|
Lai, Chia-Jui |
|
2008 |
108 |
5 |
p. 326-330 5 p. |
artikel |
5 |
Fault-free cycles in folded hypercubes with more faulty elements
|
Fu, Jung-Sheng |
|
2008 |
108 |
5 |
p. 261-263 3 p. |
artikel |
6 |
Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
|
Hyyrö, Heikki |
|
2008 |
108 |
5 |
p. 313-319 7 p. |
artikel |
7 |
Murg term rewrite systems
|
Vágvölgyi, Sándor |
|
2008 |
108 |
5 |
p. 264-272 9 p. |
artikel |
8 |
On induced-universal graphs for the class of bounded-degree graphs
|
Esperet, Louis |
|
2008 |
108 |
5 |
p. 255-260 6 p. |
artikel |
9 |
On the period of the Naor–Reingold sequence
|
Ibeas Martín, Álvar |
|
2008 |
108 |
5 |
p. 304-307 4 p. |
artikel |
10 |
On the security of public key cryptosystems with a double decryption mechanism
|
Galindo, David |
|
2008 |
108 |
5 |
p. 279-283 5 p. |
artikel |
11 |
Optimal prefix and suffix queries on texts
|
Crochemore, Maxime |
|
2008 |
108 |
5 |
p. 320-325 6 p. |
artikel |
12 |
Space efficient and time optimal distributed BFS tree construction
|
Boulinier, Christian |
|
2008 |
108 |
5 |
p. 273-278 6 p. |
artikel |
13 |
Square-free partial words
|
Halava, Vesa |
|
2008 |
108 |
5 |
p. 290-292 3 p. |
artikel |
14 |
The equational theory of prebisimilarity over basic CCS with divergence
|
Aceto, Luca |
|
2008 |
108 |
5 |
p. 284-289 6 p. |
artikel |
15 |
The problem of the moody chess players
|
van de Bult, Fokko J. |
|
2008 |
108 |
5 |
p. 336-337 2 p. |
artikel |
16 |
Turing degrees of reals of positive effective packing dimension
|
Downey, Rod |
|
2008 |
108 |
5 |
p. 298-303 6 p. |
artikel |
17 |
Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees
|
Bhattacharyya, Bishnu |
|
2008 |
108 |
5 |
p. 293-297 5 p. |
artikel |