Frank R. Libsch, S.C. Lien
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.
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Hendrik F. Hamann
InterPACK 2013
Leo Liberti, James Ostrowski
Journal of Global Optimization
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009