Uniform data encodings

DOI10.1016/0304-3975(80)90043-2zbMath0423.68028OpenAlexW2068657711MaRDI QIDQ1134520

Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence V. Snyder

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90043-2

zbMATH Keywords

linear time algorithmdata encodingsdata structure representationencoding of edge-labeled graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (5)

Uniform data encodings ⋮ Perfect Storage Representations for Families of Data Structures ⋮ Exposing graph uniformities via algebraic specification ⋮ Minimal storage representations for binary relations ⋮ Encoding search trees in lists^†

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Choosing a storage schema
• Uniform data encodings
• Data encodings and their costs
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Relationships between nondeterministic and deterministic tape complexities
• On the computational power of pushdown automata
• Encoding Data Structures in Trees
• Toward a theory of encoded data structures and data translation
• Pyramids: A data type for matrix representation in Pascal
• Bounds on the costs of data encodings
• Sur l'ordre maximum d'un élément dans le groupe $S_n$ des permutations
• Depth-First Search and Linear Graph Algorithms
• The complexity of theorem-proving procedures

This page was built for publication: Uniform data encodings