|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
9 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | An algorithm to find polygon similarity |
Boreddy, Jayaramaiah |
1989 |
33 | 4 |
p. 205-206 2 p. |
article |
|
| 2 | An explicit separation of relativised random polynomial time and relativised deterministic polynomial time |
Zippel, Richard |
1989 |
33 | 4 |
p. 207-212 6 p. |
article |
|
| 3 | A note on adaptive parallel sorting |
Levcopoulos, Christos |
1989 |
33 | 4 |
p. 187-191 5 p. |
article |
|
| 4 | A randomised heuristical algorithm for estimating the chromatic number of a graph |
Z̆erovnik, Janez |
1989 |
33 | 4 |
p. 213-219 7 p. |
article |
|
| 5 | Finding the upper envelope of n line segments in O(n log n) time |
Hershberger, John |
1989 |
33 | 4 |
p. 169-174 6 p. |
article |
|
| 6 | On the polynomial IO-complexity |
Rolim, JoséD.P. |
1989 |
33 | 4 |
p. 199-204 6 p. |
article |
|
| 7 | Optimal merging and sorting on the EREW PRAM |
Hagerup, Torben |
1989 |
33 | 4 |
p. 181-185 5 p. |
article |
|
| 8 | Parallel batched planar point location on the CCC |
Lee, D.T. |
1989 |
33 | 4 |
p. 175-179 5 p. |
article |
|
| 9 | Undecidability of the bandwidth problem on linear graph languages |
Wanke, Egon |
1989 |
33 | 4 |
p. 193-197 5 p. |
article |
9 results found