| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A note on Presburger arithmetic with array segments, permutation and equality
|
Rosier, Louis E.
|
|
1986
|
22 |
1 |
p. 33-35
3 p.
|
artikel
|
| 2 |
Editorial Board
|
|
|
1986
|
22 |
1 |
p. IFC-
1 p.
|
artikel
|
| 3 |
Every iterated morphism yields a co-CFL
|
Berstel, Jean
|
|
1986
|
22 |
1 |
p. 7-9
3 p.
|
artikel
|
| 4 |
Hexagonal unit network—A tool for proving the NP-completeness results of geometric problems
|
Kr̆ivánek, Mirko
|
|
1986
|
22 |
1 |
p. 37-41
5 p.
|
artikel
|
| 5 |
Linear programming in O(n × 3d2 ) time
|
Clarkson, Kenneth L.
|
|
1986
|
22 |
1 |
p. 21-24
4 p.
|
artikel
|
| 6 |
On termination and phase changes in the presence of unreliable communication
|
Baumgarten, Bernd
|
|
1986
|
22 |
1 |
p. 15-20
6 p.
|
artikel
|
| 7 |
On transformations of algorithms to multiply 2 × 2 matrices
|
Chatelin, Philippe
|
|
1986
|
22 |
1 |
p. 1-5
5 p.
|
artikel
|
| 8 |
The Greedy and Delauney triangulations are not bad in the average case
|
Lingas, Andrzej
|
|
1986
|
22 |
1 |
p. 25-31
7 p.
|
artikel
|
| 9 |
The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms
|
Pan, Victor Ya.
|
|
1986
|
22 |
1 |
p. 11-14
4 p.
|
artikel
|
| 10 |
Tree-like parse and polynomial subclasses of search problems
|
Kriaučiukas, V.
|
|
1986
|
22 |
1 |
p. 49-54
6 p.
|
artikel
|
| 11 |
Two results on tables
|
Jacobs, Christiaan T.M.
|
|
1986
|
22 |
1 |
p. 43-48
6 p.
|
artikel
|
Tijdschrift beschrijving