Document Type

Conference Proceeding

Department

Computer Science (HMC)

Publication Date

1973

Abstract

The construction of sorting networks has been a topic of much recent discussion. In view of the apparent difficulty of verifying whether a reasonably large proposed sorting network actually does sort, the most useful approach for constructing large networks seems to be to devise a recursive scheme which constructs a network which is guaranteed to sort, obviating the verification phase. In this note, another such approach is presented.

Comments

Previously linked to as: http://ccdl.libraries.claremont.edu/u?/irw,364.

At head of pdf: 1973 Sagamore Computer Conference on Parallel Processing

Pdf acquired through Interlibrary Loan.

Rights Information

© 1973 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. However, permission to reprint or republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Download

Share

COinS