A dispersion pass algorithm for the polyphase merge
- 1 October 1962
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 5 (10) , 502-504
- https://doi.org/10.1145/368959.368970
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- A generalized polyphase merge algorithmCommunications of the ACM, 1961
- Analysis of Internal Computer SortingJournal of the ACM, 1961
- Generalized Fibonacci Numbers and Associated MatricesThe American Mathematical Monthly, 1960