Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
A amily of sorting algorithms is proposed, the members of which make Adler use of the memory space and thus yield longer sorted strings. Extensive simulation results are presented, and various implications and lurther application, are discussed. © 1972, ACM. All rights reserved.
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Zohar Feldman, Avishai Mandelbaum
WSC 2010
M.F. Cowlishaw
IBM Systems Journal
P.C. Yue, C.K. Wong
Journal of the ACM