The Community for Technology Leaders
Green Image
Issue No. 05 - May (1986 vol. 35)
ISSN: 0018-9340
pp: 456-461
W.A. Davis , Department of Computing Science, University of Alberta
A new scheme for constructing search algorithms for bit-parallel associative memories of m n-bit words is described. The resulting equivalence searches, threshold searches, and double-limit searches achieve the time bound of O(log n), compared to O(n), the recent result of Ramamoorthy et al. [12]. The extremum search algorithm by Frei and Goldberg [2] is modified and generalized so that the number of memory interrogations is reduced by 30 percent over the initial algorithm in the average case.
word-tree, Adjacency search, algorithm, associative memory, double-limit search, extremum search, threshold search

W. Davis and n. De-Lei Lee, "Fast Search Algorithms for Associative Memories," in IEEE Transactions on Computers, vol. 35, no. , pp. 456-461, 1986.
88 ms
(Ver 3.3 (11022016))