Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Paper
Noisy sort, a memory-intensive sorting algorithm
Abstract
A table-lookup technique for sorting is developed. It is a highly parallel method which develops an approximation to the sort through a single access to an associative memory. A postprocessing step is intended to complete the sort. The scheme is most effective for special data classes. © 1989.
Related
Martin C. Gutzwiller
Physica D: Nonlinear Phenomena
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011