Lower Bounds On Bitonic Sorting Networks

@inproceedings{LeviLowerBO,
  title={Lower Bounds On Bitonic Sorting Networks},
  author={Tamir Levi and Ami Litman}
}
This paper points to an abnormal phenomena of comparator networks. For most key processing problems (such as sorting, merging or insertion) the smaller the input size the easier the problem. Surprisingly, this is not the case for Bitonic sorting. Namely, the minimal depth of a comparator network that sorts all Bitonic sequences of n keys is not monotonic in n. We show that for any n, not a power of two, the depth of a Bitonic sorter of n keys is at least dlog(n)e + 1. This contrast with Batcher… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

On Fast Bitonic Sorters.

  • T. Levy, A. Litman
  • Technical Report CS-2009-01. Technion, Department…
  • 2009
2 Excerpts

and Litman A . “ On Fast Bitonic Sorters . ” Technical Report CS - 2009 - 01

  • T. Levy
  • 2009

The art of computer programming vol.3: Sorting and searching, Addison-Wesely

  • D. E. Knuth
  • Second edition,
  • 1998
2 Excerpts

K . “ kway bitonic sort ”

  • T Nakatani, T. HuangS., W. ArdenB., S. Tripathi
  • 1989

Similar Papers

Loading similar papers…