The strongest model of computation obeying 0-1 Principles

DOI10.1007/s00224-010-9257-8zbMath1209.68252OpenAlexW1994493843MaRDI QIDQ633766

Ami Litman, Tamir Levi

Publication date: 30 March 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.625.5190

zbMATH Keywords

sorting networksoblivious algorithmscomparator networksmin max networkszero-one principle

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

On the complexity of min-max sorting networks ⋮ Bitonic sorters of minimal depth

Cites Work

• K-way bitonic sort
• The asymptotic complexity of merging networks
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• Unnamed Item
• Unnamed Item

This page was built for publication: The strongest model of computation obeying 0-1 Principles