Referenced Items are not available for this document.
We consider the problem of sorting an arbitrary permutation of length n using substring reversals of length 2 or 3. This has been called "short swaps ". We give an upper bound of (5/24) n2 + O(nlogn), improving the previous ( 1/4 ) n2 upper bound. We also show that there is a short swap sorting network with ( 1/4 ) n2 +O(nlogn) comparators and depth n.
Published in:
Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on
Date of Conference: 10-12 May 2004
- Page(s):
- 98 - 103
- ISSN :
- 1087-4089
- Print ISBN:
- 0-7695-2135-5
- INSPEC Accession Number:
- 8038764
- Digital Object Identifier :
- 10.1109/ISPAN.2004.1300465
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
