no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A new measure of presortedness
|
Estivill-Castro, Vladimir |
|
1989 |
83 |
1 |
p. 111-119 9 p. |
article |
2 |
Approximation algorithms for the shortest common superstring problem
|
Turner, Jonathan S. |
|
1989 |
83 |
1 |
p. 1-20 20 p. |
article |
3 |
Automata on infinite objects and their applications to logic and programming
|
Nivat, M. |
|
1989 |
83 |
1 |
p. 41-64 24 p. |
article |
4 |
Coding for write-efficient memory
|
Ahlswede, R. |
|
1989 |
83 |
1 |
p. 80-97 18 p. |
article |
5 |
Editorial Board
|
|
|
1989 |
83 |
1 |
p. i- 1 p. |
article |
6 |
Finding minimal convex nested polygons
|
Aggarwal, Alok |
|
1989 |
83 |
1 |
p. 98-110 13 p. |
article |
7 |
Minimal polynomials for the conjunction of functions on disjoint variables can be very simple
|
Voigt, Bernd |
|
1989 |
83 |
1 |
p. 65-79 15 p. |
article |
8 |
Structure of parallel multipliers for a class of fields GF(2 m )
|
Itoh, Toshiya |
|
1989 |
83 |
1 |
p. 21-40 20 p. |
article |