article · 1993

A Generalized Bitonic Sorting Network

Cited by 30Abstract and details only

Abstract

The bitonic sorting network will sort N-2^m keys in O(log^2N) time with 0(Nlog^2N) comparators. Developments on the sorter enable the network to sort N-pq keys, a composite number. However, there has been no general method for sorting a bitonic sequence of N keys, N a prime, or N a composite that decomposes into primes larger than 3. The oddmerge method removes this constraint while maintaining the same cost and delay, using a uniform and efficient decomposition.

Cite this paper

APA 7

Liszka, K. J., & Batcher, K. E. (1993). A Generalized Bitonic Sorting Network. https://doi.org/10.1109/icpp.1993.23

MLA 9

Liszka, Kathy J., and Kenneth E. Batcher. “A Generalized Bitonic Sorting Network.” 1993, pp. 105–08, https://doi.org/10.1109/icpp.1993.23.

Chicago

Liszka, Kathy J., and Kenneth E. Batcher. 1993. “A Generalized Bitonic Sorting Network.” https://doi.org/10.1109/icpp.1993.23.

Harvard

Liszka, K.J. and Batcher, K.E. (1993) ‘A Generalized Bitonic Sorting Network’. Available at: https://doi.org/10.1109/icpp.1993.23.

BibTeX

@article{liszka1993generalized,
  title = {{A Generalized Bitonic Sorting Network}},
  author = {Liszka, Kathy J. and Batcher, Kenneth E.},
  pages = {105--108},
  year = {1993},
  doi = {10.1109/icpp.1993.23}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.