nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A new algorithm for testing if a regular language is locally threshold testable
|
Bojańczyk, Mikołaj |
|
2007 |
104 |
3 |
p. 91-94 4 p. |
artikel |
2 |
Editorial Board
|
|
|
2007 |
104 |
3 |
p. IFC- 1 p. |
artikel |
3 |
Improving the arithmetic of elliptic curves in the Jacobi model
|
Duquesne, Sylvain |
|
2007 |
104 |
3 |
p. 101-105 5 p. |
artikel |
4 |
On the k-tuple domination of de Bruijn and Kautz digraphs
|
Araki, Toru |
|
2007 |
104 |
3 |
p. 86-90 5 p. |
artikel |
5 |
On the lexicographical generation of compressed codes
|
Nebel, Markus E. |
|
2007 |
104 |
3 |
p. 95-100 6 p. |
artikel |
6 |
Optimal per-edge processing times in the semi-streaming model
|
Zelke, Mariano |
|
2007 |
104 |
3 |
p. 106-112 7 p. |
artikel |
7 |
Parameterized complexity of the induced subgraph problem in directed graphs
|
Raman, Venkatesh |
|
2007 |
104 |
3 |
p. 79-85 7 p. |
artikel |
8 |
Spanning trees with minimum weighted degrees
|
Ghodsi, Mohammad |
|
2007 |
104 |
3 |
p. 113-116 4 p. |
artikel |