Optimal conclusive sets for comparator networks

DOI10.1016/J.TCS.2008.12.021zbMath1163.68014OpenAlexW2131681585MaRDI QIDQ1008736

Tamir Levi, Guy Even, Ami Litman

Publication date: 30 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.021

zbMATH Keywords

sorting networksmerging networkscomparator networkszero-one principlebitonic sorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (4)

A non-homogeneous dynamic Bayesian network with a hidden Markov model dependency structure among the temporal data points ⋮ Regularization of non-homogeneous dynamic Bayesian networks with global information-coupling based on hierarchical Bayesian models ⋮ Non-homogeneous dynamic Bayesian networks for continuous data ⋮ Bitonic sorters of minimal depth

Cites Work

• Unnamed Item
• Accelerating certain outputs of merging and sorting networks
• A generalization of the 0-1 principle for sorting
• Continuous algorithms
• Periodic sorting using minimum delay, recursively constructed merging networks
• A decomposition theorem for partially ordered sets
• K-way bitonic sort
• The asymptotic complexity of merging networks
• On the Number of Stable States in a NOR Network
• A short proof of Sperner's lemma

This page was built for publication: Optimal conclusive sets for comparator networks