A Method of Constructing Selection Networks with O(\log n) Depth

DOI10.1137/S0097539793248329MaRDI QIDQ4895827zbMATH OpenFDO

Authors Shuji Jimbo, A. Maruoka

Publication date 16 December 1996

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

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

zbMATH Keywords

classifiercomputer networkexpanderselection network

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Selection Networks
• scientific article; zbMATH DE number 403945
• On probabilistic networks for selection, merging, and sorting
• Comparator networks for binary heap construction

Cited in

(8)

• Comparator networks for binary heap construction
• On the complexity of monotone circuits for threshold symmetric Boolean functions
• Selection Networks
• scientific article; zbMATH DE number 403945 (Why is no real title available?)
• Comparator networks for binary heap construction
• Fragile complexity of comparison-based algorithms
• Fragile complexity of adaptive algorithms
• Fragile complexity of adaptive algorithms

This page was built for publication: A Method of Constructing Selection Networks with $O(\log n)$ Depth

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