Limin Hu
IEEE/ACM Transactions on Networking
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.
Limin Hu
IEEE/ACM Transactions on Networking
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006