Sorting and Merging in Rounds

DOI10.1137/0603047zbMath0493.68060OpenAlexW2014992380MaRDI QIDQ3956411

Roland Haeggkvist, 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

Related Items (11)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in one round
• On the use of interpretive structural modeling for worth assessment
• On the Transformation of a System to Canonical Forms
• Parallel Sorting with Constant Time for Comparisons
• Parallelism in Comparison Problems
• Measurement Theory

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