Paper

01 Oct 1972

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

Paper

A hierarchical screening algorithm for reactive power optimization in distribution networks

Xinyi Su, Guangyu He, et al.

Dianli Xitong Zidonghua/Automation of Electric Power Systems

Paper

Advanced lithography kits: Serifs and hammerhead

Hang-Yip Liu, Steffen Schulze, et al.

Proceedings of SPIE - The International Society for Optical Engineering

Conference paper

Non-gaussian statistical timing analysis using second-order polynomial fitting

Lerong Cheng, Jinjun Xiong, et al.

ASP-DAC 2008

Paper

GeoTran-HC: Geometric transformation of highly coupled variable topology multi-body problems

Sai Zeng, Angran Xiao, et al.

CAD Computer Aided Design

View all publications