Bounds on the costs of data encodings
From MaRDI portal
Publication:4188717
DOI10.1007/BF01776564zbMath0403.68018OpenAlexW2044643854MaRDI QIDQ4188717
Lawrence V. Snyder, Arnold L. Rosenberg
Publication date: 1978
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01776564
Related Items (16)
Tabu search for the cyclic bandwidth problem ⋮ A new combinatorial approach to optimal embeddings of rectangles ⋮ Blocking for external graph searching ⋮ Uniform data encodings ⋮ Data encodings and their costs ⋮ Simulations among multidimensional Turing machines ⋮ On the k-ary hypercube ⋮ Unnamed Item ⋮ A comparison of two methods of encoding arrays ⋮ Storage representations for tree-like data structures ⋮ Representing graph families with edge grammars ⋮ Bandwidth and pebbling ⋮ Minimal storage representations for binary relations ⋮ Encoding search trees in lists† ⋮ Embeddings of binary trees in lines ⋮ Lattice bandwidth of random graphs
Cites Work
- Unnamed Item
- Data encodings and their costs
- Representing Graphs by Knuth Trees
- Preserving Proximity in Arrays
- Space and Time Hierarchies for Classes of Control Structures and Data Structures
- Preserving average proximity in arrays
- Optimal numberings and isoperimetric problems on graphs
- Optimal Assignments of Numbers to Vertices
This page was built for publication: Bounds on the costs of data encodings
