|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
12 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A new upper bound for Shellsort |
Sedgewick, Robert |
1986 |
7 | 2 |
p. 159-173 15 p. |
article |
|
| 2 | An optimal algorithm for finding minimal enclosing triangles |
O'Rourke, Joseph |
1986 |
7 | 2 |
p. 258-269 12 p. |
article |
|
| 3 | Bipartite graph matching for points on a line or a circle |
Werman, Michael |
1986 |
7 | 2 |
p. 277-284 8 p. |
article |
|
| 4 | Computing the convex hull of line intersections |
Atallah, Mikhail J |
1986 |
7 | 2 |
p. 285-288 4 p. |
article |
|
| 5 | Conway's parallel sorting algorithm |
Warshauer, Max L |
1986 |
7 | 2 |
p. 270-276 7 p. |
article |
|
| 6 | Depth-size trade-offs for parallel prefix computation |
Snir, Marc |
1986 |
7 | 2 |
p. 185-201 17 p. |
article |
|
| 7 | Papers to appear in forthcoming issues |
1986 |
7 | 2 |
p. 306-307 2 p. |
article |
||
| 8 | Planar 3DM is NP-complete |
Dyer, M.E |
1986 |
7 | 2 |
p. 174-184 11 p. |
article |
|
| 9 | Polygon triangulation: Efficiency and minimality |
Asano, Takao |
1986 |
7 | 2 |
p. 221-231 11 p. |
article |
|
| 10 | Searching and storing similar lists |
Cole, Richard |
1986 |
7 | 2 |
p. 202-220 19 p. |
article |
|
| 11 | Single bend wiring |
Raghavan, Raghunath |
1986 |
7 | 2 |
p. 232-257 26 p. |
article |
|
| 12 | The NP-completeness column: An ongoing guide |
Johnson, David S |
1986 |
7 | 2 |
p. 289-305 17 p. |
article |
12 results found