Vikas, Om ; Rajaraman, V. (1982) Searching in a dynamic memory with fast sequential access Communications of the ACM, 25 (7). pp. 479-484. ISSN 0001-0782
Full text not available from this repository.
Official URL: http://portal.acm.org/citation.cfm?id=358579
Related URL: http://dx.doi.org/10.1145/358557.358579
Abstract
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 specified record is obtained with a subsequent sequential access capability. Thus, in such a dynamic memory, the mean access time for content addressing is the same as the mean access time for random addressing.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Association for Computing Machinery. |
| ID Code: | 38374 |
| Deposited On: | 29 Apr 2011 07:31 |
| Last Modified: | 29 Apr 2011 07:31 |
Repository Staff Only: item control page
