nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A new data structure for shortest path queries in a simple polygon
|
Hershberger, John |
|
1991 |
38 |
5 |
p. 231-235 5 p. |
artikel |
2 |
Bit complexity of matrix products
|
Lingas, Andrzej |
|
1991 |
38 |
5 |
p. 237-242 6 p. |
artikel |
3 |
Computing dominances in En
|
Matoušek, Jiří |
|
1991 |
38 |
5 |
p. 277-278 2 p. |
artikel |
4 |
Lower bounds for rectilinear Steiner trees
|
Snyder, Timothy Law |
|
1991 |
38 |
5 |
p. 279- 1 p. |
artikel |
5 |
On minimizing the sum of k tardiness
|
Woeginger, Gerhard |
|
1991 |
38 |
5 |
p. 253-256 4 p. |
artikel |
6 |
On the complexity of the recognition of parallel 2D-image languages
|
Rytter, W. |
|
1991 |
38 |
5 |
p. 225-229 5 p. |
artikel |
7 |
Parallel asynchronous connected components in a mesh
|
Hambrusch, Susanne |
|
1991 |
38 |
5 |
p. 257-263 7 p. |
artikel |
8 |
Problem of optimizing the number of block accesses in performing relational join is NP-hard
|
Fotouhi, Farshad |
|
1991 |
38 |
5 |
p. 271-275 5 p. |
artikel |
9 |
SLR(k) covering for LR(k) grammars
|
Lee, Myung-Joon |
|
1991 |
38 |
5 |
p. 281- 1 p. |
artikel |
10 |
The FX distribution method for parallel processing of partial match queries
|
Kim, Myoung Ho |
|
1991 |
38 |
5 |
p. 243-252 10 p. |
artikel |
11 |
Towards optimal distributed election on chordal rings
|
Kalamboukis, T.Z. |
|
1991 |
38 |
5 |
p. 265-270 6 p. |
artikel |