Journals in DBLP

Algorithmica
1990, volume: 5, number: 1

1. Benny Chor, Oded Goldreich
   An Improved Parallel Algorithm for Integer GCD. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1990, v:5, n:1, pp:1-10 [Journal]
   
2. Teofilo F. Gonzalez, Si-Qing Zheng
   Approximation Algorithms for Partitioning a Rectangle with Interior Points. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1990, v:5, n:1, pp:11-42 [Journal]
   
3. Clyde P. Kruskal, Larry Rudolph, Marc Snir
   Efficient Parallel Algorithms for Graph Problems. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1990, v:5, n:1, pp:43-64 [Journal]
   
4. M. Orlowski
   A New Algorithm for the Largest Empty Rectangle Problem. [Citation Graph (1, 0)][DBLP]
   Algorithmica, 1990, v:5, n:1, pp:65-73 [Journal]
   
5. Mike Paterson
   Improved Sorting Networks with O(log N) Depth. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1990, v:5, n:1, pp:65-92 [Journal]
   
6. Daniel Bienstock, Clyde L. Monma
   On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1990, v:5, n:1, pp:93-109 [Journal]
   
7. Ding-Zhu Du, Yanjun Zhang
   On Heuristics for Minimum Length Rectilinear Partitions. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1990, v:5, n:1, pp:111-128 [Journal]
   
8. Xin He, Yaacov Yesha
   Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1990, v:5, n:1, pp:129-145 [Journal]