Parallel merging sorting using comparison matrices. I

DOI10.1007/BF02367744zbMath0836.68020OpenAlexW4239015263MaRDI QIDQ1905191

Ya. E. Romm

Publication date: 11 April 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02367744

zbMATH Keywords

sortingcomparison matrices

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (4)

Parallel merge sort using comparison matrices. II ⋮ Identification of the domain, ranges, and values of complex roots of a polynomial with complex coefficients based on stable address sorting ⋮ Numerical sorting-based optimization as applied to general differential and nonlinear equations ⋮ Sorting-based localization and stable computation of zeros of a polynomial. I.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic organization of index-based numerical parallel processing
• Optimal Sorting Algorithms for Parallel Computers

This page was built for publication: Parallel merging sorting using comparison matrices. I