Rolf Clauberg
IBM J. Res. Dev
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.
Rolf Clauberg
IBM J. Res. Dev
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
M.F. Cowlishaw
IBM Systems Journal
Bowen Zhou, Bing Xiang, et al.
SSST 2008