Journals in DBLP
Algorithmica 1991, volume: 6, number: 4
Vince Grolmusz Large Parallel Machines Can Be Extremely Slow for Small Problems. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:4, pp:479-489 [Journal ] Harald Rosenberger Order-k Voronoi Diagrams of Sites with Additive Weights in the Plane. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:4, pp:490-521 [Journal ] Leila De Floriani , Bianca Falcidieno , George Nagy , Caterina Pienovi On Sorting Triangles in a Delaunay Tessellation. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:4, pp:522-532 [Journal ] Chandrajit L. Bajaj , Myung-Soo Kim Convex Hulls of Objects Bounded by Algebraic Curves. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:4, pp:533-553 [Journal ] Daniel M. Gordon Parallel Sorting on Cayley Graphs. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:4, pp:554-564 [Journal ] S. Alice Wu , Joseph JáJá Optimal Algorithms for Adjacent Side Routing. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:4, pp:565-578 [Journal ] Robert F. Sproull Refinements to Nearest-Neighbor Searching in k-Dimensional Trees. [Citation Graph (7, 0)][DBLP ] Algorithmica, 1991, v:6, n:4, pp:579-589 [Journal ] J. B. Kruskal , Albert G. Greenberg A Flexible Way of Counting Large Numbers Approximately in Small Registers. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:4, pp:590-596 [Journal ] Claire Kenyon , Jeffrey Scott Vitter Maximum Queue Size and Hashing with Lazy Deletion. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:4, pp:597-619 [Journal ]