Bounds on Selection Networks

DOI10.1137/0209043zbMath0445.68045OpenAlexW2049618076MaRDI QIDQ3890124

Andrew Chi-Chih Yao

Publication date: 1980

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

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

zbMATH Keywords

delay timesorting networkcomparatorscomplexity of network selection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (3)

Accelerating certain outputs of merging and sorting networks ⋮ Sorting Short Keys in Circuits of Size ${o(n \log n)}$ ⋮ On the complexity of monotone circuits for threshold symmetric Boolean functions

This page was built for publication: Bounds on Selection Networks