| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A distributed algorithm to prevent mutual drift between n logical clocks
|
Raynal, Michel
|
|
1987
|
24 |
3 |
p. 199-202
4 p.
|
artikel
|
| 2 |
An algorithm for determining an opaque minimal forest of a convex polygon
|
Akman, Varol
|
|
1987
|
24 |
3 |
p. 193-198
6 p.
|
artikel
|
| 3 |
A note on extending Knuth's tree estimator to directed acyclic graphs
|
Pitt, Leonard
|
|
1987
|
24 |
3 |
p. 203-206
4 p.
|
artikel
|
| 4 |
A note on the transaction backout problem
|
Krentel, Mark W.
|
|
1987
|
24 |
3 |
p. 149-152
4 p.
|
artikel
|
| 5 |
A polynomial algorithm for b-matchings: An alternative approach
|
Anstee, Richard P.
|
|
1987
|
24 |
3 |
p. 153-157
5 p.
|
artikel
|
| 6 |
A set of combinators for abstraction in linear space
|
Castan, M.
|
|
1987
|
24 |
3 |
p. 183-188
6 p.
|
artikel
|
| 7 |
Explicit solution of block tridiagonal systems of linear equations
|
Evans, D.J.
|
|
1987
|
24 |
3 |
p. 207-209
3 p.
|
artikel
|
| 8 |
Generation of convex polygons with individual angular constraints
|
Roussille, M.
|
|
1987
|
24 |
3 |
p. 159-164
6 p.
|
artikel
|
| 9 |
How to compare the incomparable
|
Grune, Dick
|
|
1987
|
24 |
3 |
p. 177-181
5 p.
|
artikel
|
| 10 |
On a recursion connected with tree balancing algorithms
|
Van Leijenhorst, D.C.
|
|
1987
|
24 |
3 |
p. 189-192
4 p.
|
artikel
|
| 11 |
On solving hard problems by polynomial-size circuits
|
Huynh, Dung T.
|
|
1987
|
24 |
3 |
p. 171-176
6 p.
|
artikel
|
| 12 |
The complexity of scheduling independent two-processor tasks on dedicated processors
|
Kubale, Marek
|
|
1987
|
24 |
3 |
p. 141-147
7 p.
|
artikel
|
| 13 |
The planar realization of Boolean functions
|
McColl, W.F.
|
|
1987
|
24 |
3 |
p. 165-170
6 p.
|
artikel
|
Tijdschrift beschrijving