A generalization of the 0--1 principle for sorting

Authors:
Sanguthevar Rajasekaran;Sandeep Sen
Affiliations:
257 ITE Building, Department of CSE, University of Connecticut, Storrs, CT 06269, USA;Department of Computer Science and Engineering, IIT Delhi, New Delhi 1100116, India
Venue:
Information Processing Letters
Year:
2005

Citing 4
Cited 1

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Randomized algorithms

Randomized algorithms
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer

IEEE Transactions on Parallel and Distributed Systems
The distance bound for sorting on mesh-connected processor arrays is tight

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Optimal conclusive sets for comparator networks

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity

Quantified Score

Hi-index	0.89

Visualization

Abstract

The traditional zero-one principle for sorting networks states that ''if a network with n input lines sorts all2^n binary sequences into nondecreasing order, then it will sort any arbitrary sequence of n numbers into nondecreasing order''. We generalize this to the situation when a network sorts almost all binary sequences and relate it to the behavior of the sorting network on arbitrary inputs. We also present an application to mesh sorting.