The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Structure of a LISP system using two-level storage
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Compact Encodings of List Structure
ACM Transactions on Programming Languages and Systems (TOPLAS)
High-Level Language Implications of the Proposed IEEE Floating-Point Standard
ACM Transactions on Programming Languages and Systems (TOPLAS)
An empirical study of list structure in Lisp
Communications of the ACM
List processing in real time on a serial computer
Communications of the ACM
A buddy system variation for disk storage allocation
Communications of the ACM
An efficient, incremental, automatic garbage collector
Communications of the ACM
Symbolic computing with and without LISP
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Brand X: LISP support for semantic networks
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Hi-index | 48.28 |
In current machine designs, a machine address gives the user direct access to a single piece of information, namely the contents of that machine word. This note is based on the observation that it is often useful to associate additional information, with some (relatively few) address locations determined at run time, without the necessity of preallocating the storage at all possible such addresses. That is, it can be useful to have an effective extra bit, field, or address in some words without every word having to contain a bit (or bits) to mark this as a special case. The key idea is that this extra associated information can be found by a table search. Although it could be found by any search technique (e.g. linear, binary sorted, etc.), we suggest that an appropriate low overhead mechanism is to use hash search on a table in which the key is the address of the cell to be augmented.