This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Search Algorithms for Associative Memories
May 1986 (vol. 35 no. 5)
pp. 456-461
ASCII Text
x 
 
W.A. Davis, null De-Lei Lee, "Fast Search Algorithms for Associative Memories," IEEE Transactions on Computers, vol. 35, no. 5, pp. 456-461, May, 1986.
 
 
BibTex
x
 
@article{ 10.1109/TC.1986.1676788,
author = {W.A. Davis and null De-Lei Lee},
title = {Fast Search Algorithms for Associative Memories},
journal ={IEEE Transactions on Computers},
volume = {35},
number = {5},
issn = {0018-9340},
year = {1986},
pages = {456-461},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1986.1676788},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Fast Search Algorithms for Associative Memories
IS - 5
SN - 0018-9340
SP456
EP461
EPD - 456-461
A1 - W.A. Davis,
A1 - null De-Lei Lee,
PY - 1986
KW - word-tree
KW - Adjacency search
KW - algorithm
KW - associative memory
KW - double-limit search
KW - extremum search
KW - threshold search
VL - 35
JA - IEEE Transactions on Computers
ER -
 
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.
Index Terms:
word-tree, Adjacency search, algorithm, associative memory, double-limit search, extremum search, threshold search
Citation:
W.A. Davis, null De-Lei Lee, "Fast Search Algorithms for Associative Memories," IEEE Transactions on Computers, vol. 35, no. 5, pp. 456-461, May 1986, doi:10.1109/TC.1986.1676788
Usage of this product signifies your acceptance of the Terms of Use.