Searching in a dynamic memory with fast sequential access
This communication presents an algorithm for searching in the Aho-Ullman dynamic memory consisting of (2m - 1) cells. Mean search time of 1.5m steps to the first…
Searching in a dynamic memory with fast sequential access
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved