nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A new distance metric on strings computable in linear time
|
Ehrenfeucht, A. |
|
1988 |
20 |
3 |
p. 191-203 13 p. |
artikel |
2 |
A unified approach for price directive decomposition procedures in integer programming
|
Holm, Søren |
|
1988 |
20 |
3 |
p. 205-219 15 p. |
artikel |
3 |
Author index
|
|
|
1988 |
20 |
3 |
p. 269-270 2 p. |
artikel |
4 |
Can the catenation of two weakly sparse languages be dense?
|
Yu, Sheng |
|
1988 |
20 |
3 |
p. 265-267 3 p. |
artikel |
5 |
Enumeration of irreducible binary words
|
Kobayashi, Yuji |
|
1988 |
20 |
3 |
p. 221-232 12 p. |
artikel |
6 |
Matching polynomials of two classes of graphs
|
Zhang, Fu-ji |
|
1988 |
20 |
3 |
p. 253-260 8 p. |
artikel |
7 |
Maximal chordal subgraphs
|
Dearing, P.M. |
|
1988 |
20 |
3 |
p. 181-190 10 p. |
artikel |
8 |
Multiprocessor scheduling: combining LPT and MULTIFIT
|
Lee, Chung-Yee |
|
1988 |
20 |
3 |
p. 233-242 10 p. |
artikel |
9 |
On the joint distribution of the insertion path length and the number of comparisons in search trees
|
Mahmoud, Hosam M. |
|
1988 |
20 |
3 |
p. 243-251 9 p. |
artikel |
10 |
Partial information in public key cryptography
|
Vyskoč, Josef |
|
1988 |
20 |
3 |
p. 261-263 3 p. |
artikel |