|
|
Journals in DBLP
Algorithmica
1990, volume: 5, number: 3
- Joseph C. Culberson, J. Ian Munro
Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1990, v:5, n:3, pp:295-311 [Journal]
- Esko Ukkonen
A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1990, v:5, n:3, pp:313-323 [Journal]
- Friedemann Mattern
Asynchronous Distributed Termination-Parallel and Symmetric Solutions with Echo Algorithms. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1990, v:5, n:3, pp:325-340 [Journal]
- Ming-Tat Ko, Richard C. T. Lee, Jyun-Sheng Chang
An Optimal Approximation Algorithm for the Rectilinear m-Center Problem. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1990, v:5, n:3, pp:341-352 [Journal]
- Bruce Randall Donald
The Complexity of Planar Compliant Motion Planning Under Uncertainty. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1990, v:5, n:3, pp:353-382 [Journal]
- Michael M. Wu, Michael C. Loui
An Efficient Distributed Algorithm for Maximum Matching in General Graphs. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1990, v:5, n:3, pp:383-406 [Journal]
- Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
Computing Euclidean Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1990, v:5, n:3, pp:407-419 [Journal]
- David P. Dobkin, Diane L. Souvaine
Computational Geometry in a Curved World. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1990, v:5, n:3, pp:421-457 [Journal]
- Bonnie Berger, John Rompel
A Better Performance Guarantee for Approximate Graph Coloring. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1990, v:5, n:3, pp:459-466 [Journal]
|
