nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A decomposition strategy for the vertex cover problem
|
Bertolazzi, Paola |
|
1989 |
31 |
6 |
p. 299-304 6 p. |
artikel |
2 |
An Ω(n log n) lower bound for decomposing a set of points into chains
|
Bloniarz, Peter A. |
|
1989 |
31 |
6 |
p. 319-322 4 p. |
artikel |
3 |
A note on the completeness of resolution without self-resolution
|
Eisinger, Norbert |
|
1989 |
31 |
6 |
p. 323-326 4 p. |
artikel |
4 |
A note on the computational complexity of the pure classical implication calculus
|
Stålmarck, Gunnar |
|
1989 |
31 |
6 |
p. 277-278 2 p. |
artikel |
5 |
A note on the construction of the data structure “deap”
|
Carlsson, Svante |
|
1989 |
31 |
6 |
p. 315-317 3 p. |
artikel |
6 |
Author index volume 31 (1989)
|
|
|
1989 |
31 |
6 |
p. 331-332 2 p. |
artikel |
7 |
Direct semantics and exceptions define jumps and coroutines
|
Allison, Lloyd |
|
1989 |
31 |
6 |
p. 327-330 4 p. |
artikel |
8 |
Finite processes in cause-effect structures and their composition
|
Czaja, Ludwik |
|
1989 |
31 |
6 |
p. 305-310 6 p. |
artikel |
9 |
On computing the closest boundary point on the convex hull
|
Aggarwal, Alok |
|
1989 |
31 |
6 |
p. 311-314 4 p. |
artikel |
10 |
On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
|
Nagamochi, Hiroshi |
|
1989 |
31 |
6 |
p. 279-285 7 p. |
artikel |
11 |
Probabilistic analysis of a heuristics for the dual bin packing problem
|
Foster, Dean P. |
|
1989 |
31 |
6 |
p. 287-290 4 p. |
artikel |
12 |
Recursive ω-rule for proof systems
|
Yoccoz, Serge |
|
1989 |
31 |
6 |
p. 291-294 4 p. |
artikel |
13 |
Some properties of view-based replication control algorithms for distributed systems
|
Mukkamala, Ravi |
|
1989 |
31 |
6 |
p. 295-298 4 p. |
artikel |