Uniform data encodings

DOI10.1016/0304-3975(80)90043-2MaRDI QIDQ1134520zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3557270 (Why is no real title available?)
• scientific article; zbMATH DE number 3588683 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Bounds on the costs of data encodings
• Choosing a storage schema
• Data encodings and their costs
• Depth-First Search and Linear Graph Algorithms
• Encoding Data Structures in Trees
• On the computational power of pushdown automata
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Pyramids: A data type for matrix representation in Pascal
• Relationships between nondeterministic and deterministic tape complexities
• Sur l'ordre maximum d'un élément dans le groupe S_n des permutations
• The complexity of theorem-proving procedures
• Toward a theory of encoded data structures and data translation
• Uniform data encodings

Cited in

(6)

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

This page was built for publication: Uniform data encodings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1134520)