Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Design rationale for TELOS, a PASCAL-based AI language
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Analysis of pointers and structures
ACM SIGPLAN Notices - Best of PLDI 1979-1999
| Hi-index | 48.22 |
Context trees provide a convenient way of storing data which is to be viewed as a hierarchy of contexts. This note presents an algorithm which improves on previous context tree retrieval algorithms. It is based on the observation that in typical uses context changes are infrequent relative to retrievals, so that data can be cached to speed up retrieval. A retrieval is started from the position of the previous retrieval and auxiliary structures are built up to make the search rapid. Algorithms for addition and deletion of data and for garbage collection are outlined.