Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Paper
Sorting by Natural Selection
Abstract
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.
Related
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Conference paper
Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007