nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An efficient algorithm for cyclic reference counting
|
Lins, Rafael Dueire |
|
2002 |
83 |
3 |
p. 145-150 6 p. |
artikel |
2 |
A note on constructing binary heaps with periodic networks
|
Piotrów, Marek |
|
2002 |
83 |
3 |
p. 129-134 6 p. |
artikel |
3 |
A note on practical construction of maximum bandwidth paths
|
Malpani, Navneet |
|
2002 |
83 |
3 |
p. 175-180 6 p. |
artikel |
4 |
A note on the Consecutive Ones Submatrix problem
|
Hajiaghayi, Mohammad Taghi |
|
2002 |
83 |
3 |
p. 163-166 4 p. |
artikel |
5 |
A speed-up for the commute between subword trees and DAWGs
|
Apostolico, Alberto |
|
2002 |
83 |
3 |
p. 159-161 3 p. |
artikel |
6 |
A two-level temporal logic for evolving specifications
|
Schobbens, P.Y. |
|
2002 |
83 |
3 |
p. 167-172 6 p. |
artikel |
7 |
Coding distributive lattices with Edge Firing Games
|
Latapy, Matthieu |
|
2002 |
83 |
3 |
p. 125-128 4 p. |
artikel |
8 |
Efficient algorithm for transversal of disjoint convex polygons
|
Chin, Francis Y.L. |
|
2002 |
83 |
3 |
p. 141-144 4 p. |
artikel |
9 |
On the stability number of the edge intersection of two graphs
|
Arbib, Claudio |
|
2002 |
83 |
3 |
p. 173-174 2 p. |
artikel |
10 |
Optimal bounded disorder
|
Baeza-Yates, Ricardo A. |
|
2002 |
83 |
3 |
p. 151-157 7 p. |
artikel |
11 |
Walking around fat obstacles
|
Chew, L.Paul |
|
2002 |
83 |
3 |
p. 135-140 6 p. |
artikel |