Selection Networks

DOI10.1137/0220054MaRDI QIDQ3982712zbMATH OpenOpenAlexFDO

Authors Nicholas Pippenger

Publication date 26 June 1992

Published in SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

classifierscomparatorexpanding graphsrandom walk

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 403945
• A Method of Constructing Selection Networks with O(\log n) Depth
• On probabilistic networks for selection, merging, and sorting
• Optimal parallel selection has complexity O(log log N)
• scientific article; zbMATH DE number 1263220

Cited in

(12)

• On probabilistic networks for selection, merging, and sorting
• Comparator networks for binary heap construction
• Construction of halvers
• On the complexity of monotone circuits for threshold symmetric Boolean functions
• scientific article; zbMATH DE number 403945 (Why is no real title available?)
• scientific article; zbMATH DE number 1256707 (Why is no real title available?)
• A Method of Constructing Selection Networks with O(\log n) Depth
• Comparator networks for binary heap construction
• Fragile complexity of comparison-based algorithms
• External selection
• Fragile complexity of adaptive algorithms
• Fragile complexity of adaptive algorithms

This page was built for publication: Selection Networks

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