|
|
Journals in DBLP
J. Algorithms
1986, volume: 7, number: 2
- Robert Sedgewick
A New Upper Bound for Shellsort. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:159-173 [Journal]
- Martin E. Dyer, Alan M. Frieze
Planar 3DM is NP-Complete. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:174-184 [Journal]
- Marc Snir
Depth-Size Trade-Offs for Parallel Prefix Computation. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:185-201 [Journal]
- Richard Cole
Searching and Storing Similar Lists. [Citation Graph (5, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:202-220 [Journal]
- Takao Asano, Tetsuo Asano, Ron Y. Pinter
Polygon Triangulation: Efficiency and Minimality. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:221-231 [Journal]
- Raghunath Raghavan, James Cohoon, Sartaj Sahni
Single Bend Wiring. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:232-257 [Journal]
- Joseph O'Rourke, Alok Aggarwal, Sanjeev R. Maddila, Michael Baldwin
An Optimal Algorithm for Finding Minimal Enclosing Triangles. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:258-269 [Journal]
- Max L. Warshauer
Conway's Parallel Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:270-276 [Journal]
- Michael Werman, Shmuel Peleg, Robert Melter, T. Yung Kong
Bipartite Graph Matching for Points on a Line or a Circle. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:277-284 [Journal]
- Mikhail J. Atallah
Computing the Convex Hull of Line Intersections. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:285-288 [Journal]
- David S. Johnson
The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:2, pp:289-305 [Journal]
|
