A simple proof of Lewin's ordered-retrieval theorem for associative memories

Authors:
A. Wolinsky
Affiliations:
TRW Systems Group, Redondo Beach, DA
Venue:
Communications of the ACM
Year:
1968

Citing 1
Cited 2

Algorithms for Parallel-Search Memories

Journal of the ACM (JACM)

A computer communication technique using content-induced transaction overlap

ACM Transactions on Computer Systems (TOCS)
An O(n+k) Algorithm for Ordered Retrieval from an Associative Memory

IEEE Transactions on Computers

Quantified Score

Hi-index	48.22

Visualization

Abstract