Kraft storage and access for list implementations(Extended Abstract)

Authors:
Donna J. Brown
Affiliations:
-
Venue:
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Year:
1980

Citing 8
Cited 0

Perceptrons: expanded edition

Perceptrons: expanded edition
Efficient Storage and Retrieval by Content and Address of Static Files

Journal of the ACM (JACM)
A Theory of Program Size Formally Identical to Information Theory

Journal of the ACM (JACM)
The Complexity of Some Simple Retrieval Problems

Journal of the ACM (JACM)
Information Theory and Reliable Communication

Information Theory and Reliable Communication
A near optimal data structure for a type of range query problem

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
STORAGE AND ACCESS COSTS FOR IMPLEMENTATIONS OF VARIABLE LENGTH LISTS

STORAGE AND ACCESS COSTS FOR IMPLEMENTATIONS OF VARIABLE LENGTH LISTS
Analysis of associative retrieval algorithms.

Analysis of associative retrieval algorithms.

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is part of an investigation into efficient ways of implementing variable-length lists (see Brown [1]). Storage and access optimality are discussed from an information-theoretic viewpoint; in particular, we develop the notions of Kraft storage and Kraft access (see Elias [4]). Our attention here is restricted to the implementation of questions of the form: “What is the ith element in the list?” We derive consequences of achieving Kraft storage and/or Kraft access and then examine some common implementation schemes. In this abstract we shall give only an informal discussion of some basic concepts and results.