Bounds on the costs of data encodings
- 1 December 1978
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 12 (1), 9-39
- https://doi.org/10.1007/bf01776564
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Preserving average proximity in arraysCommunications of the ACM, 1978
- Data encodings and their costsActa Informatica, 1978
- Space and Time Hierarchies for Classes of Control Structures and Data StructuresJournal of the ACM, 1976
- Preserving Proximity in ArraysSIAM Journal on Computing, 1975
- Representing Graphs by Knuth TreesJournal of the ACM, 1975
- Choosing a storage schemaActa Informatica, 1974
- Optimal numberings and isoperimetric problems on graphsJournal of Combinatorial Theory, 1966
- Optimal Assignments of Numbers to VerticesJournal of the Society for Industrial and Applied Mathematics, 1964