Imran Nasim, Michael E. Henderson
Mathematics
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
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008