| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A real-time algorithm for the (n 2 − 1)-puzzle
|
Parberry, Ian
|
|
1995
|
56 |
1 |
p. 23-28
6 p.
|
artikel
|
| 2 |
Counting convex polygons in planar point sets
|
Mitchell, Joseph S.B.
|
|
1995
|
56 |
1 |
p. 45-49
5 p.
|
artikel
|
| 3 |
Editorial Board
|
|
|
1995
|
56 |
1 |
p. ii-
1 p.
|
artikel
|
| 4 |
Efficient learning with equivalence queries of conjunctions of modulo functions
|
Beitoni, Alberto
|
|
1995
|
56 |
1 |
p. 15-17
3 p.
|
artikel
|
| 5 |
Garbage collection in shared-environment closure reducers: Space-efficient depth first copying using a tailored approach
|
Thomas, Stephen
|
|
1995
|
56 |
1 |
p. 1-7
7 p.
|
artikel
|
| 6 |
Illumination of polygons with vertex lights
|
Estivill-Castro, Vladimir
|
|
1995
|
56 |
1 |
p. 9-13
5 p.
|
artikel
|
| 7 |
Node-to-node cluster fault tolerant routing in star graphs
|
Gu, Qian-Ping
|
|
1995
|
56 |
1 |
p. 29-35
7 p.
|
artikel
|
| 8 |
On the equity of mutual exclusion algorithms in distributed systems
|
Greenwood, Garrison W.
|
|
1995
|
56 |
1 |
p. 19-22
4 p.
|
artikel
|
| 9 |
Parallel algorithms for connectivity problems on interval graphs
|
Saxena, Sanjeev
|
|
1995
|
56 |
1 |
p. 37-44
8 p.
|
artikel
|
| 10 |
Recognizing strict 2-threshold graphs in O(m) time
|
Petreschi, Rossella
|
|
1995
|
56 |
1 |
p. 65-
1 p.
|
artikel
|
| 11 |
The parallel complexity of integer prefix summation
|
Hagerup, Torben
|
|
1995
|
56 |
1 |
p. 59-64
6 p.
|
artikel
|
| 12 |
Tighter bounds on a heuristic for a partition problem
|
Leung, Joseph Y.-T.
|
|
1995
|
56 |
1 |
p. 51-57
7 p.
|
artikel
|
Tijdschrift beschrijving