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

DOI10.1137/S0097539793248329zbMath0857.68059MaRDI QIDQ4895827

Shuji Jimbo, Akira Maruoka

Publication date: 16 December 1996

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

zbMATH Keywords

classifierexpandercomputer networkselection network

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (6)

Comparator networks for binary heap construction ⋮ Fragile complexity of adaptive algorithms ⋮ Fragile complexity of comparison-based algorithms ⋮ Fragile complexity of adaptive algorithms ⋮ On the complexity of monotone circuits for threshold symmetric Boolean functions ⋮ Comparator networks for binary heap construction

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