Issue No. 03 - March (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2176
The problem of retrieving an ordered list of k words that satisfy a given search condition from an associative memory of m words of n bits each is addressed. A fast ordered retrieval algorithm is proposed, along with a logic design for a cellular associative memory which mechanizes the algorithm. The algorithm is of time complexity O(n+k). By contrast, the fastest previously known algorithms, b
ordered retrieval; associative memory; search condition; logic design; time complexity; content-addressable storage; logic design.
W. Davis and D. Lee, "An O(n+k) Algorithm for Ordered Retrieval from an Associative Memory," in IEEE Transactions on Computers, vol. 37, no. , pp. 368-371, 1988.