Yixiong Chen, Weichuan Fang
Engineering Analysis with Boundary Elements
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. Tismenetsky
International Journal of Computer Mathematics
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences