ACM

Communications of the ACM

Home/Magazine Archive/October 1962 (Vol. 5, No. 10)/A dispersion pass algorithm for the polyphase merge/Abstract

A dispersion pass algorithm for the polyphase merge

By Armando G. Mendoza
Communications of the ACM, October 1962, Vol. 5 No. 10, Pages 502-504
10.1145/368959.368970
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

This paper presents a new manner of dispersing strings for a Polyphase merge. If the number of strings dispersed is between two levels acceptable by Polyphase merge, a more economical technique of reaching the next level for Polyphase merge is shown and proved.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.