Parallel comparison merging of many-ordered lists

DOI10.1016/0304-3975(91)90279-BzbMath0729.68026MaRDI QIDQ807015

Yossi Azar

Publication date: 1991

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

zbMATH Keywords

parallel algorithmsaverage case complexityworst case complexitymerging ordered lists

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

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

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