Searching, Merging, and Sorting in Parallel Computation
From MaRDI portal
Publication:3038630
DOI10.1109/TC.1983.1676138zbMath0525.68039MaRDI QIDQ3038630
Publication date: 1983
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items
Integer merging on EREW PRAM, Heaps with bits, An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon, Parallel algorithms for merging and sorting, Parallel comparison merging of many-ordered lists, Parallel comparison algorithms for approximation problems, A complexity theory of efficient parallel algorithms, Parallel selection, Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm, On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case, Parallel merging with restriction, Routing, merging, and sorting on parallel models of computation, Polynomial terse sets, Parallel construction of a suffix tree with applications, Parallel priority queues, Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs, Line-segment intersection reporting in parallel, Sorting in linear time?, Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications, Improved parallel integer sorting without concurrent writing, Sorting strings and constructing digital search trees in parallel, Constructing arrangements optimally in parallel, A nearly optimal deterministic parallel Voronoi diagram algorithm, On the complexity of finding the chromatic number of a recursive graph. I: The bounded case, Sweep methods for parallel computational geometry, Fast integer merging on the EREW PRAM, Fast sequential and parallel algorithms for finding extremal sets, A model of sequential computation with Pipelined access to memory, Space-efficient parallel merging
