Sorting and Merging in Rounds

DOI10.1137/0603047MaRDI QIDQ3956411zbMATH OpenOpenAlexFDO

Authors Roland Häggkvist, Pavol Hell

Publication date 1982

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0603047

zbMATH Keywords

structural modelingoptimal algorithms for merging in rounds

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3735871 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Measurement Theory
• On the Transformation of a System to Canonical Forms
• On the use of interpretive structural modeling for worth assessment
• Parallel Sorting with Constant Time for Comparisons
• Parallelism in Comparison Problems
• Sorting in one round

Cited in

(11)

• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Constant time parallel sorting: An empirical view.
• Fast integer merging on the EREW PRAM
• Sorting in rounds
• Graphs whose every transitive orientation contains almost every relation
• Parallel comparison algorithms for approximation problems
• Parallel selection
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
• Routing, merging, and sorting on parallel models of computation
• Parallel sorting
• Parallel comparison merging of many-ordered lists

This page was built for publication: Sorting and Merging in Rounds

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