Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
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
Conference paper
Generative Adversarial Symmetry Discovery
Jianke Yang, Robin Walters, et al.
ICML 2023
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
George Markowsky
J. Math. Anal. Appl.