Sorting-based selection algorithms for hypercubic networks

DOI10.1007/S004539910011MaRDI QIDQ1969955zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 19 March 2000

Published in Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

selection algorithmhypercubic network

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Hypercubic Sorting Networks
• scientific article; zbMATH DE number 828043
• Optimal sorting networks
• Optimal-depth sorting networks
• Optimizing sorting algorithms by using sorting networks
• Sorting with networks of data structures
• scientific article; zbMATH DE number 1444292
• A hypergraph network simplex algorithm
• Sorting networks on restricted topologies
• New Bounds on Optimal Sorting Networks

Cited in

(4)

• Unifying themes for selection on any network
• Improved universal \(k\)-selection in hypercubes
• Faster deterministic sorting through better sampling.
• Efficient parallel k selection algorithm

This page was built for publication: Sorting-based selection algorithms for hypercubic networks

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