Noisy sort, a memory-intensive sorting algorithm

Susumu Horiguchi, Williard L. Miranker
1989 Linear Algebra and its Applications  
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.
doi:10.1016/0024-3795(89)90484-9 fatcat:dvu5alb4rzhnbo6bwgx3n6ewya