Parallel comparison merging of many-ordered lists

DOI10.1016/0304-3975(91)90279-BzbMATH Open0729.68026MaRDI QIDQ807015FDOQ807015

Authors: Yossi Azar 

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• The Average Complexity of Parallel Comparison Merging
• Two Probabilistic Results on Merging
• scientific article; zbMATH DE number 3949727
• Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention
• Space-efficient parallel merging

zbMATH Keywords

parallel algorithmsworst case complexityaverage case complexitymerging ordered lists

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Parallelism in Comparison Problems
• Tight Comparison Bounds on the Complexity of Parallel Sorting
• Finding an Approximate Maximum
• Finding the maximum, merging, and sorting in a parallel computation model
• Parallel selection
• Sorting in \(c \log n\) parallel steps
• Parallel Merge Sort
• Sorting, Approximate Sorting, and Searching in Rounds
• Sorting and Selecting in Rounds
• Parallel sorting
• The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
• Title not available (Why is that?)
• Parallel Sorting with Constant Time for Comparisons
• Sorting and Merging in Rounds
• The average-case parallel complexity of sorting
• Searching, Merging, and Sorting in Parallel Computation

Cited In (5)

• Title not available (Why is that?)
• Direct-chaining with coalescing lists
• Title not available (Why is that?)
• Parallel merging: Algorithm and implementation results
• Listing combinatorial objects in parallel

This page was built for publication: Parallel comparison merging of many-ordered lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807015)