Volume 7; Issue 2

Journal of Algorithms

Volume 7; Issue 2
1

A new upper bound for Shellsort

Robert Sedgewick
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 796 KB
english, 1986
2

Planar 3DM is NP-complete

M.E Dyer, A.M Frieze
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 591 KB
english, 1986
3

Depth-size trade-offs for parallel prefix computation

Marc Snir
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 723 KB
english, 1986
4

Searching and storing similar lists

Richard Cole
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 1.14 MB
english, 1986
5

Polygon triangulation: Efficiency and minimality

Takao Asano, Tetsuo Asano, Ron Y Pinter
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 502 KB
english, 1986
6

Single bend wiring

Raghunath Raghavan, James Cohoon, Sartaj Sahni
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 1.14 MB
english, 1986
7

An optimal algorithm for finding minimal enclosing triangles

Joseph O'Rourke, Alok Aggarwal, Sanjeev Maddila, Michael Baldwin
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 615 KB
english, 1986
8

Conway's parallel sorting algorithm

Max L Warshauer
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 328 KB
english, 1986
9

Bipartite graph matching for points on a line or a circle

Michael Werman, Shmuel Peleg, Robert Melter, T.Y Kong
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 376 KB
english, 1986
10

Computing the convex hull of line intersections

Mikhail J Atallah
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 173 KB
english, 1986
11

The NP-completeness column: An ongoing guide

David S Johnson
Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 1.17 MB
english, 1986
12

Papers to appear in forthcoming issues

Journal:
Journal of Algorithms
Year:
1986
Language:
english
File:
PDF, 65 KB
english, 1986