nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A completed hierarchy of true concurrent equivalences
|
Fecher, Harald |
|
2004 |
89 |
5 |
p. 261-265 5 p. |
artikel |
2 |
A Kleene theorem for splitable signals
|
Durand-Lose, Jérôme |
|
2004 |
89 |
5 |
p. 237-245 9 p. |
artikel |
3 |
A linear-time algorithm to compute a MAD tree of an interval graph
|
Dahlhaus, Elias |
|
2004 |
89 |
5 |
p. 255-259 5 p. |
artikel |
4 |
Approximation algorithms for a hierarchically structured bin packing problem
|
Codenotti, Bruno |
|
2004 |
89 |
5 |
p. 215-221 7 p. |
artikel |
5 |
A simple recognition of maximal planar graphs
|
Nagamochi, Hiroshi |
|
2004 |
89 |
5 |
p. 223-226 4 p. |
artikel |
6 |
Board of Editors
|
|
|
2004 |
89 |
5 |
p. IFC- 1 p. |
artikel |
7 |
On the hardness of approximating label-cover
|
Dinur, Irit |
|
2004 |
89 |
5 |
p. 247-254 8 p. |
artikel |
8 |
Ready, Set, Go! The Voronoi diagram of moving points that start from a line
|
Koltun, Vladlen |
|
2004 |
89 |
5 |
p. 233-235 3 p. |
artikel |
9 |
Universal forgery on a group signature scheme using self-certified public keys
|
Wang, Guilin |
|
2004 |
89 |
5 |
p. 227-231 5 p. |
artikel |