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
Heaps with bits, 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, 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