No CrossRef data available.
Article contents
Parberry’s pairwise sorting network revealed
Part of:
JFP Functional Pearls
Published online by Cambridge University Press: 13 November 2018
Abstract
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

- Type
- Functional Pearl
- Information
- Copyright
- © Cambridge University Press 2018
References
Bove, A. & Coquand, T. (2006) Formalising bitonic sort in type theory. In Types for Proofs and Programs, Filliâtre, J.-C., Paulin-Mohring, C., and Werner, B. (eds), Lecture Notes in Computer Science, vol. 3839. Berlin, Heidelberg: Springer, pp. 82–97.CrossRefGoogle Scholar
Codish, M. & Zazon-Ivry, M. (2010) Pairwise cardinality networks. In Proceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2010. Berlin, Heidelberg: Springer-Verlag, pp. 154–172.Google Scholar
Hinze, R. (2000) Functional Pearl: Perfect trees and bit-reversal permutations. J. Funct. Program. 10(3), 305–317.CrossRefGoogle Scholar
Hinze, R. & Martin, C. (2018) Functional Pearl: Batcher’s odd-even merging network revealed. J. Funct. Program. 28(e14), 1–13.CrossRefGoogle Scholar
Knuth, D. E. (1998) The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd edn. Reading, MA: Addison-Wesley Publishing Company.Google Scholar
Parberry, I. (1992) The pairwise sorting network. Parallel Process. Lett. 2(2&3), 205–211.CrossRefGoogle Scholar
Discussions
No Discussions have been published for this article.